| Mathbox for ML |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > topdifinffin | Structured version Visualization version GIF version | ||
| Description: Part of Exercise 3 of [Munkres] p. 83. The topology of all subsets 𝑥 of 𝐴 such that the complement of 𝑥 in 𝐴 is infinite, or 𝑥 is the empty set, or 𝑥 is all of 𝐴, is a topology only if 𝐴 is finite. (Contributed by ML, 17-Jul-2020.) |
| Ref | Expression |
|---|---|
| topdifinf.t | ⊢ 𝑇 = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))} |
| Ref | Expression |
|---|---|
| topdifinffin | ⊢ (𝑇 ∈ (TopOn‘𝐴) → 𝐴 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | topdifinf.t | . . 3 ⊢ 𝑇 = {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))} | |
| 2 | difeq2 4071 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝐴 ∖ 𝑥) = (𝐴 ∖ 𝑦)) | |
| 3 | 2 | eleq1d 2813 | . . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝐴 ∖ 𝑥) ∈ Fin ↔ (𝐴 ∖ 𝑦) ∈ Fin)) |
| 4 | 3 | notbid 318 | . . . . 5 ⊢ (𝑥 = 𝑦 → (¬ (𝐴 ∖ 𝑥) ∈ Fin ↔ ¬ (𝐴 ∖ 𝑦) ∈ Fin)) |
| 5 | eqeq1 2733 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅)) | |
| 6 | eqeq1 2733 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝐴 ↔ 𝑦 = 𝐴)) | |
| 7 | 5, 6 | orbi12d 918 | . . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) ↔ (𝑦 = ∅ ∨ 𝑦 = 𝐴))) |
| 8 | 4, 7 | orbi12d 918 | . . . 4 ⊢ (𝑥 = 𝑦 → ((¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) ↔ (¬ (𝐴 ∖ 𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴)))) |
| 9 | 8 | cbvrabv 3405 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑥) ∈ Fin ∨ (𝑥 = ∅ ∨ 𝑥 = 𝐴))} = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))} |
| 10 | 1, 9 | eqtri 2752 | . 2 ⊢ 𝑇 = {𝑦 ∈ 𝒫 𝐴 ∣ (¬ (𝐴 ∖ 𝑦) ∈ Fin ∨ (𝑦 = ∅ ∨ 𝑦 = 𝐴))} |
| 11 | 10 | topdifinffinlem 37341 | 1 ⊢ (𝑇 ∈ (TopOn‘𝐴) → 𝐴 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∨ wo 847 = wceq 1540 ∈ wcel 2109 {crab 3394 ∖ cdif 3900 ∅c0 4284 𝒫 cpw 4551 ‘cfv 6482 Fincfn 8872 TopOnctopon 22795 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-om 7800 df-1o 8388 df-en 8873 df-fin 8876 df-topgen 17347 df-top 22779 df-topon 22796 |
| This theorem is referenced by: topdifinf 37343 |
| Copyright terms: Public domain | W3C validator |