| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ringrz | GIF version | ||
| Description: The zero of a unital ring is a right-absorbing element. (Contributed by FL, 31-Aug-2009.) |
| Ref | Expression |
|---|---|
| rngz.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngz.t | ⊢ · = (.r‘𝑅) |
| rngz.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| ringrz | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ringgrp 13878 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 2 | rngz.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | rngz.z | . . . . . . 7 ⊢ 0 = (0g‘𝑅) | |
| 4 | 2, 3 | grpidcl 13476 | . . . . . 6 ⊢ (𝑅 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2207 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 6 | 2, 5, 3 | grplid 13478 | . . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ 0 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 7 | 1, 4, 6 | syl2anc2 412 | . . . . 5 ⊢ (𝑅 ∈ Ring → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 8 | 7 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝑅) 0 ) = 0 ) |
| 9 | 8 | oveq2d 5983 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = (𝑋 · 0 )) |
| 10 | simpr 110 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 11 | 1, 4 | syl 14 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 0 ∈ 𝐵) |
| 12 | 11 | adantr 276 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → 0 ∈ 𝐵) |
| 13 | 10, 12, 12 | 3jca 1180 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) |
| 14 | rngz.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 15 | 2, 5, 14 | ringdi 13895 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 0 ∈ 𝐵)) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 ))) |
| 16 | 13, 15 | syldan 282 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · ( 0 (+g‘𝑅) 0 )) = ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 ))) |
| 17 | 1 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 18 | 2, 14 | ringcl 13890 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
| 19 | 12, 18 | mpd3an3 1351 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) ∈ 𝐵) |
| 20 | 2, 5, 3 | grplid 13478 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → ( 0 (+g‘𝑅)(𝑋 · 0 )) = (𝑋 · 0 )) |
| 21 | 20 | eqcomd 2213 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 0 ) ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 22 | 17, 19, 21 | syl2anc 411 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 23 | 9, 16, 22 | 3eqtr3d 2248 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 ))) |
| 24 | 2, 5 | grprcan 13484 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ ((𝑋 · 0 ) ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ (𝑋 · 0 ) ∈ 𝐵)) → (((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 )) ↔ (𝑋 · 0 ) = 0 )) |
| 25 | 17, 19, 12, 19, 24 | syl13anc 1252 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (((𝑋 · 0 )(+g‘𝑅)(𝑋 · 0 )) = ( 0 (+g‘𝑅)(𝑋 · 0 )) ↔ (𝑋 · 0 ) = 0 )) |
| 26 | 23, 25 | mpbid 147 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 981 = wceq 1373 ∈ wcel 2178 ‘cfv 5290 (class class class)co 5967 Basecbs 12947 +gcplusg 13024 .rcmulr 13025 0gc0g 13203 Grpcgrp 13447 Ringcrg 13873 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-addcom 8060 ax-addass 8062 ax-i2m1 8065 ax-0lt1 8066 ax-0id 8068 ax-rnegex 8069 ax-pre-ltirr 8072 ax-pre-ltadd 8076 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-iota 5251 df-fun 5292 df-fn 5293 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-pnf 8144 df-mnf 8145 df-ltxr 8147 df-inn 9072 df-2 9130 df-3 9131 df-ndx 12950 df-slot 12951 df-base 12953 df-sets 12954 df-plusg 13037 df-mulr 13038 df-0g 13205 df-mgm 13303 df-sgrp 13349 df-mnd 13364 df-grp 13450 df-mgp 13798 df-ring 13875 |
| This theorem is referenced by: ringrzd 13923 ringsrg 13924 ringinvnz1ne0 13926 ringinvnzdiv 13927 ringnegr 13929 dvdsr02 13982 rrgeq0 14142 unitrrg 14144 domneq0 14149 lmodvs0 14199 |
| Copyright terms: Public domain | W3C validator |