| 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 17474 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 2731 | . . 3 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
| 3 | xpsval.k | . . . . 5 ⊢ 𝐺 = (Scalar‘𝑅) | |
| 4 | 3 | fvexi 6836 | . . . 4 ⊢ 𝐺 ∈ V |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
| 6 | 2on 8398 | . . . 4 ⊢ 2o ∈ On | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2o ∈ On) |
| 8 | xpsval.1 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
| 9 | xpsval.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
| 10 | fnpr2o 17461 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) | |
| 11 | 8, 9, 10 | syl2anc 584 | . . 3 ⊢ (𝜑 → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) |
| 12 | 1, 2, 5, 7, 11 | prdsbas2 17373 | . 2 ⊢ (𝜑 → (Base‘𝑈) = X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘))) |
| 13 | fvprif 17465 | . . . . . . . . 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 6826 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆))) |
| 18 | xpsval.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝑅) | |
| 19 | xpsval.y | . . . . . . 7 ⊢ 𝑌 = (Base‘𝑆) | |
| 20 | ifeq12 4494 | . . . . . . 7 ⊢ ((𝑋 = (Base‘𝑅) ∧ 𝑌 = (Base‘𝑆)) → if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆))) | |
| 21 | 18, 19, 20 | mp2an 692 | . . . . . 6 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) |
| 22 | fvif 6838 | . . . . . 6 ⊢ (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) | |
| 23 | 21, 22 | eqtr4i 2757 | . . . . 5 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) |
| 24 | 17, 23 | eqtr4di 2784 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = if(𝑘 = ∅, 𝑋, 𝑌)) |
| 25 | 24 | ixpeq2dva 8836 | . . 3 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌)) |
| 26 | xpsval.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 27 | 26 | xpsfrn 17472 | . . 3 ⊢ ran 𝐹 = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌) |
| 28 | 25, 27 | eqtr4di 2784 | . 2 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = ran 𝐹) |
| 29 | 12, 28 | eqtr2d 2767 | 1 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∅c0 4283 ifcif 4475 {cpr 4578 〈cop 4582 ran crn 5617 Oncon0 6306 Fn wfn 6476 ‘cfv 6481 (class class class)co 7346 ∈ cmpo 7348 1oc1o 8378 2oc2o 8379 Xcixp 8821 Basecbs 17120 Scalarcsca 17164 Xscprds 17349 ×s cxps 17410 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-ixp 8822 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-3 12189 df-4 12190 df-5 12191 df-6 12192 df-7 12193 df-8 12194 df-9 12195 df-n0 12382 df-z 12469 df-dec 12589 df-uz 12733 df-fz 13408 df-struct 17058 df-slot 17093 df-ndx 17105 df-base 17121 df-plusg 17174 df-mulr 17175 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-hom 17185 df-cco 17186 df-prds 17351 |
| This theorem is referenced by: xpsbas 17476 xpsaddlem 17477 xpsadd 17478 xpsmul 17479 xpssca 17480 xpsvsca 17481 xpsless 17482 xpsle 17483 xpsmnd 18685 xpsgrp 18972 xpsrngd 20098 xpsringd 20251 xpstps 23726 xpstopnlem2 23727 xpsdsfn 24293 xpsxmetlem 24295 xpsxmet 24296 xpsdsval 24297 xpsmet 24298 xpsxms 24450 xpsms 24451 |
| Copyright terms: Public domain | W3C validator |