| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prdsvscacl | Structured version Visualization version GIF version | ||
| Description: Pointwise scalar multiplication is closed in products of modules. (Contributed by Stefan O'Rear, 10-Jan-2015.) |
| Ref | Expression |
|---|---|
| prdsvscacl.y | ⊢ 𝑌 = (𝑆Xs𝑅) |
| prdsvscacl.b | ⊢ 𝐵 = (Base‘𝑌) |
| prdsvscacl.t | ⊢ · = ( ·𝑠 ‘𝑌) |
| prdsvscacl.k | ⊢ 𝐾 = (Base‘𝑆) |
| prdsvscacl.s | ⊢ (𝜑 → 𝑆 ∈ Ring) |
| prdsvscacl.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| prdsvscacl.r | ⊢ (𝜑 → 𝑅:𝐼⟶LMod) |
| prdsvscacl.f | ⊢ (𝜑 → 𝐹 ∈ 𝐾) |
| prdsvscacl.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| prdsvscacl.sr | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Scalar‘(𝑅‘𝑥)) = 𝑆) |
| Ref | Expression |
|---|---|
| prdsvscacl | ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prdsvscacl.y | . . 3 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 2 | prdsvscacl.b | . . 3 ⊢ 𝐵 = (Base‘𝑌) | |
| 3 | prdsvscacl.t | . . 3 ⊢ · = ( ·𝑠 ‘𝑌) | |
| 4 | prdsvscacl.k | . . 3 ⊢ 𝐾 = (Base‘𝑆) | |
| 5 | prdsvscacl.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ Ring) | |
| 6 | prdsvscacl.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 7 | prdsvscacl.r | . . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶LMod) | |
| 8 | 7 | ffnd 6687 | . . 3 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 9 | prdsvscacl.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐾) | |
| 10 | prdsvscacl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 11 | 1, 2, 3, 4, 5, 6, 8, 9, 10 | prdsvscaval 17499 | . 2 ⊢ (𝜑 → (𝐹 · 𝐺) = (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)))) |
| 12 | 7 | ffvelcdmda 7060 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ LMod) |
| 13 | 9 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝐾) |
| 14 | prdsvscacl.sr | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Scalar‘(𝑅‘𝑥)) = 𝑆) | |
| 15 | 14 | fveq2d 6866 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘𝑆)) |
| 16 | 15, 4 | eqtr4di 2814 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = 𝐾) |
| 17 | 13, 16 | eleqtrrd 2864 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥)))) |
| 18 | 5 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ Ring) |
| 19 | 6 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑊) |
| 20 | 8 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 Fn 𝐼) |
| 21 | 10 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ 𝐵) |
| 22 | simpr 488 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 23 | 1, 2, 18, 19, 20, 21, 22 | prdsbasprj 17492 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) |
| 24 | eqid 2761 | . . . . . 6 ⊢ (Base‘(𝑅‘𝑥)) = (Base‘(𝑅‘𝑥)) | |
| 25 | eqid 2761 | . . . . . 6 ⊢ (Scalar‘(𝑅‘𝑥)) = (Scalar‘(𝑅‘𝑥)) | |
| 26 | eqid 2761 | . . . . . 6 ⊢ ( ·𝑠 ‘(𝑅‘𝑥)) = ( ·𝑠 ‘(𝑅‘𝑥)) | |
| 27 | eqid 2761 | . . . . . 6 ⊢ (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘(Scalar‘(𝑅‘𝑥))) | |
| 28 | 24, 25, 26, 27 | lmodvscl 20933 | . . . . 5 ⊢ (((𝑅‘𝑥) ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥))) ∧ (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 29 | 12, 17, 23, 28 | syl3anc 1389 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 30 | 29 | ralrimiva 3153 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 31 | 1, 2, 5, 6, 8 | prdsbasmpt 17490 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥)))) |
| 32 | 30, 31 | mpbird 259 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵) |
| 33 | 11, 32 | eqeltrd 2861 | 1 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 ↦ cmpt 5178 Fn wfn 6511 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 Basecbs 17236 Scalarcsca 17280 ·𝑠 cvsca 17281 Xscprds 17465 Ringcrg 20270 LModclmod 20915 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-map 8804 df-ixp 8874 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-7 12279 df-8 12280 df-9 12281 df-n0 12476 df-z 12563 df-dec 12683 df-uz 12834 df-fz 13507 df-struct 17174 df-slot 17209 df-ndx 17221 df-base 17237 df-plusg 17290 df-mulr 17291 df-sca 17293 df-vsca 17294 df-ip 17295 df-tset 17296 df-ple 17297 df-ds 17299 df-hom 17301 df-cco 17302 df-prds 17467 df-lmod 20917 |
| This theorem is referenced by: prdslmodd 21024 |
| Copyright terms: Public domain | W3C validator |