Theorem hmphdis 23983

Description: Homeomorphisms preserve topological discreteness. (Contributed by Mario Carneiro, 10-Sep-2015.)

Hypothesis

Ref	Expression
hmphdis.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
hmphdis	⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 = 𝒫 𝑋)

Proof of Theorem hmphdis

Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pwuni 4916	. . . 4 ⊢ 𝐽 ⊆ 𝒫 ∪ 𝐽
2		hmphdis.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	2	pweqi 4583	. . . 4 ⊢ 𝒫 𝑋 = 𝒫 ∪ 𝐽
4	1, 3	sseqtrri 3989	. . 3 ⊢ 𝐽 ⊆ 𝒫 𝑋
5	4	a1i 11	. 2 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 ⊆ 𝒫 𝑋)
6		hmph 23963	. . 3 ⊢ (𝐽 ≃ 𝒫 𝐴 ↔ (𝐽Homeo𝒫 𝐴) ≠ ∅)
7		n0 4310	. . . 4 ⊢ ((𝐽Homeo𝒫 𝐴) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐽Homeo𝒫 𝐴))
8		elpwi 4574	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
9		imassrn 6078	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ⊆ ran 𝑓
10		unipw 5436	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝒫 𝐴 = 𝐴
11	10	eqcomi 2775	. . . . . . . . . . . . . 14 ⊢ 𝐴 = ∪ 𝒫 𝐴
12	2, 11	hmeof1o 23951	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝑓:𝑋–1-1-onto→𝐴)
13		f1of 6827	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–1-1-onto→𝐴 → 𝑓:𝑋⟶𝐴)
14		frn 6720	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋⟶𝐴 → ran 𝑓 ⊆ 𝐴)
15	12, 13, 14	3syl 19	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → ran 𝑓 ⊆ 𝐴)
16	15	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → ran 𝑓 ⊆ 𝐴)
17	9, 16	sstrid 3951	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ⊆ 𝐴)
18		vex 3462	. . . . . . . . . . . 12 ⊢ 𝑓 ∈ V
19	18	imaex 7920	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ∈ V
20	19	elpw 4571	. . . . . . . . . 10 ⊢ ((𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (𝑓 “ 𝑥) ⊆ 𝐴)
21	17, 20	sylibr 237	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ∈ 𝒫 𝐴)
22	2	hmeoopn 23953	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑥 ∈ 𝐽 ↔ (𝑓 “ 𝑥) ∈ 𝒫 𝐴))
23	21, 22	mpbird 260	. . . . . . . 8 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → 𝑥 ∈ 𝐽)
24	23	ex 418	. . . . . . 7 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → (𝑥 ⊆ 𝑋 → 𝑥 ∈ 𝐽))
25	8, 24	syl5 35	. . . . . 6 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → (𝑥 ∈ 𝒫 𝑋 → 𝑥 ∈ 𝐽))
26	25	ssrdv 3946	. . . . 5 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝒫 𝑋 ⊆ 𝐽)
27	26	exlimiv 1963	. . . 4 ⊢ (∃𝑓 𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝒫 𝑋 ⊆ 𝐽)
28	7, 27	sylbi 220	. . 3 ⊢ ((𝐽Homeo𝒫 𝐴) ≠ ∅ → 𝒫 𝑋 ⊆ 𝐽)
29	6, 28	sylbi 220	. 2 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝒫 𝑋 ⊆ 𝐽)
30	5, 29	eqssd 3957	1 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 = 𝒫 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ≠ wne 2961   ⊆ wss 3908  ∅c0 4289  𝒫 cpw 4567  ∪ cuni 4877   class class class wbr 5114  ran crn 5667   “ cima 5669  ⟶wf 6539  –1-1-onto→wf1o 6542  (class class class)co 7423  Homeochmeo 23940   ≃ chmph 23941

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-1o 8462  df-map 8835  df-top 23081  df-topon 23098  df-cn 23414  df-hmeo 23942  df-hmph 23943

This theorem is used by: (None)