| 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 17492 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 2729 | . . 3 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
| 3 | xpsval.k | . . . . 5 ⊢ 𝐺 = (Scalar‘𝑅) | |
| 4 | 3 | fvexi 6840 | . . . 4 ⊢ 𝐺 ∈ V |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 6 | 2on 8408 | . . . 4 ⊢ 2o ∈ On | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2o ∈ On) |
| 8 | xpsval.1 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
| 9 | xpsval.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
| 10 | fnpr2o 17479 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) | |
| 11 | 8, 9, 10 | syl2anc 584 | . . 3 ⊢ (𝜑 → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) |
| 12 | 1, 2, 5, 7, 11 | prdsbas2 17391 | . 2 ⊢ (𝜑 → (Base‘𝑈) = X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘))) |
| 13 | fvprif 17483 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) | |
| 14 | 13 | 3expia 1121 | . . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 15 | 8, 9, 14 | syl2anc 584 | . . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 16 | 15 | imp 406 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) |
| 17 | 16 | fveq2d 6830 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆))) |
| 18 | xpsval.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝑅) | |
| 19 | xpsval.y | . . . . . . 7 ⊢ 𝑌 = (Base‘𝑆) | |
| 20 | ifeq12 4497 | . . . . . . 7 ⊢ ((𝑋 = (Base‘𝑅) ∧ 𝑌 = (Base‘𝑆)) → if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆))) | |
| 21 | 18, 19, 20 | mp2an 692 | . . . . . 6 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) |
| 22 | fvif 6842 | . . . . . 6 ⊢ (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) | |
| 23 | 21, 22 | eqtr4i 2755 | . . . . 5 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) |
| 24 | 17, 23 | eqtr4di 2782 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = if(𝑘 = ∅, 𝑋, 𝑌)) |
| 25 | 24 | ixpeq2dva 8846 | . . 3 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌)) |
| 26 | xpsval.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 27 | 26 | xpsfrn 17490 | . . 3 ⊢ ran 𝐹 = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌) |
| 28 | 25, 27 | eqtr4di 2782 | . 2 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = ran 𝐹) |
| 29 | 12, 28 | eqtr2d 2765 | 1 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3438 ∅c0 4286 ifcif 4478 {cpr 4581 〈cop 4585 ran crn 5624 Oncon0 6311 Fn wfn 6481 ‘cfv 6486 (class class class)co 7353 ∈ cmpo 7355 1oc1o 8388 2oc2o 8389 Xcixp 8831 Basecbs 17138 Scalarcsca 17182 Xscprds 17367 ×s cxps 17428 |
| 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 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8632 df-map 8762 df-ixp 8832 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-sup 9351 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-5 12212 df-6 12213 df-7 12214 df-8 12215 df-9 12216 df-n0 12403 df-z 12490 df-dec 12610 df-uz 12754 df-fz 13429 df-struct 17076 df-slot 17111 df-ndx 17123 df-base 17139 df-plusg 17192 df-mulr 17193 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-hom 17203 df-cco 17204 df-prds 17369 |
| This theorem is referenced by: xpsbas 17494 xpsaddlem 17495 xpsadd 17496 xpsmul 17497 xpssca 17498 xpsvsca 17499 xpsless 17500 xpsle 17501 xpsmnd 18669 xpsgrp 18956 xpsrngd 20082 xpsringd 20235 xpstps 23713 xpstopnlem2 23714 xpsdsfn 24281 xpsxmetlem 24283 xpsxmet 24284 xpsdsval 24285 xpsmet 24286 xpsxms 24438 xpsms 24439 |
| Copyright terms: Public domain | W3C validator |