![]() |
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 23309 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))) | |
2 | con34b 315 | . . . 4 ⊢ ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (¬ 𝑥 = 𝑦 → ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))) | |
3 | df-ne 2930 | . . . . 5 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
4 | xor 1012 | . . . . . . . 8 ⊢ (¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜))) | |
5 | ancom 459 | . . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜) ↔ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)) | |
6 | 5 | orbi2i 910 | . . . . . . . 8 ⊢ (((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (𝑦 ∈ 𝑜 ∧ ¬ 𝑥 ∈ 𝑜)) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
7 | 4, 6 | bitri 274 | . . . . . . 7 ⊢ (¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
8 | 7 | rexbii 3083 | . . . . . 6 ⊢ (∃𝑜 ∈ 𝐽 ¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) |
9 | rexnal 3089 | . . . . . 6 ⊢ (∃𝑜 ∈ 𝐽 ¬ (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) | |
10 | 8, 9 | bitr3i 276 | . . . . 5 ⊢ (∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)) ↔ ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) |
11 | 3, 10 | imbi12i 349 | . . . 4 ⊢ ((𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))) ↔ (¬ 𝑥 = 𝑦 → ¬ ∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜))) |
12 | 2, 11 | bitr4i 277 | . . 3 ⊢ ((∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)))) |
13 | 12 | 2ralbii 3117 | . 2 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (∀𝑜 ∈ 𝐽 (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜)))) |
14 | 1, 13 | bitrdi 286 | 1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Kol2 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑜 ∈ 𝐽 ((𝑥 ∈ 𝑜 ∧ ¬ 𝑦 ∈ 𝑜) ∨ (¬ 𝑥 ∈ 𝑜 ∧ 𝑦 ∈ 𝑜))))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 ∈ wcel 2098 ≠ wne 2929 ∀wral 3050 ∃wrex 3059 ‘cfv 6549 TopOnctopon 22873 Kol2ct0 23271 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-iota 6501 df-fun 6551 df-fv 6557 df-topon 22874 df-t0 23278 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |