| 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 20575. (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 20428 | . . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 2 | ablgrp 20050 | . . . . . . 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 19226 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
| 7 | eqid 2763 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 8 | 4, 7, 5 | grplid 19228 | . . . . . 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 7466 | . . 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 20434 | . . . 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 20437 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) ∈ 𝐵) |
| 25 | 12, 22, 23, 24 | syl3anc 1399 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) ∈ 𝐵) |
| 26 | 4, 7, 5 | grprid 19229 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ ( 0 · 𝑋) ∈ 𝐵) → (( 0 · 𝑋)(+g‘𝑅) 0 ) = ( 0 · 𝑋)) |
| 27 | 26 | eqcomd 2769 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ ( 0 · 𝑋) ∈ 𝐵) → ( 0 · 𝑋) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 28 | 21, 25, 27 | syl2anc 596 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 · 𝑋) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 29 | 11, 20, 28 | 3eqtr3d 2806 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋)) = (( 0 · 𝑋)(+g‘𝑅) 0 )) |
| 30 | 4, 7 | grplcan 19261 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (( 0 · 𝑋) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ ( 0 · 𝑋) ∈ 𝐵)) → ((( 0 · 𝑋)(+g‘𝑅)( 0 · 𝑋)) = (( 0 · 𝑋)(+g‘𝑅) 0 ) ↔ ( 0 · 𝑋) = 0 )) |
| 31 | 21, 25, 22, 25, 30 | syl13anc 1400 | . 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 2147 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 .rcmulr 17473 0gc0g 17660 Grpcgrp 19194 Abelcabl 20046 Rngcrng 20425 |
| 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 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-abl 20048 df-mgp 20412 df-rng 20426 |
| This theorem is used by: rngmneg1 20440 ringlz 20575 zrrnghm 20839 cntzsubrng 20870 |
| Copyright terms: Public domain | W3C validator |