| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ist0-3 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a T0 space" expressed in more familiar terms. (Contributed by Jeff Hankins, 1-Feb-2010.) |
| Ref | Expression |
|---|---|
| ist0-3 | ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ist0-2 23238 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) | |
| 2 | con34b 316 | . . . 4 ⊢ ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (¬ 𝑥 = 𝑦 → ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))) | |
| 3 | df-ne 2927 | . . . . 5 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 4 | xor 1016 | . . . . . . . 8 ⊢ (¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜))) | |
| 5 | ancom 460 | . . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜) ↔ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)) | |
| 6 | 5 | orbi2i 912 | . . . . . . . 8 ⊢ (((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜)) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
| 7 | 4, 6 | bitri 275 | . . . . . . 7 ⊢ (¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
| 8 | 7 | rexbii 3077 | . . . . . 6 ⊢ (∃𝑜 ∈ 𝐽 ¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
| 9 | rexnal 3083 | . . . . . 6 ⊢ (∃𝑜 ∈ 𝐽 ¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) | |
| 10 | 8, 9 | bitr3i 277 | . . . . 5 ⊢ (∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)) ↔ ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) |
| 11 | 3, 10 | imbi12i 350 | . . . 4 ⊢ ((𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) ↔ (¬ 𝑥 = 𝑦 → ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))) |
| 12 | 2, 11 | bitr4i 278 | . . 3 ⊢ ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)))) |
| 13 | 12 | 2ralbii 3109 | . 2 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)))) |
| 14 | 1, 13 | bitrdi 287 | 1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ∃wrex 3054 ‘cfv 6514 TopOnctopon 22804 Kol2ct0 23200 |
| 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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-iota 6467 df-fun 6516 df-fv 6522 df-topon 22805 df-t0 23207 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |