| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > istps | 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 15269 | . . 3 ⊢ TopSp = {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} | |
| 2 | 1 | eleq2i 2305 | . 2 ⊢ (𝐾 ∈ TopSp ↔ 𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))}) |
| 3 | topontop 15252 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝐴) → 𝐽 ∈ Top) | |
| 4 | topnfn 13658 | . . . . . . 7 ⊢ TopOpen Fn V | |
| 5 | fnrel 5482 | . . . . . . 7 ⊢ (TopOpen Fn V → Rel TopOpen) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . 6 ⊢ Rel TopOpen |
| 7 | 0opn 15244 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ∅ ∈ 𝐽) | |
| 8 | istps.j | . . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝐾) | |
| 9 | 7, 8 | eleqtrdi 2331 | . . . . . 6 ⊢ (𝐽 ∈ Top → ∅ ∈ (TopOpen‘𝐾)) |
| 10 | relelfvdm 5730 | . . . . . 6 ⊢ ((Rel TopOpen ∧ ∅ ∈ (TopOpen‘𝐾)) → 𝐾 ∈ dom TopOpen) | |
| 11 | 6, 9, 10 | sylancr 418 | . . . . 5 ⊢ (𝐽 ∈ Top → 𝐾 ∈ dom TopOpen) |
| 12 | 11 | elexd 2835 | . . . 4 ⊢ (𝐽 ∈ Top → 𝐾 ∈ V) |
| 13 | 3, 12 | syl 14 | . . 3 ⊢ (𝐽 ∈ (TopOn‘𝐴) → 𝐾 ∈ V) |
| 14 | fveq2 5698 | . . . . 5 ⊢ (𝑓 = 𝐾 → (TopOpen‘𝑓) = (TopOpen‘𝐾)) | |
| 15 | 14, 8 | eqtr4di 2289 | . . . 4 ⊢ (𝑓 = 𝐾 → (TopOpen‘𝑓) = 𝐽) |
| 16 | fveq2 5698 | . . . . . 6 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾)) | |
| 17 | istps.a | . . . . . 6 ⊢ 𝐴 = (Base‘𝐾) | |
| 18 | 16, 17 | eqtr4di 2289 | . . . . 5 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = 𝐴) |
| 19 | 18 | fveq2d 5702 | . . . 4 ⊢ (𝑓 = 𝐾 → (TopOn‘(Base‘𝑓)) = (TopOn‘𝐴)) |
| 20 | 15, 19 | eleq12d 2309 | . . 3 ⊢ (𝑓 = 𝐾 → ((TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓)) ↔ 𝐽 ∈ (TopOn‘𝐴))) |
| 21 | 13, 20 | elab3 2978 | . 2 ⊢ (𝐾 ∈ {𝑓 ∣ (TopOpen‘𝑓) ∈ (TopOn‘(Base‘𝑓))} ↔ 𝐽 ∈ (TopOn‘𝐴)) |
| 22 | 2, 21 | bitri 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 4776 Rel wrel 4781 Fn wfn 5375 ‘cfv 5380 Basecbs 13411 TopOpenctopn 13654 Topctop 15235 TopOnctopon 15248 TopSpctps 15268 |
| 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 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-cnex 8277 ax-resscn 8278 ax-1re 8280 ax-addrcl 8283 |
| 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 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-5 9376 df-6 9377 df-7 9378 df-8 9379 df-9 9380 df-ndx 13414 df-slot 13415 df-base 13417 df-tset 13510 df-rest 13655 df-topn 13656 df-top 15236 df-topon 15249 df-topsp 15269 |
| This theorem is used by: istps2 15271 tpspropd 15274 tsettps 15276 isxms2 15690 cnfldtopon 15778 |
| Copyright terms: Public domain | W3C validator |