| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rngrz | GIF version | ||
| Description: The zero of a non-unital ring is a right-absorbing element. (Contributed by FL, 31-Aug-2009.) Generalization of ringrz 14205. (Revised by AV, 16-Feb-2025.) |
| Ref | Expression |
|---|---|
| rngcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngcl.t | ⊢ · = (.r‘𝑅) |
| rnglz.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| rngrz | ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnggrp 14099 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 2 | rngcl.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | rnglz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 4 | 2, 3 | grpidcl 13759 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2234 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 6 | 2, 5, 3 | grplid 13761 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 0 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 7 | 1, 4, 6 | syl2anc2 412 | . . . . 5 ⊢ (𝑅 ∈ Rng → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 8 | 7 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 9 | 8 | oveq2d 6068 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = (𝑋 · 0 )) |
| 10 | simpr 110 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 11 | 2, 3 | rng0cl 14104 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 0 ∈ 𝐵) |
| 12 | 11 | adantr 276 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 0 ∈ 𝐵) |
| 13 | 10, 12, 12 | 3jca 1204 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) |
| 14 | rngcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 15 | 2, 5, 14 | rngdi 14101 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 ))) |
| 16 | 13, 15 | syldan 282 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 ))) |
| 17 | 1 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 18 | 2, 14 | rngcl 14105 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
| 19 | 12, 18 | mpd3an3 1375 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
| 20 | 2, 5, 3 | grplid 13761 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → ( 0 (+g‘𝑅)(𝑋 · 0 )) = (𝑋 · 0 )) |
| 21 | 20 | eqcomd 2240 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 22 | 17, 19, 21 | syl2anc 411 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 23 | 9, 16, 22 | 3eqtr3d 2275 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 24 | 2, 5 | grprcan 13767 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ ((𝑋 · 0 ) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ (𝑋 · 0 ) ∈ 𝐵)) → (((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 )) ↔ (𝑋 · 0 ) = 0 )) |
| 25 | 17, 19, 12, 19, 24 | syl13anc 1276 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 )) ↔ (𝑋 · 0 ) = 0 )) |
| 26 | 23, 25 | mpbid 147 | 1 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ‘cfv 5354 (class class class)co 6052 Basecbs 13229 +gcplusg 13307 .rcmulr 13308 0gc0g 13486 Grpcgrp 13730 Rngcrng 14093 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-addcom 8229 ax-addass 8231 ax-i2m1 8234 ax-0lt1 8235 ax-0id 8237 ax-rnegex 8238 ax-pre-ltirr 8241 ax-pre-ltadd 8245 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-iota 5314 df-fun 5356 df-fn 5357 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8312 df-mnf 8313 df-ltxr 8315 df-inn 9240 df-2 9298 df-3 9299 df-ndx 13232 df-slot 13233 df-base 13235 df-sets 13236 df-plusg 13320 df-mulr 13321 df-0g 13488 df-mgm 13586 df-sgrp 13632 df-mnd 13647 df-grp 13733 df-abl 14021 df-mgp 14082 df-rng 14094 |
| This theorem is referenced by: rngmneg2 14109 |
| Copyright terms: Public domain | W3C validator |