| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > indistps2 | Structured version Visualization version GIF version | ||
| Description: The indiscrete topology on a set 𝐴 expressed as a topological space, using direct component assignments. Compare with indistps 23290. The advantage of this version is that it is the shortest to state and easiest to work with in most situations. Theorems indistpsALT 23292 and indistps2ALT 23293 show that the two forms can be derived from each other. (Contributed by NM, 24-Oct-2012.) |
| Ref | Expression |
|---|---|
| indistps2.a | ⊢ (Base‘𝐾) = 𝐴 |
| indistps2.j | ⊢ (TopOpen‘𝐾) = {∅, 𝐴} |
| Ref | Expression |
|---|---|
| indistps2 | ⊢ 𝐾 ∈ TopSp |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indistps2.a | . 2 ⊢ (Base‘𝐾) = 𝐴 | |
| 2 | indistps2.j | . 2 ⊢ (TopOpen‘𝐾) = {∅, 𝐴} | |
| 3 | 0ex 5260 | . . . 4 ⊢ ∅ ∈ V | |
| 4 | fvex 6886 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
| 5 | 1, 4 | eqeltrri 2857 | . . . 4 ⊢ 𝐴 ∈ V |
| 6 | 3, 5 | unipr 4883 | . . 3 ⊢ ∪ {∅, 𝐴} = (∅ ∪ 𝐴) |
| 7 | uncom 4104 | . . 3 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅) | |
| 8 | un0 4343 | . . 3 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 9 | 6, 7, 8 | 3eqtrri 2788 | . 2 ⊢ 𝐴 = ∪ {∅, 𝐴} |
| 10 | indistop 23281 | . 2 ⊢ {∅, 𝐴} ∈ Top | |
| 11 | 1, 2, 9, 10 | istpsi 23221 | 1 ⊢ 𝐾 ∈ TopSp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∪ cun 3896 ∅c0 4278 {cpr 4585 ∪ cuni 4866 ‘cfv 6527 Basecbs 17348 TopOpenctopn 17553 TopSpctps 23211 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-iota 6483 df-fun 6529 df-fv 6535 df-top 23173 df-topon 23190 df-topsp 23212 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |