Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > istps | Structured version Visualization version GIF version |
Description: Express the predicate "is a topological space." (Contributed by Mario Carneiro, 13-Aug-2015.) |
Ref | Expression |
---|---|
istps.a | ⊢ 𝐴 = (Base‘𝐾) |
istps.j | ⊢ 𝐽 = (TopOpen‘𝐾) |
Ref | Expression |
---|---|
istps | ⊢ (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-topsp 21990 | . . 3 ⊢ TopSp = {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} | |
2 | 1 | eleq2i 2830 | . 2 ⊢ (𝐾 ∈ TopSp ↔ 𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))}) |
3 | topontop 21970 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝐴) → 𝐽 ∈ Top) | |
4 | 0ntop 21962 | . . . . . 6 ⊢ ¬ ∅ ∈ Top | |
5 | istps.j | . . . . . . . 8 ⊢ 𝐽 = (TopOpen‘𝐾) | |
6 | fvprc 6748 | . . . . . . . 8 ⊢ (¬ 𝐾 ∈ V → (TopOpen‘𝐾) = ∅) | |
7 | 5, 6 | eqtrid 2790 | . . . . . . 7 ⊢ (¬ 𝐾 ∈ V → 𝐽 = ∅) |
8 | 7 | eleq1d 2823 | . . . . . 6 ⊢ (¬ 𝐾 ∈ V → (𝐽 ∈ Top ↔ ∅ ∈ Top)) |
9 | 4, 8 | mtbiri 326 | . . . . 5 ⊢ (¬ 𝐾 ∈ V → ¬ 𝐽 ∈ Top) |
10 | 9 | con4i 114 | . . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ V) |
11 | 3, 10 | syl 17 | . . 3 ⊢ (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ V) |
12 | fveq2 6756 | . . . . 5 ⊢ (𝑓 = 𝐾 → (TopOpen‘𝑓) = (TopOpen‘𝐾)) | |
13 | 12, 5 | eqtr4di 2797 | . . . 4 ⊢ (𝑓 = 𝐾 → (TopOpen‘𝑓) = 𝐽) |
14 | fveq2 6756 | . . . . . 6 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾)) | |
15 | istps.a | . . . . . 6 ⊢ 𝐴 = (Base‘𝐾) | |
16 | 14, 15 | eqtr4di 2797 | . . . . 5 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = 𝐴) |
17 | 16 | fveq2d 6760 | . . . 4 ⊢ (𝑓 = 𝐾 → (TopOn‘(Base‘𝑓)) = (TopOn‘𝐴)) |
18 | 13, 17 | eleq12d 2833 | . . 3 ⊢ (𝑓 = 𝐾 → ((TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓)) ↔ 𝐽 ∈ (TopOn‘𝐴))) |
19 | 11, 18 | elab3 3610 | . 2 ⊢ (𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} ↔ 𝐽 ∈ (TopOn‘𝐴)) |
20 | 2, 19 | bitri 274 | 1 ⊢ (𝐾 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 = wceq 1539 ∈ wcel 2108 {cab 2715 Vcvv 3422 ∅c0 4253 ‘cfv 6418 Basecbs 16840 TopOpenctopn 17049 Topctop 21950 TopOnctopon 21967 TopSpctps 21989 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-iota 6376 df-fun 6420 df-fv 6426 df-top 21951 df-topon 21968 df-topsp 21990 |
This theorem is referenced by: istps2 21992 tpspropd 21995 tsettps 21998 indistps2ALT 22073 resstps 22246 prdstps 22688 imastps 22780 xpstopnlem2 22870 tmdtopon 23140 tgptopon 23141 istgp2 23150 oppgtmd 23156 distgp 23158 indistgp 23159 efmndtmd 23160 qustgplem 23180 prdstmdd 23183 eltsms 23192 tsmscls 23197 tsmsgsum 23198 tsmsid 23199 tsmsmhm 23205 tsmsadd 23206 dvrcn 23243 cnmpt1vsca 23253 cnmpt2vsca 23254 tlmtgp 23255 ressusp 23324 tustps 23333 ucncn 23345 neipcfilu 23356 cnextucn 23363 ucnextcn 23364 isxms2 23509 ressxms 23587 prdsxmslem2 23591 nrgtrg 23760 cnfldtopon 23852 cnmpt1ds 23911 cnmpt2ds 23912 nmcn 23913 cnmpt1ip 24316 cnmpt2ip 24317 csscld 24318 clsocv 24319 minveclem4a 24499 rspectps 31735 mhmhmeotmd 31779 rrxtopon 43719 qndenserrnopnlem 43728 |
Copyright terms: Public domain | W3C validator |