| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ascl0 | GIF version | ||
| Description: The scalar 0 embedded into a left module corresponds to the 0 of the left module if the left module is also a ring. (Contributed by AV, 31-Jul-2019.) |
| Ref | Expression |
|---|---|
| ascl0.a | ⊢ 𝐴 = (algSc‘𝑊) |
| ascl0.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| ascl0.l | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| ascl0.r | ⊢ (𝜑 → 𝑊 ∈ Ring) |
| Ref | Expression |
|---|---|
| ascl0 | ⊢ (𝜑 → (𝐴‘(0g‘𝐹)) = (0g‘𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ascl0.a | . . 3 ⊢ 𝐴 = (algSc‘𝑊) | |
| 2 | ascl0.f | . . 3 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 3 | eqid 2238 | . . 3 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
| 4 | eqid 2238 | . . 3 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊) | |
| 5 | eqid 2238 | . . 3 ⊢ (1r‘𝑊) = (1r‘𝑊) | |
| 6 | ascl0.l | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 7 | 2 | lmodfgrp 14741 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Grp) |
| 8 | eqid 2238 | . . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
| 9 | 3, 8 | grpidcl 13893 | . . . 4 ⊢ (𝐹 ∈ Grp → (0g‘𝐹) ∈ (Base‘𝐹)) |
| 10 | 6, 7, 9 | 3syl 17 | . . 3 ⊢ (𝜑 → (0g‘𝐹) ∈ (Base‘𝐹)) |
| 11 | ascl0.r | . . 3 ⊢ (𝜑 → 𝑊 ∈ Ring) | |
| 12 | 1, 2, 3, 4, 5, 10, 6, 11 | asclvald 15131 | . 2 ⊢ (𝜑 → (𝐴‘(0g‘𝐹)) = ((0g‘𝐹)( ·𝑠 ‘𝑊)(1r‘𝑊))) |
| 13 | eqid 2238 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 14 | 13, 5 | ringidcl 14432 | . . . 4 ⊢ (𝑊 ∈ Ring → (1r‘𝑊) ∈ (Base‘𝑊)) |
| 15 | 11, 14 | syl 14 | . . 3 ⊢ (𝜑 → (1r‘𝑊) ∈ (Base‘𝑊)) |
| 16 | eqid 2238 | . . . 4 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 17 | 13, 2, 4, 8, 16 | lmod0vs 14767 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (1r‘𝑊) ∈ (Base‘𝑊)) → ((0g‘𝐹)( ·𝑠 ‘𝑊)(1r‘𝑊)) = (0g‘𝑊)) |
| 18 | 6, 15, 17 | syl2anc 415 | . 2 ⊢ (𝜑 → ((0g‘𝐹)( ·𝑠 ‘𝑊)(1r‘𝑊)) = (0g‘𝑊)) |
| 19 | 12, 18 | eqtrd 2271 | 1 ⊢ (𝜑 → (𝐴‘(0g‘𝐹)) = (0g‘𝑊)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 Basecbs 13410 Scalarcsca 13493 ·𝑠 cvsca 13494 0gc0g 13669 Grpcgrp 13864 1rcur 14369 Ringcrg 14407 LModclmod 14732 algSccascl 15107 |
| 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 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-pre-ltirr 8297 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 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-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-ltxr 8371 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-ndx 13413 df-slot 13414 df-base 13416 df-sets 13417 df-plusg 13503 df-mulr 13504 df-sca 13506 df-vsca 13507 df-0g 13671 df-mgm 13735 df-sgrp 13776 df-mnd 13789 df-grp 13867 df-mgp 14325 df-ur 14370 df-ring 14409 df-lmod 14734 df-ascl 15110 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |