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 6678 | . . . . 5 ⊢ (TopSet‘𝐾) ∈ V | |
2 | fvex 6678 | . . . . 5 ⊢ (Base‘𝐾) ∈ V | |
3 | restco 21766 | . . . . 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 2821 | . . . . . 6 ⊢ (TopSet‘𝐾) = (TopSet‘𝐾) | |
7 | 5, 6 | resstset 16659 | . . . . 5 ⊢ (𝐴 ∈ V → (TopSet‘𝐾) = (TopSet‘𝐻)) |
8 | incom 4178 | . . . . . 6 ⊢ ((Base‘𝐾) ∩ 𝐴) = (𝐴 ∩ (Base‘𝐾)) | |
9 | eqid 2821 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
10 | 5, 9 | ressbas 16548 | . . . . . 6 ⊢ (𝐴 ∈ V → (𝐴 ∩ (Base‘𝐾)) = (Base‘𝐻)) |
11 | 8, 10 | syl5eq 2868 | . . . . 5 ⊢ (𝐴 ∈ V → ((Base‘𝐾) ∩ 𝐴) = (Base‘𝐻)) |
12 | 7, 11 | oveq12d 7168 | . . . 4 ⊢ (𝐴 ∈ V → ((TopSet‘𝐾) ↾t ((Base‘𝐾) ∩ 𝐴)) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
13 | 4, 12 | eqtrd 2856 | . . 3 ⊢ (𝐴 ∈ V → (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = ((TopSet‘𝐻) ↾t (Base‘𝐻))) |
14 | 9, 6 | topnval 16702 | . . . . 5 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = (TopOpen‘𝐾) |
15 | resstopn.2 | . . . . 5 ⊢ 𝐽 = (TopOpen‘𝐾) | |
16 | 14, 15 | eqtr4i 2847 | . . . 4 ⊢ ((TopSet‘𝐾) ↾t (Base‘𝐾)) = 𝐽 |
17 | 16 | oveq1i 7160 | . . 3 ⊢ (((TopSet‘𝐾) ↾t (Base‘𝐾)) ↾t 𝐴) = (𝐽 ↾t 𝐴) |
18 | eqid 2821 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
19 | eqid 2821 | . . . 4 ⊢ (TopSet‘𝐻) = (TopSet‘𝐻) | |
20 | 18, 19 | topnval 16702 | . . 3 ⊢ ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (TopOpen‘𝐻) |
21 | 13, 17, 20 | 3eqtr3g 2879 | . 2 ⊢ (𝐴 ∈ V → (𝐽 ↾t 𝐴) = (TopOpen‘𝐻)) |
22 | simpr 487 | . . . . 5 ⊢ ((𝐽 ∈ V ∧ 𝐴 ∈ V) → 𝐴 ∈ V) | |
23 | 22 | con3i 157 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ (𝐽 ∈ V ∧ 𝐴 ∈ V)) |
24 | restfn 16692 | . . . . . 6 ⊢ ↾t Fn (V × V) | |
25 | fndm 6450 | . . . . . 6 ⊢ ( ↾t Fn (V × V) → dom ↾t = (V × V)) | |
26 | 24, 25 | ax-mp 5 | . . . . 5 ⊢ dom ↾t = (V × V) |
27 | 26 | ndmov 7326 | . . . 4 ⊢ (¬ (𝐽 ∈ V ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ∅) |
28 | 23, 27 | syl 17 | . . 3 ⊢ (¬ 𝐴 ∈ V → (𝐽 ↾t 𝐴) = ∅) |
29 | reldmress 16544 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
30 | 29 | ovprc2 7190 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (𝐾 ↾s 𝐴) = ∅) |
31 | 5, 30 | syl5eq 2868 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ V → 𝐻 = ∅) |
32 | 31 | fveq2d 6669 | . . . . . 6 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = (TopSet‘∅)) |
33 | df-tset 16578 | . . . . . . 7 ⊢ TopSet = Slot 9 | |
34 | 33 | str0 16529 | . . . . . 6 ⊢ ∅ = (TopSet‘∅) |
35 | 32, 34 | syl6eqr 2874 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → (TopSet‘𝐻) = ∅) |
36 | 35 | oveq1d 7165 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ((TopSet‘𝐻) ↾t (Base‘𝐻)) = (∅ ↾t (Base‘𝐻))) |
37 | 0rest 16697 | . . . 4 ⊢ (∅ ↾t (Base‘𝐻)) = ∅ | |
38 | 36, 20, 37 | 3eqtr3g 2879 | . . 3 ⊢ (¬ 𝐴 ∈ V → (TopOpen‘𝐻) = ∅) |
39 | 28, 38 | eqtr4d 2859 | . 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 1533 ∈ wcel 2110 Vcvv 3495 ∩ cin 3935 ∅c0 4291 × cxp 5548 dom cdm 5550 Fn wfn 6345 ‘cfv 6350 (class class class)co 7150 9c9 11693 Basecbs 16477 ↾s cress 16478 TopSetcts 16565 ↾t crest 16688 TopOpenctopn 16689 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-tset 16578 df-rest 16690 df-topn 16691 |
This theorem is referenced by: resstps 21789 submtmd 22706 subgtgp 22707 tsmssubm 22745 invrcn2 22782 ressusp 22868 ressxms 23129 ressms 23130 nrgtdrg 23296 tgioo3 23407 dfii4 23486 retopn 23976 xrge0topn 31181 lmxrge0 31190 qqtopn 31247 |
Copyright terms: Public domain | W3C validator |