![]() |
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 17630 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 2740 | . . 3 ⊢ (Base‘𝑈) = (Base‘𝑈) | |
3 | xpsval.k | . . . . 5 ⊢ 𝐺 = (Scalar‘𝑅) | |
4 | 3 | fvexi 6934 | . . . 4 ⊢ 𝐺 ∈ V |
5 | 4 | a1i 11 | . . 3 ⊢ (𝜑 → 𝐺 ∈ V) |
6 | 2on 8536 | . . . 4 ⊢ 2o ∈ On | |
7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → 2o ∈ On) |
8 | xpsval.1 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉) | |
9 | xpsval.2 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
10 | fnpr2o 17617 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) | |
11 | 8, 9, 10 | syl2anc 583 | . . 3 ⊢ (𝜑 → {〈∅, 𝑅〉, 〈1o, 𝑆〉} Fn 2o) |
12 | 1, 2, 5, 7, 11 | prdsbas2 17529 | . 2 ⊢ (𝜑 → (Base‘𝑈) = X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘))) |
13 | fvprif 17621 | . . . . . . . . 9 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) | |
14 | 13 | 3expia 1121 | . . . . . . . 8 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
15 | 8, 9, 14 | syl2anc 583 | . . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 2o → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆))) |
16 | 15 | imp 406 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → ({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘) = if(𝑘 = ∅, 𝑅, 𝑆)) |
17 | 16 | fveq2d 6924 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆))) |
18 | xpsval.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝑅) | |
19 | xpsval.y | . . . . . . 7 ⊢ 𝑌 = (Base‘𝑆) | |
20 | ifeq12 4566 | . . . . . . 7 ⊢ ((𝑋 = (Base‘𝑅) ∧ 𝑌 = (Base‘𝑆)) → if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆))) | |
21 | 18, 19, 20 | mp2an 691 | . . . . . 6 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) |
22 | fvif 6936 | . . . . . 6 ⊢ (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) = if(𝑘 = ∅, (Base‘𝑅), (Base‘𝑆)) | |
23 | 21, 22 | eqtr4i 2771 | . . . . 5 ⊢ if(𝑘 = ∅, 𝑋, 𝑌) = (Base‘if(𝑘 = ∅, 𝑅, 𝑆)) |
24 | 17, 23 | eqtr4di 2798 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 2o) → (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = if(𝑘 = ∅, 𝑋, 𝑌)) |
25 | 24 | ixpeq2dva 8970 | . . 3 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌)) |
26 | xpsval.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
27 | 26 | xpsfrn 17628 | . . 3 ⊢ ran 𝐹 = X𝑘 ∈ 2o if(𝑘 = ∅, 𝑋, 𝑌) |
28 | 25, 27 | eqtr4di 2798 | . 2 ⊢ (𝜑 → X𝑘 ∈ 2o (Base‘({〈∅, 𝑅〉, 〈1o, 𝑆〉}‘𝑘)) = ran 𝐹) |
29 | 12, 28 | eqtr2d 2781 | 1 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∅c0 4352 ifcif 4548 {cpr 4650 〈cop 4654 ran crn 5701 Oncon0 6395 Fn wfn 6568 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 1oc1o 8515 2oc2o 8516 Xcixp 8955 Basecbs 17258 Scalarcsca 17314 Xscprds 17505 ×s cxps 17566 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-struct 17194 df-slot 17229 df-ndx 17241 df-base 17259 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 17507 |
This theorem is referenced by: xpsbas 17632 xpsaddlem 17633 xpsadd 17634 xpsmul 17635 xpssca 17636 xpsvsca 17637 xpsless 17638 xpsle 17639 xpsmnd 18812 xpsgrp 19099 xpsrngd 20206 xpsringd 20355 xpstps 23839 xpstopnlem2 23840 xpsdsfn 24408 xpsxmetlem 24410 xpsxmet 24411 xpsdsval 24412 xpsmet 24413 xpsxms 24568 xpsms 24569 |
Copyright terms: Public domain | W3C validator |