| 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 22088 (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 22047 | . . . 4 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ LMod) | |
| 2 | assaring 22048 | . . . . 5 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ Ring) | |
| 3 | assamulgscm.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | eqid 2766 | . . . . . 6 ⊢ (1r‘𝑊) = (1r‘𝑊) | |
| 5 | 3, 4 | ringidcl 20380 | . . . . 5 ⊢ (𝑊 ∈ Ring → (1r‘𝑊) ∈ 𝑉) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (𝑊 ∈ AssAlg → (1r‘𝑊) ∈ 𝑉) |
| 7 | assamulgscm.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | assamulgscm.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 9 | eqid 2766 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | 3, 7, 8, 9 | lmodvs1 21048 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ 𝑉) → ((1r‘𝐹) · (1r‘𝑊)) = (1r‘𝑊)) |
| 11 | 10 | eqcomd 2772 | . . . 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 21036 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 19 | 14, 15, 16, 18 | syl3anc 1398 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (𝐴 · 𝑋) ∈ 𝑉) |
| 20 | assamulgscm.h | . . . . 5 ⊢ 𝐻 = (mulGrp‘𝑊) | |
| 21 | 20, 3 | mgpbas 20252 | . . . 4 ⊢ 𝑉 = (Base‘𝐻) |
| 22 | 20, 4 | ringidval 20296 | . . . 4 ⊢ (1r‘𝑊) = (0g‘𝐻) |
| 23 | assamulgscm.e | . . . 4 ⊢ 𝐸 = (.g‘𝐻) | |
| 24 | 21, 22, 23 | mulg0 19171 | . . 3 ⊢ ((𝐴 · 𝑋) ∈ 𝑉 → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 25 | 19, 24 | syl 18 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 26 | assamulgscm.g | . . . . . 6 ⊢ 𝐺 = (mulGrp‘𝐹) | |
| 27 | 26, 17 | mgpbas 20252 | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) |
| 28 | 26, 9 | ringidval 20296 | . . . . 5 ⊢ (1r‘𝐹) = (0g‘𝐺) |
| 29 | assamulgscm.p | . . . . 5 ⊢ ↑ = (.g‘𝐺) | |
| 30 | 27, 28, 29 | mulg0 19171 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 31 | 15, 30 | syl 18 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 32 | 21, 22, 23 | mulg0 19171 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → (0𝐸𝑋) = (1r‘𝑊)) |
| 33 | 16, 32 | syl 18 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸𝑋) = (1r‘𝑊)) |
| 34 | 31, 33 | oveq12d 7441 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → ((0 ↑ 𝐴) · (0𝐸𝑋)) = ((1r‘𝐹) · (1r‘𝑊))) |
| 35 | 13, 25, 34 | 3eqtr4d 2811 | 1 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = ((0 ↑ 𝐴) · (0𝐸𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ‘cfv 6543 (class class class)co 7423 0cc0 11118 Basecbs 17294 Scalarcsca 17338 ·𝑠 cvsca 17339 .gcmg 19164 mulGrpcmgp 20247 1rcur 20294 Ringcrg 20346 LModclmod 21018 AssAlgcasa 22037 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-2 12321 df-n0 12523 df-z 12610 df-uz 12881 df-seq 14058 df-sets 17249 df-slot 17267 df-ndx 17279 df-base 17295 df-plusg 17348 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-mulg 19165 df-mgp 20248 df-ur 20295 df-ring 20348 df-lmod 21020 df-assa 22040 |
| This theorem is used by: assamulgscm 22088 |
| Copyright terms: Public domain | W3C validator |