| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpsrnbas | Structured version Visualization version GIF version | ||
| Description: The indexed structure product that appears in xpsval 17625 has the same base as the target of the function 𝐹. (Contributed by Mario Carneiro, 15-Aug-2015.) (Revised by Jim Kingdon, 25-Sep-2023.) |
| Ref | Expression |
|---|---|
| xpsval.t | ⊢ 𝑇 = (𝑅 ×s 𝑆) |
| xpsval.x | ⊢ 𝑋 = (Base‘𝑅) |
| xpsval.y | ⊢ 𝑌 = (Base‘𝑆) |
| xpsval.1 | ⊢ (𝜑 → 𝑅 ∈ 𝑉) |
| xpsval.2 | ⊢ (𝜑 → 𝑆 ∈ 𝑊) |
| xpsval.f | ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) |
| xpsval.k | ⊢ 𝐺 = (Scalar‘𝑅) |
| xpsval.u | ⊢ 𝑈 = (𝐺Xs{〈∅, 𝑅〉, 〈1o, 𝑆〉}) |
| Ref | Expression |
|---|---|
| xpsrnbas | ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpsval.u | . . 3 ⊢ 𝑈 = (𝐺Xs{〈∅, 𝑅〉, 〈1o, 𝑆〉}) | |
| 2 | eqid 2763 | . . 3 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
| 3 | xpsval.k | . . . . 5 ⊢ 𝐺 = (Scalar‘𝑅) | |
| 4 | 3 | fvexi 6897 | . . . 4 ⊢ 𝐺 ∈ V |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 6 | 2on 8468 | . . . 4 ⊢ 2o ∈ On | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2o ∈ On) |
| 8 | xpsval.1 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
| 9 | xpsval.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
| 10 | fnpr2o 17612 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) | |
| 11 | 8, 9, 10 | syl2anc 595 | . . 3 ⊢ (𝜑 → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) |
| 12 | 1, 2, 5, 7, 11 | prdsbas2 17523 | . 2 ⊢ (𝜑 → (Base‘𝑈) = X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘))) |
| 13 | fvprif 17616 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) | |
| 14 | 13 | 3expia 1139 | . . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 15 | 8, 9, 14 | syl2anc 595 | . . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 16 | 15 | imp 411 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) |
| 17 | 16 | fveq2d 6887 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆))) |
| 18 | xpsval.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝑅) | |
| 19 | xpsval.y | . . . . . . 7 ⊢ 𝑌 = (Base‘𝑆) | |
| 20 | ifeq12 4507 | . . . . . . 7 ⊢ ((𝑋 = (Base‘𝑅) ∧ 𝑌 = (Base‘𝑆)) → if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆))) | |
| 21 | 18, 19, 20 | mp2an 704 | . . . . . 6 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) |
| 22 | fvif 6899 | . . . . . 6 ⊢ (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) | |
| 23 | 21, 22 | eqtr4i 2789 | . . . . 5 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) |
| 24 | 17, 23 | eqtr4di 2816 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = if(𝑘 = ∅, 𝑋, 𝑌)) |
| 25 | 24 | ixpeq2dva 8911 | . . 3 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌)) |
| 26 | xpsval.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 27 | 26 | xpsfrn 17623 | . . 3 ⊢ ran 𝐹 = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌) |
| 28 | 25, 27 | eqtr4di 2816 | . 2 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = ran 𝐹) |
| 29 | 12, 28 | eqtr2d 2799 | 1 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∅c0 4287 ifcif 4488 {cpr 4592 〈cop 4596 ran crn 5664 Oncon0 6362 Fn wfn 6533 ‘cfv 6538 (class class class)co 7412 ∈ cmpo 7414 1oc1o 8447 2oc2o 8448 Xcixp 8896 Basecbs 17270 Scalarcsca 17314 Xscprds 17499 ×s cxps 17561 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-er 8695 df-map 8827 df-ixp 8897 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-5 12307 df-6 12308 df-7 12309 df-8 12310 df-9 12311 df-n0 12506 df-z 12593 df-dec 12713 df-uz 12864 df-fz 13537 df-struct 17208 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-hom 17335 df-cco 17336 df-prds 17501 |
| This theorem is referenced by: xpsbas 17627 xpsaddlem 17628 xpsadd 17629 xpsmul 17630 xpssca 17631 xpsvsca 17632 xpsless 17633 xpsle 17634 xpsmnd 18836 xpsgrp 19126 xpsrngd 20258 xpsringd 20415 xpstps 23948 xpstopnlem2 23949 xpsdsfn 24515 xpsxmetlem 24517 xpsxmet 24518 xpsdsval 24519 xpsmet 24520 xpsxms 24672 xpsms 24673 |
| Copyright terms: Public domain | W3C validator |