| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ressuss | Structured version Visualization version GIF version | ||
| Description: Value of the uniform structure of a restricted space. (Contributed by Thierry Arnoux, 12-Dec-2017.) |
| Ref | Expression |
|---|---|
| ressuss | ⊢ (𝐴 ∈ 𝑉 → (UnifSt‘(𝑊 ↾s 𝐴)) = ((UnifSt‘𝑊) ↾t (𝐴 × 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2730 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 2 | eqid 2730 | . . . . 5 ⊢ (UnifSet‘𝑊) = (UnifSet‘𝑊) | |
| 3 | 1, 2 | ussval 24154 | . . . 4 ⊢ ((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) = (UnifSt‘𝑊) |
| 4 | 3 | oveq1i 7400 | . . 3 ⊢ (((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ↾t (𝐴 × 𝐴)) = ((UnifSt‘𝑊) ↾t (𝐴 × 𝐴)) |
| 5 | fvex 6874 | . . . 4 ⊢ (UnifSet‘𝑊) ∈ V | |
| 6 | fvex 6874 | . . . . 5 ⊢ (Base‘𝑊) ∈ V | |
| 7 | 6, 6 | xpex 7732 | . . . 4 ⊢ ((Base‘𝑊) × (Base‘𝑊)) ∈ V |
| 8 | sqxpexg 7734 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) | |
| 9 | restco 23058 | . . . 4 ⊢ (((UnifSet‘𝑊) ∈ V ∧ ((Base‘𝑊) × (Base‘𝑊)) ∈ V ∧ (𝐴 × 𝐴) ∈ V) → (((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ↾t (𝐴 × 𝐴)) = ((UnifSet‘𝑊) ↾t (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴)))) | |
| 10 | 5, 7, 8, 9 | mp3an12i 1467 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (((UnifSet‘𝑊) ↾t ((Base‘𝑊) × (Base‘𝑊))) ↾t (𝐴 × 𝐴)) = ((UnifSet‘𝑊) ↾t (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴)))) |
| 11 | 4, 10 | eqtr3id 2779 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((UnifSt‘𝑊) ↾t (𝐴 × 𝐴)) = ((UnifSet‘𝑊) ↾t (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴)))) |
| 12 | inxp 5798 | . . . . 5 ⊢ (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴)) = (((Base‘𝑊) ∩ 𝐴) × ((Base‘𝑊) ∩ 𝐴)) | |
| 13 | incom 4175 | . . . . . . 7 ⊢ (𝐴 ∩ (Base‘𝑊)) = ((Base‘𝑊) ∩ 𝐴) | |
| 14 | eqid 2730 | . . . . . . . 8 ⊢ (𝑊 ↾s 𝐴) = (𝑊 ↾s 𝐴) | |
| 15 | 14, 1 | ressbas 17213 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ (Base‘𝑊)) = (Base‘(𝑊 ↾s 𝐴))) |
| 16 | 13, 15 | eqtr3id 2779 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((Base‘𝑊) ∩ 𝐴) = (Base‘(𝑊 ↾s 𝐴))) |
| 17 | 16 | sqxpeqd 5673 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (((Base‘𝑊) ∩ 𝐴) × ((Base‘𝑊) ∩ 𝐴)) = ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴)))) |
| 18 | 12, 17 | eqtrid 2777 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴)) = ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴)))) |
| 19 | 18 | oveq2d 7406 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((UnifSet‘𝑊) ↾t (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴))) = ((UnifSet‘𝑊) ↾t ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴))))) |
| 20 | 14, 2 | ressunif 17372 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (UnifSet‘𝑊) = (UnifSet‘(𝑊 ↾s 𝐴))) |
| 21 | 20 | oveq1d 7405 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((UnifSet‘𝑊) ↾t ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴)))) = ((UnifSet‘(𝑊 ↾s 𝐴)) ↾t ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴))))) |
| 22 | eqid 2730 | . . . . 5 ⊢ (Base‘(𝑊 ↾s 𝐴)) = (Base‘(𝑊 ↾s 𝐴)) | |
| 23 | eqid 2730 | . . . . 5 ⊢ (UnifSet‘(𝑊 ↾s 𝐴)) = (UnifSet‘(𝑊 ↾s 𝐴)) | |
| 24 | 22, 23 | ussval 24154 | . . . 4 ⊢ ((UnifSet‘(𝑊 ↾s 𝐴)) ↾t ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴)))) = (UnifSt‘(𝑊 ↾s 𝐴)) |
| 25 | 24 | a1i 11 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((UnifSet‘(𝑊 ↾s 𝐴)) ↾t ((Base‘(𝑊 ↾s 𝐴)) × (Base‘(𝑊 ↾s 𝐴)))) = (UnifSt‘(𝑊 ↾s 𝐴))) |
| 26 | 19, 21, 25 | 3eqtrd 2769 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((UnifSet‘𝑊) ↾t (((Base‘𝑊) × (Base‘𝑊)) ∩ (𝐴 × 𝐴))) = (UnifSt‘(𝑊 ↾s 𝐴))) |
| 27 | 11, 26 | eqtr2d 2766 | 1 ⊢ (𝐴 ∈ 𝑉 → (UnifSt‘(𝑊 ↾s 𝐴)) = ((UnifSt‘𝑊) ↾t (𝐴 × 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3450 ∩ cin 3916 × cxp 5639 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 ↾s cress 17207 UnifSetcunif 17237 ↾t crest 17390 UnifStcuss 24148 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-3 12257 df-4 12258 df-5 12259 df-6 12260 df-7 12261 df-8 12262 df-9 12263 df-n0 12450 df-z 12537 df-dec 12657 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-unif 17250 df-rest 17392 df-uss 24151 |
| This theorem is referenced by: ressust 24158 ressusp 24159 ucnextcn 24198 reust 25288 qqhucn 33989 |
| Copyright terms: Public domain | W3C validator |