Theorem hmphdis 24120

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 4905	. . . 4 ⊢ 𝐽 ⊆ 𝒫 ∪ 𝐽
2		hmphdis.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
3	2	pweqi 4572	. . . 4 ⊢ 𝒫 𝑋 = 𝒫 ∪ 𝐽
4	1, 3	sseqtrri 3957	. . 3 ⊢ 𝐽 ⊆ 𝒫 𝑋
5	4	a1i 11	. 2 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 ⊆ 𝒫 𝑋)
6		hmph 24100	. . 3 ⊢ (𝐽 ≃ 𝒫 𝐴 ↔ (𝐽Homeo𝒫 𝐴) ≠ ∅)
7		n0 4299	. . . 4 ⊢ ((𝐽Homeo𝒫 𝐴) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐽Homeo𝒫 𝐴))
8		elpwi 4563	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
9		imassrn 6197	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ⊆ ran 𝑓
10		unipw 5417	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝒫 𝐴 = 𝐴
11	10	eqcomi 2769	. . . . . . . . . . . . . 14 ⊢ 𝐴 = ∪ 𝒫 𝐴
12	2, 11	hmeof1o 24088	. . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝑓:𝑋–1-1-onto→𝐴)
13		f1of 6824	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–1-1-onto→𝐴 → 𝑓:𝑋⟶𝐴)
14		frn 6717	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋⟶𝐴 → ran 𝑓 ⊆ 𝐴)
15	12, 13, 14	3syl 19	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → ran 𝑓 ⊆ 𝐴)
16	15	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → ran 𝑓 ⊆ 𝐴)
17	9, 16	sstrid 3919	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ⊆ 𝐴)
18		vex 3454	. . . . . . . . . . . 12 ⊢ 𝑓 ∈ V
19	18	imaex 7926	. . . . . . . . . . 11 ⊢ (𝑓 “ 𝑥) ∈ V
20	19	elpw 4560	. . . . . . . . . 10 ⊢ ((𝑓 “ 𝑥) ∈ 𝒫 𝐴 ↔ (𝑓 “ 𝑥) ⊆ 𝐴)
21	17, 20	sylibr 237	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝐽Homeo𝒫 𝐴) ∧ 𝑥 ⊆ 𝑋) → (𝑓 “ 𝑥) ∈ 𝒫 𝐴)
22	2	hmeoopn 24090	. . . . . . . . 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 3914	. . . . 5 ⊢ (𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝒫 𝑋 ⊆ 𝐽)
27	26	exlimiv 1962	. . . 4 ⊢ (∃𝑓 𝑓 ∈ (𝐽Homeo𝒫 𝐴) → 𝒫 𝑋 ⊆ 𝐽)
28	7, 27	sylbi 220	. . 3 ⊢ ((𝐽Homeo𝒫 𝐴) ≠ ∅ → 𝒫 𝑋 ⊆ 𝐽)
29	6, 28	sylbi 220	. 2 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝒫 𝑋 ⊆ 𝐽)
30	5, 29	eqssd 3925	1 ⊢ (𝐽 ≃ 𝒫 𝐴 → 𝐽 = 𝒫 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556  ∪ cuni 4866   class class class wbr 5102  ran crn 5651   “ cima 5653  ⟶wf 6534  –1-1-onto→wf1o 6537  (class class class)co 7420  Homeochmeo 24077   ≃ chmph 24078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-1o 8479  df-map 8852  df-top 23217  df-topon 23234  df-cn 23550  df-hmeo 24079  df-hmph 24080

This theorem is used by: (None)