| 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 23179. The advantage of this version is that it is the shortest to state and easiest to work with in most situations. Theorems indistpsALT 23181 and indistps2ALT 23182 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 5269 | . . . 4 ⊢ ∅ ∈ V | |
| 4 | fvex 6894 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
| 5 | 1, 4 | eqeltrri 2859 | . . . 4 ⊢ 𝐴 ∈ V |
| 6 | 3, 5 | unipr 4888 | . . 3 ⊢ ∪ {∅, 𝐴} = (∅ ∪ 𝐴) |
| 7 | uncom 4111 | . . 3 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅) | |
| 8 | un0 4350 | . . 3 ⊢ (𝐴 ∪ ∅) = 𝐴 | |
| 9 | 6, 7, 8 | 3eqtrri 2790 | . 2 ⊢ 𝐴 = ∪ {∅, 𝐴} |
| 10 | indistop 23170 | . 2 ⊢ {∅, 𝐴} ∈ Top | |
| 11 | 1, 2, 9, 10 | istpsi 23110 | 1 ⊢ 𝐾 ∈ TopSp |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2142 Vcvv 3454 ∪ cun 3902 ∅c0 4285 {cpr 4590 ∪ cuni 4871 ‘cfv 6536 Basecbs 17275 TopOpenctopn 17480 TopSpctps 23100 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-iota 6492 df-fun 6538 df-fv 6544 df-top 23062 df-topon 23079 df-topsp 23101 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |