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 6685 | . . . . 5 ⊢ (TopSet‘𝐾) ∈ V | |
2 | fvex 6685 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
3 | restco 21774 | . . . . 5 ⊢ (((TopSet‘𝐾) ∈ V ∧ (Base‘𝐾) ∈ V ∧ 𝐴 ∈ V) → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴))) | |
4 | 1, 2, 3 | mp3an12 1447 | . . . 4 ⊢ (𝐴 ∈ V → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴))) |
5 | resstopn.1 | . . . . . 6 ⊢ 𝐻 = (𝐾 ↾s 𝐴) | |
6 | eqid 2823 | . . . . . 6 ⊢ (TopSet‘𝐾) = (TopSet‘𝐾) | |
7 | 5, 6 | resstset 16667 | . . . . 5 ⊢ (𝐴 ∈ V → (TopSet‘𝐾) = (TopSet‘𝐻)) |
8 | incom 4180 | . . . . . 6 ⊢ ((Base‘𝐾) ∩ 𝐴) = (𝐴 ∩ (Base‘𝐾)) | |
9 | eqid 2823 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
10 | 5, 9 | ressbas 16556 | . . . . . 6 ⊢ (𝐴 ∈ V → (𝐴 ∩ (Base‘𝐾)) = (Base‘𝐻)) |
11 | 8, 10 | syl5eq 2870 | . . . . 5 ⊢ (𝐴 ∈ V → ((Base‘𝐾) ∩ 𝐴) = (Base‘𝐻)) |
12 | 7, 11 | oveq12d 7176 | . . . 4 ⊢ (𝐴 ∈ V → ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴)) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
13 | 4, 12 | eqtrd 2858 | . . 3 ⊢ (𝐴 ∈ V → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
14 | 9, 6 | topnval 16710 | . . . . 5 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = (TopOpen‘𝐾) |
15 | resstopn.2 | . . . . 5 ⊢ 𝐽 = (TopOpen‘𝐾) | |
16 | 14, 15 | eqtr4i 2849 | . . . 4 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = 𝐽 |
17 | 16 | oveq1i 7168 | . . 3 ⊢ (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = (𝐽 ↾t 𝐴) |
18 | eqid 2823 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
19 | eqid 2823 | . . . 4 ⊢ (TopSet‘𝐻) = (TopSet‘𝐻) | |
20 | 18, 19 | topnval 16710 | . . 3 ⊢ ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (TopOpen‘𝐻) |
21 | 13, 17, 20 | 3eqtr3g 2881 | . 2 ⊢ (𝐴 ∈ V → (𝐽 ↾t 𝐴) = (TopOpen‘𝐻)) |
22 | simpr 487 | . . . . 5 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → 𝐴 ∈ V) | |
23 | 22 | con3i 157 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
24 | restfn 16700 | . . . . . 6 ⊢ ↾t Fn (V × V) | |
25 | fndm 6457 | . . . . . 6 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
26 | 24, 25 | ax-mp 5 | . . . . 5 ⊢ dom ↾t = (V × V) |
27 | 26 | ndmov 7334 | . . . 4 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
28 | 23, 27 | syl 17 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝐽 ↾t 𝐴) = ∅) |
29 | reldmress 16552 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
30 | 29 | ovprc2 7198 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (𝐾 ↾s 𝐴) = ∅) |
31 | 5, 30 | syl5eq 2870 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ V → 𝐻 = ∅) |
32 | 31 | fveq2d 6676 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = (TopSet‘∅)) |
33 | df-tset 16586 | . . . . . . 7 ⊢ TopSet = Slot 9 | |
34 | 33 | str0 16537 | . . . . . 6 ⊢ ∅ = (TopSet‘∅) |
35 | 32, 34 | syl6eqr 2876 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = ∅) |
36 | 35 | oveq1d 7173 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (∅ ↾t (Base‘𝐻))) |
37 | 0rest 16705 | . . . 4 ⊢ (∅ ↾t (Base‘𝐻)) = ∅ | |
38 | 36, 20, 37 | 3eqtr3g 2881 | . . 3 ⊢ (¬ 𝐴 ∈ V → (TopOpen‘𝐻) = ∅) |
39 | 28, 38 | eqtr4d 2861 | . 2 ⊢ (¬ 𝐴 ∈ V → (𝐽 ↾t 𝐴) = (TopOpen‘𝐻)) |
40 | 21, 39 | pm2.61i 184 | 1 ⊢ (𝐽 ↾t 𝐴) = (TopOpen‘𝐻) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 398 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ∩ cin 3937 ∅c0 4293 × cxp 5555 dom cdm 5557 Fn wfn 6352 ‘cfv 6357 (class class class)co 7158 9c9 11702 Basecbs 16485 ↾s cress 16486 TopSetcts 16573 ↾t crest 16696 TopOpenctopn 16697 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-tset 16586 df-rest 16698 df-topn 16699 |
This theorem is referenced by: resstps 21797 submtmd 22714 subgtgp 22715 tsmssubm 22753 invrcn2 22790 ressusp 22876 ressxms 23137 ressms 23138 nrgtdrg 23304 tgioo3 23415 dfii4 23494 retopn 23984 xrge0topn 31188 lmxrge0 31197 qqtopn 31254 |
Copyright terms: Public domain | W3C validator |