| 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 23237. The advantage of this version is that it is the shortest to state and easiest to work with in most situations. Theorems indistpsALT 23239 and indistps2ALT 23240 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 5268 | . . . 4 ⊢ ∅ ∈ V | |
| 4 | fvex 6895 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
| 5 | 1, 4 | eqeltrri 2859 | . . . 4 ⊢ 𝐴 ∈ V |
| 6 | 3, 5 | unipr 4887 | . . 3 ⊢ ∪ {∅, 𝐴} = (∅ ∪ 𝐴) |
| 7 | uncom 4108 | . . 3 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅) | |
| 8 | un0 4347 | . . 3 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 9 | 6, 7, 8 | 3eqtrri 2790 | . 2 ⊢ 𝐴 = ∪ {∅, 𝐴} |
| 10 | indistop 23228 | . 2 ⊢ {∅, 𝐴} ∈ Top | |
| 11 | 1, 2, 9, 10 | istpsi 23168 | 1 ⊢ 𝐾 ∈ TopSp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3453 ∪ cun 3900 ∅c0 4282 {cpr 4589 ∪ cuni 4870 ‘cfv 6537 Basecbs 17305 TopOpenctopn 17510 TopSpctps 23158 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-top 23120 df-topon 23137 df-topsp 23159 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |