hmphindis - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > hmphindis		Structured version Visualization version GIF version

Theorem hmphindis 23714

Description: Homeomorphisms preserve topological indiscreteness. (Contributed by FL, 18-Aug-2008.) (Revised by Mario Carneiro, 10-Sep-2015.)

**Hypothesis**
Ref	Expression
hmphdis.1	⊢ 𝑋 = ∪ 𝐽

**Assertion**
Ref	Expression
hmphindis	⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 = {∅, 𝑋})

**Proof of Theorem hmphindis**
Step	Hyp	Ref	Expression
1		dfsn2 4642	. . 3 ⊢ {∅} = {∅, ∅}
2		indislem 22916	. . . . . . 7 ⊢ {∅, ( I ‘𝐴)} = {∅, 𝐴}
3		preq2 4739	. . . . . . . 8 ⊢ (( I ‘𝐴) = ∅ → {∅, ( I ‘𝐴)} = {∅, ∅})
4	3, 1	eqtr4di 2786	. . . . . . 7 ⊢ (( I ‘𝐴) = ∅ → {∅, ( I ‘𝐴)} = {∅})
5	2, 4	eqtr3id 2782	. . . . . 6 ⊢ (( I ‘𝐴) = ∅ → {∅, 𝐴} = {∅})
6	5	breq2d 5160	. . . . 5 ⊢ (( I ‘𝐴) = ∅ → (𝐽 ≃ {∅, 𝐴} ↔ 𝐽 ≃ {∅}))
7	6	biimpac 478	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 ≃ {∅})
8		hmph0 23712	. . . 4 ⊢ (𝐽 ≃ {∅} ↔ 𝐽 = {∅})
9	7, 8	sylib 217	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 = {∅})
10	9	unieqd 4921	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → ∪ 𝐽 = ∪ {∅})
11		hmphdis.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
12		0ex 5307	. . . . . . 7 ⊢ ∅ ∈ V
13	12	unisn 4929	. . . . . 6 ⊢ ∪ {∅} = ∅
14	13	eqcomi 2737	. . . . 5 ⊢ ∅ = ∪ {∅}
15	10, 11, 14	3eqtr4g 2793	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝑋 = ∅)
16	15	preq2d 4745	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → {∅, 𝑋} = {∅, ∅})
17	1, 9, 16	3eqtr4a 2794	. 2 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 = {∅, 𝑋})
18		hmphen 23702	. . . . 5 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 ≈ {∅, 𝐴})
19		necom 2991	. . . . . . . 8 ⊢ (( I ‘𝐴) ≠ ∅ ↔ ∅ ≠ ( I ‘𝐴))
20		fvex 6910	. . . . . . . . 9 ⊢ ( I ‘𝐴) ∈ V
21		enpr2 10026	. . . . . . . . 9 ⊢ ((∅ ∈ V ∧ ( I ‘𝐴) ∈ V ∧ ∅ ≠ ( I ‘𝐴)) → {∅, ( I ‘𝐴)} ≈ 2_o)
22	12, 20, 21	mp3an12 1448	. . . . . . . 8 ⊢ (∅ ≠ ( I ‘𝐴) → {∅, ( I ‘𝐴)} ≈ 2_o)
23	19, 22	sylbi 216	. . . . . . 7 ⊢ (( I ‘𝐴) ≠ ∅ → {∅, ( I ‘𝐴)} ≈ 2_o)
24	23	adantl 481	. . . . . 6 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → {∅, ( I ‘𝐴)} ≈ 2_o)
25	2, 24	eqbrtrrid 5184	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → {∅, 𝐴} ≈ 2_o)
26		entr 9027	. . . . 5 ⊢ ((𝐽 ≈ {∅, 𝐴} ∧ {∅, 𝐴} ≈ 2_o) → 𝐽 ≈ 2_o)
27	18, 25, 26	syl2an2r 684	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ≈ 2_o)
28		hmphtop1 23696	. . . . . . 7 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 ∈ Top)
29	28	adantr 480	. . . . . 6 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ∈ Top)
30	11	toptopon 22832	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31	29, 30	sylib 217	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ∈ (TopOn‘𝑋))
32		en2top 22901	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ≈ 2_o ↔ (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅)))
33	31, 32	syl 17	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → (𝐽 ≈ 2_o ↔ (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅)))
34	27, 33	mpbid 231	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅))
35	34	simpld 494	. 2 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 = {∅, 𝑋})
36	17, 35	pm2.61dane 3026	1 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 = {∅, 𝑋})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ≠ wne 2937 Vcvv 3471 ∅c0 4323 {csn 4629 {cpr 4631 ∪ cuni 4908 class class class wbr 5148 I cid 5575 ‘cfv 6548 2_oc2o 8481 ≈ cen 8961 Topctop 22808 TopOnctopon 22825 ≃ chmph 23671

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-1o 8487 df-2o 8488 df-er 8725 df-map 8847 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-card 9963 df-top 22809 df-topon 22826 df-cn 23144 df-hmeo 23672 df-hmph 23673

This theorem is referenced by: (None)

W3C validator

	
		OSZAR »