MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  indistps2 Structured version   Visualization version   GIF version

Theorem indistps2 23330
Description: The indiscrete topology on a set 𝐴 expressed as a topological space, using direct component assignments. Compare with indistps 23329. The advantage of this version is that it is the shortest to state and easiest to work with in most situations. Theorems indistpsALT 23331 and indistps2ALT 23332 show that the two forms can be derived from each other. (Contributed by NM, 24-Oct-2012.)
Hypotheses
Ref Expression
indistps2.a (Base‘𝐾) = 𝐴
indistps2.j (TopOpen‘𝐾) = {∅, 𝐴}
Assertion
Ref Expression
indistps2 𝐾 ∈ TopSp

Proof of Theorem indistps2
StepHypRef Expression
1 indistps2.a . 2 (Base‘𝐾) = 𝐴
2 indistps2.j . 2 (TopOpen‘𝐾) = {∅, 𝐴}
3 0ex 5260 . . . 4 ∅ ∈ V
4 fvex 6898 . . . . 5 (Base‘𝐾) ∈ V
51, 4eqeltrri 2857 . . . 4 𝐴 ∈ V
63, 5unipr 4883 . . 3 ∪ {∅, 𝐴} = (∅ ∪ 𝐴)
7 uncom 4157 . . 3 (∅ ∪ 𝐴) = (𝐴 ∪ ∅)
8 un0 4343 . . 3 (𝐴 ∪ ∅) = 𝐴
96, 7, 83eqtrri 2788 . 2 𝐴 = ∪ {∅, 𝐴}
10 indistop 23320 . 2 {∅, 𝐴} ∈ Top
111, 2, 9, 10istpsi 23260 1 𝐾 ∈ TopSp
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∪ cun 4149  ∅c0 4278  {cpr 4585  ∪ cuni 4866  ‘cfv 6538  Basecbs 17387  TopOpenctopn 17592  TopSpctps 23250
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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
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-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-top 23212  df-topon 23229  df-topsp 23251
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator