ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  istps GIF version

Theorem istps 15135
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 15134 . . 3 TopSp = {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))}
21eleq2i 2305 . 2 (𝐾 ∈ TopSp ↔ 𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))})
3 topontop 15117 . . . 4 (𝐽 ∈ (TopOn‘𝐴) → 𝐽 ∈ Top)
4 topnfn 13600 . . . . . . 7 TopOpen Fn V
5 fnrel 5479 . . . . . . 7 (TopOpen Fn V → Rel TopOpen)
64, 5ax-mp 5 . . . . . 6 Rel TopOpen
7 0opn 15109 . . . . . . 7 (𝐽 ∈ Top → ∅ ∈ 𝐽)
8 istps.j . . . . . . 7 𝐽 = (TopOpen‘𝐾)
97, 8eleqtrdi 2331 . . . . . 6 (𝐽 ∈ Top → ∅ ∈ (TopOpen‘𝐾))
10 relelfvdm 5727 . . . . . 6 ((Rel TopOpen ∧ ∅ ∈ (TopOpen‘𝐾)) → 𝐾 ∈ dom TopOpen)
116, 9, 10sylancr 418 . . . . 5 (𝐽 ∈ Top → 𝐾 ∈ dom TopOpen)
1211elexd 2835 . . . 4 (𝐽 ∈ Top → 𝐾 ∈ V)
133, 12syl 14 . . 3 (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ V)
14 fveq2 5695 . . . . 5 (𝑓 = 𝐾 → (TopOpen‘𝑓) = (TopOpen‘𝐾))
1514, 8eqtr4di 2289 . . . 4 (𝑓 = 𝐾 → (TopOpen‘𝑓) = 𝐽)
16 fveq2 5695 . . . . . 6 (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
17 istps.a . . . . . 6 𝐴 = (Base‘𝐾)
1816, 17eqtr4di 2289 . . . . 5 (𝑓 = 𝐾 → (Base‘𝑓) = 𝐴)
1918fveq2d 5699 . . . 4 (𝑓 = 𝐾 → (TopOn‘(Base‘𝑓)) = (TopOn‘𝐴))
2015, 19eleq12d 2309 . . 3 (𝑓 = 𝐾 → ((TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓)) ↔ 𝐽 ∈ (TopOn‘𝐴)))
2113, 20elab3 2978 . 2 (𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} ↔ 𝐽 ∈ (TopOn‘𝐴))
222, 21bitri 184 1 (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wb 105   = wceq 1402  wcel 2209  {cab 2224  Vcvv 2821  c0 3520  dom cdm 4774  Rel wrel 4779   Fn wfn 5372  cfv 5377  Basecbs 13354  TopOpenctopn 13596  Topctop 15100  TopOnctopon 15113  TopSpctps 15133
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-9 9371  df-ndx 13357  df-slot 13358  df-base 13360  df-tset 13452  df-rest 13597  df-topn 13598  df-top 15101  df-topon 15114  df-topsp 15134
This theorem is used by:  istps2  15136  tpspropd  15139  tsettps  15141  isxms2  15555  cnfldtopon  15643
  Copyright terms: Public domain W3C validator