| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > assamulgscmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for assamulgscm 22242 (induction base). (Contributed by AV, 26-Aug-2019.) |
| Ref | Expression |
|---|---|
| assamulgscm.v | ⊢ 𝑉 = (Base‘𝑊) |
| assamulgscm.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| assamulgscm.b | ⊢ 𝐵 = (Base‘𝐹) |
| assamulgscm.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| assamulgscm.g | ⊢ 𝐺 = (mulGrp‘𝐹) |
| assamulgscm.p | ⊢ ↑ = (.g‘𝐺) |
| assamulgscm.h | ⊢ 𝐻 = (mulGrp‘𝑊) |
| assamulgscm.e | ⊢ 𝐸 = (.g‘𝐻) |
| Ref | Expression |
|---|---|
| assamulgscmlem1 | ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = ((0 ↑ 𝐴) · (0𝐸𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | assalmod 22201 | . . . 4 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ LMod) | |
| 2 | assaring 22202 | . . . . 5 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ Ring) | |
| 3 | assamulgscm.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | eqid 2763 | . . . . . 6 ⊢ (1r‘𝑊) = (1r‘𝑊) | |
| 5 | 3, 4 | ringidcl 20527 | . . . . 5 ⊢ (𝑊 ∈ Ring → (1r‘𝑊) ∈ 𝑉) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (𝑊 ∈ AssAlg → (1r‘𝑊) ∈ 𝑉) |
| 7 | assamulgscm.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | assamulgscm.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 9 | eqid 2763 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | 3, 7, 8, 9 | lmodvs1 21198 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ 𝑉) → ((1r‘𝐹) · (1r‘𝑊)) = (1r‘𝑊)) |
| 11 | 10 | eqcomd 2769 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ 𝑉) → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 12 | 1, 6, 11 | syl2anc 596 | . . 3 ⊢ (𝑊 ∈ AssAlg → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 13 | 12 | adantl 487 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 14 | 1 | adantl 487 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝑊 ∈ LMod) |
| 15 | simpll 779 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝐴 ∈ 𝐵) | |
| 16 | simplr 781 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝑋 ∈ 𝑉) | |
| 17 | assamulgscm.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 18 | 3, 7, 8, 17 | lmodvscl 21186 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 19 | 14, 15, 16, 18 | syl3anc 1399 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (𝐴 · 𝑋) ∈ 𝑉) |
| 20 | assamulgscm.h | . . . . 5 ⊢ 𝐻 = (mulGrp‘𝑊) | |
| 21 | 20, 3 | mgpbas 20398 | . . . 4 ⊢ 𝑉 = (Base‘𝐻) |
| 22 | 20, 4 | ringidval 20442 | . . . 4 ⊢ (1r‘𝑊) = (0g‘𝐻) |
| 23 | assamulgscm.e | . . . 4 ⊢ 𝐸 = (.g‘𝐻) | |
| 24 | 21, 22, 23 | mulg0 19316 | . . 3 ⊢ ((𝐴 · 𝑋) ∈ 𝑉 → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 25 | 19, 24 | syl 18 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 26 | assamulgscm.g | . . . . . 6 ⊢ 𝐺 = (mulGrp‘𝐹) | |
| 27 | 26, 17 | mgpbas 20398 | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) |
| 28 | 26, 9 | ringidval 20442 | . . . . 5 ⊢ (1r‘𝐹) = (0g‘𝐺) |
| 29 | assamulgscm.p | . . . . 5 ⊢ ↑ = (.g‘𝐺) | |
| 30 | 27, 28, 29 | mulg0 19316 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 31 | 15, 30 | syl 18 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 32 | 21, 22, 23 | mulg0 19316 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → (0𝐸𝑋) = (1r‘𝑊)) |
| 33 | 16, 32 | syl 18 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸𝑋) = (1r‘𝑊)) |
| 34 | 31, 33 | oveq12d 7464 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → ((0 ↑ 𝐴) · (0𝐸𝑋)) = ((1r‘𝐹) · (1r‘𝑊))) |
| 35 | 13, 25, 34 | 3eqtr4d 2808 | 1 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = ((0 ↑ 𝐴) · (0𝐸𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ‘cfv 6561 (class class class)co 7446 0cc0 11230 Basecbs 17419 Scalarcsca 17463 ·𝑠 cvsca 17464 .gcmg 19309 mulGrpcmgp 20393 1rcur 20440 Ringcrg 20492 LModclmod 21168 AssAlgcasa 22191 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-nn 12366 df-2 12435 df-n0 12637 df-z 12724 df-uz 12996 df-seq 14175 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-plusg 17473 df-0g 17644 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-mulg 19310 df-mgp 20394 df-ur 20441 df-ring 20494 df-lmod 21170 df-assa 22194 |
| This theorem is used by: assamulgscm 22242 |
| Copyright terms: Public domain | W3C validator |