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

Theorem istps 23128
Description: Express the predicate "is a topological space." (Contributed by Mario Carneiro, 13-Aug-2015.)
Hypotheses
Ref Expression
istps.a 𝐴 = (Base‘𝐾)
istps.j 𝐽 = (TopOpen‘𝐾)
Assertion
Ref Expression
istps (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴))

Proof of Theorem istps
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 df-topsp 23127 . . 3 TopSp = {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))}
21eleq2i 2858 . 2 (𝐾 ∈ TopSp ↔ 𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))})
3 topontop 23107 . . . 4 (𝐽 ∈ (TopOn‘𝐴) → 𝐽 ∈ Top)
4 0ntop 23099 . . . . . 6 ¬ ∅ ∈ Top
5 istps.j . . . . . . . 8 𝐽 = (TopOpen‘𝐾)
6 fvprc 6880 . . . . . . . 8 𝐾 ∈ V → (TopOpen‘𝐾) = ∅)
75, 6eqtrid 2813 . . . . . . 7 𝐾 ∈ V → 𝐽 = ∅)
87eleq1d 2851 . . . . . 6 𝐾 ∈ V → (𝐽 ∈ Top ↔ ∅ ∈ Top))
94, 8mtbiri 330 . . . . 5 𝐾 ∈ V → ¬ 𝐽 ∈ Top)
109con4i 115 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ V)
113, 10syl 18 . . 3 (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ V)
12 fveq2 6888 . . . . 5 (𝑓 = 𝐾 → (TopOpen‘𝑓) = (TopOpen‘𝐾))
1312, 5eqtr4di 2819 . . . 4 (𝑓 = 𝐾 → (TopOpen‘𝑓) = 𝐽)
14 fveq2 6888 . . . . . 6 (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
15 istps.a . . . . . 6 𝐴 = (Base‘𝐾)
1614, 15eqtr4di 2819 . . . . 5 (𝑓 = 𝐾 → (Base‘𝑓) = 𝐴)
1716fveq2d 6892 . . . 4 (𝑓 = 𝐾 → (TopOn‘(Base‘𝑓)) = (TopOn‘𝐴))
1813, 17eleq12d 2860 . . 3 (𝑓 = 𝐾 → ((TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓)) ↔ 𝐽 ∈ (TopOn‘𝐴)))
1911, 18elab3 3648 . 2 (𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} ↔ 𝐽 ∈ (TopOn‘𝐴))
202, 19bitri 278 1 (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209   = wceq 1570  wcel 2146  {cab 2744  Vcvv 3458  c0 4289  cfv 6543  Basecbs 17294  TopOpenctopn 17499  Topctop 23087  TopOnctopon 23104  TopSpctps 23126
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-top 23088  df-topon 23105  df-topsp 23127
This theorem is used by:  istps2  23129  tpspropd  23132  tsettps  23135  indistps2ALT  23208  resstps  23381  prdstps  23823  imastps  23915  xpstopnlem2  24005  tmdtopon  24275  tgptopon  24276  istgp2  24285  oppgtmd  24291  distgp  24293  indistgp  24294  efmndtmd  24295  qustgplem  24315  prdstmdd  24318  eltsms  24327  tsmscls  24332  tsmsgsum  24333  tsmsid  24334  tsmsmhm  24340  tsmsadd  24341  dvrcn  24378  cnmpt1vsca  24388  cnmpt2vsca  24389  tlmtgp  24390  ressusp  24458  tustps  24466  ucncn  24478  neipcfilu  24489  cnextucn  24496  ucnextcn  24497  isxms2  24642  ressxms  24719  prdsxmslem2  24723  nrgtrg  24884  cnfldtopon  24976  cnmpt1ds  25037  cnmpt2ds  25038  nmcn  25039  cnmpt1ip  25443  cnmpt2ip  25444  csscld  25445  clsocv  25446  minveclem4a  25626  rspectps  34304  mhmhmeotmd  34348  rrxtopon  47043  qndenserrnopnlem  47052
  Copyright terms: Public domain W3C validator