| 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 6656 | . . 3 ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| 9 | prdsvscacl.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐾) | |
| 10 | prdsvscacl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 11 | 1, 2, 3, 4, 5, 6, 8, 9, 10 | prdsvscaval 17433 | . 2 ⊢ (𝜑 → (𝐹 · 𝐺) = (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)))) |
| 12 | 7 | ffvelcdmda 7025 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ LMod) |
| 13 | 9 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝐾) |
| 14 | prdsvscacl.sr | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Scalar‘(𝑅‘𝑥)) = 𝑆) | |
| 15 | 14 | fveq2d 6831 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘𝑆)) |
| 16 | 15, 4 | eqtr4di 2792 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (Base‘(Scalar‘(𝑅‘𝑥))) = 𝐾) |
| 17 | 13, 16 | eleqtrrd 2842 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥)))) |
| 18 | 5 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ Ring) |
| 19 | 6 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ 𝑊) |
| 20 | 8 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 Fn 𝐼) |
| 21 | 10 | adantr 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ 𝐵) |
| 22 | simpr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼) | |
| 23 | 1, 2, 18, 19, 20, 21, 22 | prdsbasprj 17426 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) |
| 24 | eqid 2739 | . . . . . 6 ⊢ (Base‘(𝑅‘𝑥)) = (Base‘(𝑅‘𝑥)) | |
| 25 | eqid 2739 | . . . . . 6 ⊢ (Scalar‘(𝑅‘𝑥)) = (Scalar‘(𝑅‘𝑥)) | |
| 26 | eqid 2739 | . . . . . 6 ⊢ ( ·𝑠 ‘(𝑅‘𝑥)) = ( ·𝑠 ‘(𝑅‘𝑥)) | |
| 27 | eqid 2739 | . . . . . 6 ⊢ (Base‘(Scalar‘(𝑅‘𝑥))) = (Base‘(Scalar‘(𝑅‘𝑥))) | |
| 28 | 24, 25, 26, 27 | lmodvscl 20868 | . . . . 5 ⊢ (((𝑅‘𝑥) ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘(𝑅‘𝑥))) ∧ (𝐺‘𝑥) ∈ (Base‘(𝑅‘𝑥))) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 29 | 12, 17, 23, 28 | syl3anc 1379 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 30 | 29 | ralrimiva 3131 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥))) |
| 31 | 1, 2, 5, 6, 8 | prdsbasmpt 17424 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐼 (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥)) ∈ (Base‘(𝑅‘𝑥)))) |
| 32 | 30, 31 | mpbird 258 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ (𝐹( ·𝑠 ‘(𝑅‘𝑥))(𝐺‘𝑥))) ∈ 𝐵) |
| 33 | 11, 32 | eqeltrd 2839 | 1 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ↦ cmpt 5153 Fn wfn 6480 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 Scalarcsca 17214 ·𝑠 cvsca 17215 Xscprds 17399 Ringcrg 20205 LModclmod 20850 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-fz 13453 df-struct 17108 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-mulr 17225 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-hom 17235 df-cco 17236 df-prds 17401 df-lmod 20852 |
| This theorem is referenced by: prdslmodd 20959 |
| Copyright terms: Public domain | W3C validator |