| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > t1sep2 | Structured version Visualization version GIF version | ||
| Description: Any two points in a T1 space which have no separation are equal. (Contributed by Jeff Hankins, 1-Feb-2010.) |
| Ref | Expression |
|---|---|
| t1sep.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| t1sep2 | ⊢ ((𝐽 ∈ Fre ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | t1top 23317 | . . . . . 6 ⊢ (𝐽 ∈ Fre → 𝐽 ∈ Top) | |
| 2 | t1sep.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 2 | toptopon 22904 | . . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋)) |
| 4 | 1, 3 | sylib 220 | . . . . 5 ⊢ (𝐽 ∈ Fre → 𝐽 ∈ (TopOn‘𝑋)) |
| 5 | ist1-2 23334 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Fre → (𝐽 ∈ Fre ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) |
| 7 | 6 | ibi 269 | . . 3 ⊢ (𝐽 ∈ Fre → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦)) |
| 8 | eleq1 2829 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)) | |
| 9 | 8 | imbi1d 343 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜))) |
| 10 | 9 | ralbidv 3164 | . . . . 5 ⊢ (𝑥 = 𝐴 → (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜))) |
| 11 | eqeq1 2745 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
| 12 | 10, 11 | imbi12d 346 | . . . 4 ⊢ (𝑥 = 𝐴 → ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝐴 = 𝑦))) |
| 13 | eleq1 2829 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)) | |
| 14 | 13 | imbi2d 342 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜))) |
| 15 | 14 | ralbidv 3164 | . . . . 5 ⊢ (𝑦 = 𝐵 → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜))) |
| 16 | eqeq2 2753 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 = 𝑦 ↔ 𝐴 = 𝐵)) | |
| 17 | 15, 16 | imbi12d 346 | . . . 4 ⊢ (𝑦 = 𝐵 → ((∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝐴 = 𝑦) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵))) |
| 18 | 12, 17 | rspc2v 3573 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵))) |
| 19 | 7, 18 | mpan9 512 | . 2 ⊢ ((𝐽 ∈ Fre ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵)) |
| 20 | 19 | 3impb 1121 | 1 ⊢ ((𝐽 ∈ Fre ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ∀wral 3055 ∪ cuni 4841 ‘cfv 6489 Topctop 22880 TopOnctopon 22897 Frect1 23294 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-iota 6445 df-fun 6491 df-fv 6497 df-topgen 17401 df-top 22881 df-topon 22898 df-cld 23006 df-t1 23301 |
| This theorem is referenced by: t1sep 23357 isr0 23724 |
| Copyright terms: Public domain | W3C validator |