| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > assamulgscmlem1 | GIF version | ||
| Description: Lemma 1 for assamulgscm 15043 (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 15006 | . . . 4 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ LMod) | |
| 2 | assaring 15007 | . . . . 5 ⊢ (𝑊 ∈ AssAlg → 𝑊 ∈ Ring) | |
| 3 | assamulgscm.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | eqid 2238 | . . . . . 6 ⊢ (1r‘𝑊) = (1r‘𝑊) | |
| 5 | 3, 4 | ringidcl 14325 | . . . . 5 ⊢ (𝑊 ∈ Ring → (1r‘𝑊) ∈ 𝑉) |
| 6 | 2, 5 | syl 14 | . . . 4 ⊢ (𝑊 ∈ AssAlg → (1r‘𝑊) ∈ 𝑉) |
| 7 | assamulgscm.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | assamulgscm.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 9 | eqid 2238 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 10 | 3, 7, 8, 9 | lmodvs1 14653 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ 𝑉) → ((1r‘𝐹) · (1r‘𝑊)) = (1r‘𝑊)) |
| 11 | 10 | eqcomd 2244 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ 𝑉) → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 12 | 1, 6, 11 | syl2anc 415 | . . 3 ⊢ (𝑊 ∈ AssAlg → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 13 | 12 | adantl 277 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (1r‘𝑊) = ((1r‘𝐹) · (1r‘𝑊))) |
| 14 | 1 | adantl 277 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝑊 ∈ LMod) |
| 15 | simpll 531 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝐴 ∈ 𝐵) | |
| 16 | simplr 533 | . . . 4 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → 𝑋 ∈ 𝑉) | |
| 17 | assamulgscm.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 18 | 3, 7, 8, 17 | lmodvscl 14641 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 19 | 14, 15, 16, 18 | syl3anc 1278 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (𝐴 · 𝑋) ∈ 𝑉) |
| 20 | assamulgscm.h | . . . . 5 ⊢ 𝐻 = (mulGrp‘𝑊) | |
| 21 | 20, 3 | mgpbas 14225 | . . . 4 ⊢ 𝑉 = (Base‘𝐻) |
| 22 | 20, 4 | ringidval 14265 | . . . 4 ⊢ (1r‘𝑊) = (0g‘𝐻) |
| 23 | assamulgscm.e | . . . 4 ⊢ 𝐸 = (.g‘𝐻) | |
| 24 | 21, 22, 23 | mulg0 13928 | . . 3 ⊢ ((𝐴 · 𝑋) ∈ 𝑉 → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 25 | 19, 24 | syl 14 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = (1r‘𝑊)) |
| 26 | assamulgscm.g | . . . . . 6 ⊢ 𝐺 = (mulGrp‘𝐹) | |
| 27 | 26, 17 | mgpbas 14225 | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) |
| 28 | 26, 9 | ringidval 14265 | . . . . 5 ⊢ (1r‘𝐹) = (0g‘𝐺) |
| 29 | assamulgscm.p | . . . . 5 ⊢ ↑ = (.g‘𝐺) | |
| 30 | 27, 28, 29 | mulg0 13928 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 31 | 15, 30 | syl 14 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0 ↑ 𝐴) = (1r‘𝐹)) |
| 32 | 21, 22, 23 | mulg0 13928 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → (0𝐸𝑋) = (1r‘𝑊)) |
| 33 | 16, 32 | syl 14 | . . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸𝑋) = (1r‘𝑊)) |
| 34 | 31, 33 | oveq12d 6103 | . 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → ((0 ↑ 𝐴) · (0𝐸𝑋)) = ((1r‘𝐹) · (1r‘𝑊))) |
| 35 | 13, 25, 34 | 3eqtr4d 2281 | 1 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑊 ∈ AssAlg) → (0𝐸(𝐴 · 𝑋)) = ((0 ↑ 𝐴) · (0𝐸𝑋))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 0cc0 8179 Basecbs 13352 Scalarcsca 13434 ·𝑠 cvsca 13435 .gcmg 13922 mulGrpcmgp 14217 1rcur 14262 Ringcrg 14300 LModclmod 14623 AssAlgcasa 14996 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-n0 9564 df-z 9645 df-uz 9922 df-seqfrec 10885 df-ndx 13355 df-slot 13356 df-base 13358 df-sets 13359 df-plusg 13444 df-mulr 13445 df-sca 13447 df-vsca 13448 df-0g 13612 df-mgm 13676 df-sgrp 13717 df-mnd 13730 df-minusg 13809 df-mulg 13923 df-mgp 14218 df-ur 14263 df-ring 14302 df-lmod 14625 df-assa 14999 |
| This theorem is used by: assamulgscm 15043 |
| Copyright terms: Public domain | W3C validator |