| 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 6669 | . . 3 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 9 | prdsvscacl.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐾) | |
| 10 | prdsvscacl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 11 | 1, 2, 3, 4, 5, 6, 8, 9, 10 | prdsvscaval 17442 | . 2 ⊢ (𝜑 → (𝐹 · 𝐺) = (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)))) |
| 12 | 7 | ffvelcdmda 7036 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ LMod) |
| 13 | 9 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝐾) |
| 14 | prdsvscacl.sr | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Scalar‘(𝑅‘𝑥)) = 𝑆) | |
| 15 | 14 | fveq2d 6844 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘𝑆)) |
| 16 | 15, 4 | eqtr4di 2789 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = 𝐾) |
| 17 | 13, 16 | eleqtrrd 2839 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥)))) |
| 18 | 5 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ Ring) |
| 19 | 6 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑊) |
| 20 | 8 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 Fn 𝐼) |
| 21 | 10 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ 𝐵) |
| 22 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 23 | 1, 2, 18, 19, 20, 21, 22 | prdsbasprj 17435 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) |
| 24 | eqid 2736 | . . . . . 6 ⊢ (Base‘(𝑅‘𝑥)) = (Base‘(𝑅‘𝑥)) | |
| 25 | eqid 2736 | . . . . . 6 ⊢ (Scalar‘(𝑅‘𝑥)) = (Scalar‘(𝑅‘𝑥)) | |
| 26 | eqid 2736 | . . . . . 6 ⊢ ( ·𝑠 ‘(𝑅‘𝑥)) = ( ·𝑠 ‘(𝑅‘𝑥)) | |
| 27 | eqid 2736 | . . . . . 6 ⊢ (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘(Scalar‘(𝑅‘𝑥))) | |
| 28 | 24, 25, 26, 27 | lmodvscl 20873 | . . . . 5 ⊢ (((𝑅‘𝑥) ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥))) ∧ (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 29 | 12, 17, 23, 28 | syl3anc 1374 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 30 | 29 | ralrimiva 3129 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 31 | 1, 2, 5, 6, 8 | prdsbasmpt 17433 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥)))) |
| 32 | 30, 31 | mpbird 257 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵) |
| 33 | 11, 32 | eqeltrd 2836 | 1 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ↦ cmpt 5166 Fn wfn 6493 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 Scalarcsca 17223 ·𝑠 cvsca 17224 Xscprds 17408 Ringcrg 20214 LModclmod 20855 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-prds 17410 df-lmod 20857 |
| This theorem is referenced by: prdslmodd 20964 |
| Copyright terms: Public domain | W3C validator |