| 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 17503 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 2737 | . . 3 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
| 3 | xpsval.k | . . . . 5 ⊢ 𝐺 = (Scalar‘𝑅) | |
| 4 | 3 | fvexi 6856 | . . . 4 ⊢ 𝐺 ∈ V |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 6 | 2on 8420 | . . . 4 ⊢ 2o ∈ On | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2o ∈ On) |
| 8 | xpsval.1 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
| 9 | xpsval.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
| 10 | fnpr2o 17490 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) | |
| 11 | 8, 9, 10 | syl2anc 585 | . . 3 ⊢ (𝜑 → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) |
| 12 | 1, 2, 5, 7, 11 | prdsbas2 17401 | . 2 ⊢ (𝜑 → (Base‘𝑈) = X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘))) |
| 13 | fvprif 17494 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) | |
| 14 | 13 | 3expia 1122 | . . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 15 | 8, 9, 14 | syl2anc 585 | . . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
| 16 | 15 | imp 406 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) |
| 17 | 16 | fveq2d 6846 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆))) |
| 18 | xpsval.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝑅) | |
| 19 | xpsval.y | . . . . . . 7 ⊢ 𝑌 = (Base‘𝑆) | |
| 20 | ifeq12 4500 | . . . . . . 7 ⊢ ((𝑋 = (Base‘𝑅) ∧ 𝑌 = (Base‘𝑆)) → if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆))) | |
| 21 | 18, 19, 20 | mp2an 693 | . . . . . 6 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) |
| 22 | fvif 6858 | . . . . . 6 ⊢ (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) | |
| 23 | 21, 22 | eqtr4i 2763 | . . . . 5 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) |
| 24 | 17, 23 | eqtr4di 2790 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = if(𝑘 = ∅, 𝑋, 𝑌)) |
| 25 | 24 | ixpeq2dva 8862 | . . 3 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌)) |
| 26 | xpsval.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 27 | 26 | xpsfrn 17501 | . . 3 ⊢ ran 𝐹 = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌) |
| 28 | 25, 27 | eqtr4di 2790 | . 2 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = ran 𝐹) |
| 29 | 12, 28 | eqtr2d 2773 | 1 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∅c0 4287 ifcif 4481 {cpr 4584 〈cop 4588 ran crn 5633 Oncon0 6325 Fn wfn 6495 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 1oc1o 8400 2oc2o 8401 Xcixp 8847 Basecbs 17148 Scalarcsca 17192 Xscprds 17377 ×s cxps 17439 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-fz 13436 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-mulr 17203 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-hom 17213 df-cco 17214 df-prds 17379 |
| This theorem is referenced by: xpsbas 17505 xpsaddlem 17506 xpsadd 17507 xpsmul 17508 xpssca 17509 xpsvsca 17510 xpsless 17511 xpsle 17512 xpsmnd 18714 xpsgrp 19001 xpsrngd 20126 xpsringd 20280 xpstps 23766 xpstopnlem2 23767 xpsdsfn 24333 xpsxmetlem 24335 xpsxmet 24336 xpsdsval 24337 xpsmet 24338 xpsxms 24490 xpsms 24491 |
| Copyright terms: Public domain | W3C validator |