| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resstopn | Structured version Visualization version GIF version | ||
| Description: The topology of a restricted structure. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| resstopn.1 | ⊢ 𝐻 = (𝐾 ↾s 𝐴) |
| resstopn.2 | ⊢ 𝐽 = (TopOpen‘𝐾) |
| Ref | Expression |
|---|---|
| resstopn | ⊢ (𝐽 ↾t 𝐴) = (TopOpen‘𝐻) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6880 | . . . . 5 ⊢ (TopSet‘𝐾) ∈ V | |
| 2 | fvex 6880 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
| 3 | restco 23221 | . . . . 5 ⊢ (((TopSet‘𝐾) ∈ V ∧ (Base‘𝐾) ∈ V ∧ 𝐴 ∈ V) → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴))) | |
| 4 | 1, 2, 3 | mp3an12 1472 | . . . 4 ⊢ (𝐴 ∈ V → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴))) |
| 5 | resstopn.1 | . . . . . 6 ⊢ 𝐻 = (𝐾 ↾s 𝐴) | |
| 6 | eqid 2762 | . . . . . 6 ⊢ (TopSet‘𝐾) = (TopSet‘𝐾) | |
| 7 | 5, 6 | resstset 17394 | . . . . 5 ⊢ (𝐴 ∈ V → (TopSet‘𝐾) = (TopSet‘𝐻)) |
| 8 | incom 4161 | . . . . . 6 ⊢ ((Base‘𝐾) ∩ 𝐴) = (𝐴 ∩ (Base‘𝐾)) | |
| 9 | eqid 2762 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 10 | 5, 9 | ressbas 17272 | . . . . . 6 ⊢ (𝐴 ∈ V → (𝐴 ∩ (Base‘𝐾)) = (Base‘𝐻)) |
| 11 | 8, 10 | eqtrid 2809 | . . . . 5 ⊢ (𝐴 ∈ V → ((Base‘𝐾) ∩ 𝐴) = (Base‘𝐻)) |
| 12 | 7, 11 | oveq12d 7414 | . . . 4 ⊢ (𝐴 ∈ V → ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴)) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
| 13 | 4, 12 | eqtrd 2797 | . . 3 ⊢ (𝐴 ∈ V → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
| 14 | 9, 6 | topnval 17463 | . . . . 5 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = (TopOpen‘𝐾) |
| 15 | resstopn.2 | . . . . 5 ⊢ 𝐽 = (TopOpen‘𝐾) | |
| 16 | 14, 15 | eqtr4i 2788 | . . . 4 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = 𝐽 |
| 17 | 16 | oveq1i 7406 | . . 3 ⊢ (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = (𝐽 ↾t 𝐴) |
| 18 | eqid 2762 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 19 | eqid 2762 | . . . 4 ⊢ (TopSet‘𝐻) = (TopSet‘𝐻) | |
| 20 | 18, 19 | topnval 17463 | . . 3 ⊢ ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (TopOpen‘𝐻) |
| 21 | 13, 17, 20 | 3eqtr3g 2820 | . 2 ⊢ (𝐴 ∈ V → (𝐽 ↾t 𝐴) = (TopOpen‘𝐻)) |
| 22 | simpr 488 | . . . 4 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → 𝐴 ∈ V) | |
| 23 | restfn 17453 | . . . . . 6 ⊢ ↾t Fn (V × V) | |
| 24 | 23 | fndmi 6625 | . . . . 5 ⊢ dom ↾t = (V × V) |
| 25 | 24 | ndmov 7580 | . . . 4 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
| 26 | 22, 25 | nsyl5 159 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝐽 ↾t 𝐴) = ∅) |
| 27 | reldmress 17268 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
| 28 | 27 | ovprc2 7436 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (𝐾 ↾s 𝐴) = ∅) |
| 29 | 5, 28 | eqtrid 2809 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ V → 𝐻 = ∅) |
| 30 | 29 | fveq2d 6871 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = (TopSet‘∅)) |
| 31 | tsetid 17382 | . . . . . . 7 ⊢ TopSet = Slot (TopSet‘ndx) | |
| 32 | 31 | str0 17225 | . . . . . 6 ⊢ ∅ = (TopSet‘∅) |
| 33 | 30, 32 | eqtr4di 2815 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = ∅) |
| 34 | 33 | oveq1d 7411 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (∅ ↾t (Base‘𝐻))) |
| 35 | 0rest 17458 | . . . 4 ⊢ (∅ ↾t (Base‘𝐻)) = ∅ | |
| 36 | 34, 20, 35 | 3eqtr3g 2820 | . . 3 ⊢ (¬ 𝐴 ∈ V → (TopOpen‘𝐻) = ∅) |
| 37 | 26, 36 | eqtr4d 2800 | . 2 ⊢ (¬ 𝐴 ∈ V → (𝐽 ↾t 𝐴) = (TopOpen‘𝐻)) |
| 38 | 21, 37 | pm2.61i 183 | 1 ⊢ (𝐽 ↾t 𝐴) = (TopOpen‘𝐻) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∩ cin 3903 ∅c0 4285 × cxp 5645 ‘cfv 6521 (class class class)co 7396 ndxcnx 17229 Basecbs 17245 ↾s cress 17266 TopSetcts 17292 ↾t crest 17449 TopOpenctopn 17450 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-tset 17305 df-rest 17451 df-topn 17452 |
| This theorem is referenced by: resstps 23244 submtmd 24161 subgtgp 24162 tsmssubm 24200 invrcn2 24237 ressusp 24321 ressxms 24582 ressms 24583 nrgtdrg 24750 tgioo3 24863 dfii4 24943 retopn 25438 rspectopn 34161 xrge0topn 34237 lmxrge0 34246 qqtopn 34305 |
| Copyright terms: Public domain | W3C validator |