![]() |
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 13391. (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 13285 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
2 | rngcl.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
3 | rnglz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
4 | 2, 3 | grpidcl 12966 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
5 | eqid 2189 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
6 | 2, 5, 3 | grplid 12968 | . . . . . 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 5908 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = (𝑋 · 0 )) |
10 | simpr 110 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
11 | 2, 3 | rng0cl 13290 | . . . . . 6 ⊢ (𝑅 ∈ Rng → 0 ∈ 𝐵) |
12 | 11 | adantr 276 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → 0 ∈ 𝐵) |
13 | 10, 12, 12 | 3jca 1179 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) |
14 | rngcl.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
15 | 2, 5, 14 | rngdi 13287 | . . . 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 13291 | . . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
19 | 12, 18 | mpd3an3 1349 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
20 | 2, 5, 3 | grplid 12968 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → ( 0 (+g‘𝑅)(𝑋 · 0 )) = (𝑋 · 0 )) |
21 | 20 | eqcomd 2195 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
22 | 17, 19, 21 | syl2anc 411 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
23 | 9, 16, 22 | 3eqtr3d 2230 | . 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵) → ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
24 | 2, 5 | grprcan 12974 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ ((𝑋 · 0 ) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ (𝑋 · 0 ) ∈ 𝐵)) → (((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 )) ↔ (𝑋 · 0 ) = 0 )) |
25 | 17, 19, 12, 19, 24 | syl13anc 1251 | . 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 980 = wceq 1364 ∈ wcel 2160 ‘cfv 5232 (class class class)co 5892 Basecbs 12507 +gcplusg 12582 .rcmulr 12583 0gc0g 12754 Grpcgrp 12938 Rngcrng 13279 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-cnex 7927 ax-resscn 7928 ax-1cn 7929 ax-1re 7930 ax-icn 7931 ax-addcl 7932 ax-addrcl 7933 ax-mulcl 7934 ax-addcom 7936 ax-addass 7938 ax-i2m1 7941 ax-0lt1 7942 ax-0id 7944 ax-rnegex 7945 ax-pre-ltirr 7948 ax-pre-ltadd 7952 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-iota 5193 df-fun 5234 df-fn 5235 df-fv 5240 df-riota 5848 df-ov 5895 df-oprab 5896 df-mpo 5897 df-pnf 8019 df-mnf 8020 df-ltxr 8022 df-inn 8945 df-2 9003 df-3 9004 df-ndx 12510 df-slot 12511 df-base 12513 df-sets 12514 df-plusg 12595 df-mulr 12596 df-0g 12756 df-mgm 12825 df-sgrp 12858 df-mnd 12871 df-grp 12941 df-abl 13219 df-mgp 13268 df-rng 13280 |
This theorem is referenced by: rngmneg2 13295 |
Copyright terms: Public domain | W3C validator |