| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ist1 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a T1 space". (Contributed by FL, 18-Jun-2007.) |
| Ref | Expression |
|---|---|
| ist0.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ist1 | ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unieq 4877 | . . . 4 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽) | |
| 2 | ist0.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 1, 2 | eqtr4di 2813 | . . 3 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋) |
| 4 | fveq2 6886 | . . . 4 ⊢ (𝑥 = 𝐽 → (Clsd‘𝑥) = (Clsd‘𝐽)) | |
| 5 | 4 | eleq2d 2846 | . . 3 ⊢ (𝑥 = 𝐽 → ({𝑎} ∈ (Clsd‘𝑥) ↔ {𝑎} ∈ (Clsd‘𝐽))) |
| 6 | 3, 5 | raleqbidv 3334 | . 2 ⊢ (𝑥 = 𝐽 → (∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥) ↔ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| 7 | df-t1 23638 | . 2 ⊢ Fre = {𝑥 ∈ Top ∣ ∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥)} | |
| 8 | 6, 7 | elrab2 3648 | 1 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 {csn 4584 ∪ cuni 4866 ‘cfv 6539 Topctop 23217 Clsdccld 23340 Frect1 23631 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-iota 6494 df-fv 6547 df-t1 23638 |
| This theorem is used by: t1sncld 23650 t1ficld 23651 t1top 23654 ist1-2 23671 cnt1 23674 ordtt1 23703 qtopt1 34514 zarmxt1 34559 onint1 37330 |
| Copyright terms: Public domain | W3C validator |