Theorem hmphdis 24095

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 4906	. . . 4 ⊢ 𝐽 ⊆ 𝒫 ∪ 𝐽
2		hmphdis.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	2	pweqi 4573	. . . 4 ⊢ 𝒫 𝑋 = 𝒫 ∪ 𝐽
4	1, 3	sseqtrri 3980	. . 3 ⊢ 𝐽 ⊆ 𝒫 𝑋
5	4	a1i 11	. 2 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 ⊆ 𝒫 𝑋)
6		hmph 24075	. . 3 ⊢ (𝐽 ≃ 𝒫 𝐴 ↔ (𝐽Homeo𝒫 𝐴) ≠ ∅)
7		n0 4300	. . . 4 ⊢ ((𝐽Homeo𝒫 𝐴) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐽Homeo𝒫 𝐴))
8		elpwi 4564	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
9		imassrn 6065	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ⊆ ran 𝑓
10		unipw 5418	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝒫 𝐴 = 𝐴
11	10	eqcomi 2770	. . . . . . . . . . . . . 14 ⊢ 𝐴 = ∪ 𝒫 𝐴
12	2, 11	hmeof1o 24063	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝑓:𝑋–1-1-onto→𝐴)
13		f1of 6816	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–1-1-onto→𝐴 → 𝑓:𝑋⟶𝐴)
14		frn 6709	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋⟶𝐴 → ran 𝑓 ⊆ 𝐴)
15	12, 13, 14	3syl 19	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → ran 𝑓 ⊆ 𝐴)
16	15	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → ran 𝑓 ⊆ 𝐴)
17	9, 16	sstrid 3942	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ⊆ 𝐴)
18		vex 3455	. . . . . . . . . . . 12 ⊢ 𝑓 ∈ V
19	18	imaex 7915	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ∈ V
20	19	elpw 4561	. . . . . . . . . 10 ⊢ ((𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (𝑓 “ 𝑥) ⊆ 𝐴)
21	17, 20	sylibr 237	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ∈ 𝒫 𝐴)
22	2	hmeoopn 24065	. . . . . . . . 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 3937	. . . . 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 3948	1 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 = 𝒫 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103  ran crn 5652   “ cima 5654  ⟶wf 6527  –1-1-onto→wf1o 6530  (class class class)co 7412  Homeochmeo 24052   ≃ chmph 24053

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-1o 8460  df-map 8833  df-top 23192  df-topon 23209  df-cn 23525  df-hmeo 24054  df-hmph 24055

This theorem is used by: (None)