Theorem hmphindis 23805

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 4639	. . 3 ⊢ {∅} = {∅, ∅}
2		indislem 23007	. . . . . . 7 ⊢ {∅, ( I ‘𝐴)} = {∅, 𝐴}
3		preq2 4734	. . . . . . . 8 ⊢ (( I ‘𝐴) = ∅ → {∅, ( I ‘𝐴)} = {∅, ∅})
4	3, 1	eqtr4di 2795	. . . . . . 7 ⊢ (( I ‘𝐴) = ∅ → {∅, ( I ‘𝐴)} = {∅})
5	2, 4	eqtr3id 2791	. . . . . 6 ⊢ (( I ‘𝐴) = ∅ → {∅, 𝐴} = {∅})
6	5	breq2d 5155	. . . . 5 ⊢ (( I ‘𝐴) = ∅ → (𝐽 ≃ {∅, 𝐴} ↔ 𝐽 ≃ {∅}))
7	6	biimpac 478	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 ≃ {∅})
8		hmph0 23803	. . . 4 ⊢ (𝐽 ≃ {∅} ↔ 𝐽 = {∅})
9	7, 8	sylib 218	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 = {∅})
10	9	unieqd 4920	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → ∪ 𝐽 = ∪ {∅})
11		hmphdis.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
12		0ex 5307	. . . . . . 7 ⊢ ∅ ∈ V
13	12	unisn 4926	. . . . . 6 ⊢ ∪ {∅} = ∅
14	13	eqcomi 2746	. . . . 5 ⊢ ∅ = ∪ {∅}
15	10, 11, 14	3eqtr4g 2802	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝑋 = ∅)
16	15	preq2d 4740	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → {∅, 𝑋} = {∅, ∅})
17	1, 9, 16	3eqtr4a 2803	. 2 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) = ∅) → 𝐽 = {∅, 𝑋})
18		hmphen 23793	. . . . 5 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 ≈ {∅, 𝐴})
19		necom 2994	. . . . . . . 8 ⊢ (( I ‘𝐴) ≠ ∅ ↔ ∅ ≠ ( I ‘𝐴))
20		fvex 6919	. . . . . . . . 9 ⊢ ( I ‘𝐴) ∈ V
21		enpr2 10042	. . . . . . . . 9 ⊢ ((∅ ∈ V ∧ ( I ‘𝐴) ∈ V ∧ ∅ ≠ ( I ‘𝐴)) → {∅, ( I ‘𝐴)} ≈ 2o)
22	12, 20, 21	mp3an12 1453	. . . . . . . 8 ⊢ (∅ ≠ ( I ‘𝐴) → {∅, ( I ‘𝐴)} ≈ 2o)
23	19, 22	sylbi 217	. . . . . . 7 ⊢ (( I ‘𝐴) ≠ ∅ → {∅, ( I ‘𝐴)} ≈ 2o)
24	23	adantl 481	. . . . . 6 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → {∅, ( I ‘𝐴)} ≈ 2o)
25	2, 24	eqbrtrrid 5179	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → {∅, 𝐴} ≈ 2o)
26		entr 9046	. . . . 5 ⊢ ((𝐽 ≈ {∅, 𝐴} ∧ {∅, 𝐴} ≈ 2o) → 𝐽 ≈ 2o)
27	18, 25, 26	syl2an2r 685	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ≈ 2o)
28		hmphtop1 23787	. . . . . . 7 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 ∈ Top)
29	28	adantr 480	. . . . . 6 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ∈ Top)
30	11	toptopon 22923	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
31	29, 30	sylib 218	. . . . 5 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 ∈ (TopOn‘𝑋))
32		en2top 22992	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ≈ 2o ↔ (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅)))
33	31, 32	syl 17	. . . 4 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → (𝐽 ≈ 2o ↔ (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅)))
34	27, 33	mpbid 232	. . 3 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → (𝐽 = {∅, 𝑋} ∧ 𝑋 ≠ ∅))
35	34	simpld 494	. 2 ⊢ ((𝐽 ≃ {∅, 𝐴} ∧ ( I ‘𝐴) ≠ ∅) → 𝐽 = {∅, 𝑋})
36	17, 35	pm2.61dane 3029	1 ⊢ (𝐽 ≃ {∅, 𝐴} → 𝐽 = {∅, 𝑋})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108   ≠ wne 2940  Vcvv 3480  ∅c0 4333  {csn 4626  {cpr 4628  ∪ cuni 4907   class class class wbr 5143   I cid 5577  ‘cfv 6561  2_oc2o 8500   ≈ cen 8982  Topctop 22899  TopOnctopon 22916   ≃ chmph 23762

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-1o 8506  df-2o 8507  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-card 9979  df-top 22900  df-topon 22917  df-cn 23235  df-hmeo 23763  df-hmph 23764

This theorem is referenced by: (None)