| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnglz | Structured version Visualization version GIF version | ||
| Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringlz 20422. (Revised by AV, 17-Apr-2020.) |
| Ref | Expression |
|---|---|
| rngcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngcl.t | ⊢ · = (.r‘𝑅) |
| rnglz.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| rnglz | ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rngabl 20277 | . . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 2 | ablgrp 19899 | . . . . . . 7 ⊢ (𝑅 ∈ Abel → 𝑅 ∈ Grp) | |
| 3 | 1, 2 | syl 18 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) |
| 4 | rngcl.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | rnglz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 6 | 4, 5 | grpidcl 19076 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
| 7 | eqid 2765 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4, 7, 5 | grplid 19078 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 0 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 9 | 3, 6, 8 | syl2anc2 597 | . . . . 5 ⊢ (𝑅 ∈ Rng → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 11 | 10 | oveq1d 7434 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (( 0 (+g‘𝑅) 0 ) · 𝑋) = ( 0 · 𝑋)) |
| 12 | simpl 488 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ Rng) | |
| 13 | 3, 6 | syl 18 | . . . . . . 7 ⊢ (𝑅 ∈ Rng → 0 ∈ 𝐵) |
| 14 | 13, 13 | jca 521 | . . . . . 6 ⊢ (𝑅 ∈ Rng → ( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) |
| 15 | 14 | anim1i 627 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵) ∧ 𝑋 ∈ 𝐵)) |
| 16 | df-3an 1105 | . . . . 5 ⊢ (( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ↔ (( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵) ∧ 𝑋 ∈ 𝐵)) | |
| 17 | 15, 16 | sylibr 237 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) |
| 18 | rngcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 19 | 4, 7, 18 | rngdir 20283 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ ( 0 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (( 0 (+g‘𝑅) 0 ) · 𝑋) = (( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋))) |
| 20 | 12, 17, 19 | syl2anc 596 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (( 0 (+g‘𝑅) 0 ) · 𝑋) = (( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋))) |
| 21 | 3 | adantr 486 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 22 | 13 | adantr 486 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 0 ∈ 𝐵) |
| 23 | simpr 490 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 24 | 4, 18 | rngcl 20286 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) ∈ 𝐵) |
| 25 | 12, 22, 23, 24 | syl3anc 1398 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) ∈ 𝐵) |
| 26 | 4, 7, 5 | grprid 19079 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ ( 0 · 𝑋) ∈ 𝐵) → (( 0 · 𝑋)(+g‘𝑅) 0 ) = ( 0 · 𝑋)) |
| 27 | 26 | eqcomd 2771 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ ( 0 · 𝑋) ∈ 𝐵) → ( 0 · 𝑋) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 28 | 21, 25, 27 | syl2anc 596 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 29 | 11, 20, 28 | 3eqtr3d 2808 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋)) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 30 | 4, 7 | grplcan 19111 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (( 0 · 𝑋) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ ( 0 · 𝑋) ∈ 𝐵)) → ((( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋)) = (( 0 · 𝑋)(+g‘𝑅) 0 ) ↔ ( 0 · 𝑋) = 0 )) |
| 31 | 21, 25, 22, 25, 30 | syl13anc 1399 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ((( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋)) = (( 0 · 𝑋)(+g‘𝑅) 0 ) ↔ ( 0 · 𝑋) = 0 )) |
| 32 | 29, 31 | mpbid 235 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ‘cfv 6540 (class class class)co 7419 Basecbs 17291 +gcplusg 17332 .rcmulr 17333 0gc0g 17514 Grpcgrp 19044 Abelcabl 19895 Rngcrng 20274 |
| 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 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-plusg 17345 df-0g 17516 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-grp 19047 df-minusg 19048 df-abl 19897 df-mgp 20261 df-rng 20275 |
| This theorem is used by: rngmneg1 20289 ringlz 20422 zrrnghm 20685 cntzsubrng 20716 |
| Copyright terms: Public domain | W3C validator |