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

Theorem indistps2 23357
Description: The indiscrete topology on a set 𝐴 expressed as a topological space, using direct component assignments. Compare with indistps 23356. The advantage of this version is that it is the shortest to state and easiest to work with in most situations. Theorems indistpsALT 23358 and indistps2ALT 23359 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 5264 . . . 4 ∅ ∈ V
4 fvex 6918 . . . . 5 (Base‘𝐾) ∈ V
51, 4eqeltrri 2861 . . . 4 𝐴 ∈ V
63, 5unipr 4887 . . 3 ∪ {∅, 𝐴} = (∅ ∪ 𝐴)
7 uncom 4160 . . 3 (∅ ∪ 𝐴) = (𝐴 ∪ ∅)
8 un0 4347 . . 3 (𝐴 ∪ ∅) = 𝐴
96, 7, 83eqtrri 2791 . 2 𝐴 = ∪ {∅, 𝐴}
10 indistop 23347 . 2 {∅, 𝐴} ∈ Top
111, 2, 9, 10istpsi 23287 1 𝐾 ∈ TopSp
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  ∅c0 4281  {cpr 4590  ∪ cuni 4870  ‘cfv 6555  Basecbs 17413  TopOpenctopn 17618  TopSpctps 23277
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6509  df-fun 6557  df-fv 6563  df-top 23239  df-topon 23256  df-topsp 23278
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator