| 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 23308 | . . . . . 6 ⊢ (𝐽 ∈ Fre → 𝐽 ∈ Top) | |
| 2 | t1sep.1 | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 2 | toptopon 22895 | . . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋)) |
| 4 | 1, 3 | sylib 218 | . . . . 5 ⊢ (𝐽 ∈ Fre → 𝐽 ∈ (TopOn‘𝑋)) |
| 5 | ist1-2 23325 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Fre ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) | |
| 6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝐽 ∈ Fre → (𝐽 ∈ Fre ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) |
| 7 | 6 | ibi 267 | . . 3 ⊢ (𝐽 ∈ Fre → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦)) |
| 8 | eleq1 2825 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝐴 ∈ 𝑜)) | |
| 9 | 8 | imbi1d 341 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜))) |
| 10 | 9 | ralbidv 3161 | . . . . 5 ⊢ (𝑥 = 𝐴 → (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜))) |
| 11 | eqeq1 2741 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
| 12 | 10, 11 | imbi12d 344 | . . . 4 ⊢ (𝑥 = 𝐴 → ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝐴 = 𝑦))) |
| 13 | eleq1 2825 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑜 ↔ 𝐵 ∈ 𝑜)) | |
| 14 | 13 | imbi2d 340 | . . . . . 6 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜))) |
| 15 | 14 | ralbidv 3161 | . . . . 5 ⊢ (𝑦 = 𝐵 → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) ↔ ∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜))) |
| 16 | eqeq2 2749 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 = 𝑦 ↔ 𝐴 = 𝐵)) | |
| 17 | 15, 16 | imbi12d 344 | . . . 4 ⊢ (𝑦 = 𝐵 → ((∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝐴 = 𝑦) ↔ (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵))) |
| 18 | 12, 17 | rspc2v 3576 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 → 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵))) |
| 19 | 7, 18 | mpan9 506 | . 2 ⊢ ((𝐽 ∈ Fre ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵)) |
| 20 | 19 | 3impb 1115 | 1 ⊢ ((𝐽 ∈ Fre ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑜 ∈ 𝐽 (𝐴 ∈ 𝑜 → 𝐵 ∈ 𝑜) → 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∪ cuni 4851 ‘cfv 6493 Topctop 22871 TopOnctopon 22888 Frect1 23285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6449 df-fun 6495 df-fv 6501 df-topgen 17400 df-top 22872 df-topon 22889 df-cld 22997 df-t1 23292 |
| This theorem is referenced by: t1sep 23348 isr0 23715 |
| Copyright terms: Public domain | W3C validator |