Table of ContentsTable of Contents Mathbox for Norm Megill < Previous   Next >
Related theorems
Unicode version

Theorem ringrzNEW 17157
Description: The zero of a unital ring is a right absorbing element. (Contributed by FL, 31-Aug-2009.)
Hypotheses
Ref Expression
ringz.1NEW |- B = (base` R)
ringz.3NEW |- T = (.r` R)
ringz.4NEW |- Z = (0g` R)
Assertion
Ref Expression
ringrzNEW |- ((R e. RingNEW /\ X e. B) -> (XTZ) = Z)

Proof of Theorem ringrzNEW
StepHypRef Expression
1 ringgrpNEW 17152 . . . . . 6 |- (R e. RingNEW -> R e. GrpNEW)
2 ringz.1NEW . . . . . . . 8 |- B = (base` R)
3 ringz.4NEW . . . . . . . 8 |- Z = (0g` R)
42, 3grpidclNEW 17118 . . . . . . 7 |- (R e. GrpNEW -> Z e. B)
5 eqid 1884 . . . . . . . 8 |- (+g` R) = (+g` R)
62, 5, 3grplidNEW 17120 . . . . . . 7 |- ((R e. GrpNEW /\ Z e. B) -> (Z(+g` R)Z) = Z)
74, 6mpdan 768 . . . . . 6 |- (R e. GrpNEW -> (Z(+g` R)Z) = Z)
81, 7syl 12 . . . . 5 |- (R e. RingNEW -> (Z(+g` R)Z) = Z)
98adantr 425 . . . 4 |- ((R e. RingNEW /\ X e. B) -> (Z(+g` R)Z) = Z)
109opreq2d 4898 . . 3 |- ((R e. RingNEW /\ X e. B) -> (XT(Z(+g` R)Z)) = (XTZ))
11 simpr 350 . . . . 5 |- ((R e. RingNEW /\ X e. B) -> X e. B)
121, 4syl 12 . . . . . 6 |- (R e. RingNEW -> Z e. B)
1312adantr 425 . . . . 5 |- ((R e. RingNEW /\ X e. B) -> Z e. B)
1411, 13, 133jca 1050 . . . 4 |- ((R e. RingNEW /\ X e. B) -> (X e. B /\ Z e. B /\ Z e. B))
15 ringz.3NEW . . . . 5 |- T = (.r` R)
162, 5, 15ringdiNEW 17147 . . . 4 |- ((R e. RingNEW /\ (X e. B /\ Z e. B /\ Z e. B)) -> (XT(Z(+g` R)Z)) = ((XTZ)(+g` R)(XTZ)))
1714, 16syldan 516 . . 3 |- ((R e. RingNEW /\ X e. B) -> (XT(Z(+g` R)Z)) = ((XTZ)(+g` R)(XTZ)))
181adantr 425 . . . 4 |- ((R e. RingNEW /\ X e. B) -> R e. GrpNEW)
192, 15ringclNEW 17144 . . . . 5 |- ((R e. RingNEW /\ X e. B /\ Z e. B) -> (XTZ) e. B)
2013, 19mpd3an3 1192 . . . 4 |- ((R e. RingNEW /\ X e. B) -> (XTZ) e. B)
212, 5, 3grplidNEW 17120 . . . . 5 |- ((R e. GrpNEW /\ (XTZ) e. B) -> (Z(+g` R)(XTZ)) = (XTZ))
2221eqcomd 1889 . . . 4 |- ((R e. GrpNEW /\ (XTZ) e. B) -> (XTZ) = (Z(+g` R)(XTZ)))
2318, 20, 22syl11anc 524 . . 3 |- ((R e. RingNEW /\ X e. B) -> (XTZ) = (Z(+g` R)(XTZ)))
2410, 17, 233eqtr3d 1934 . 2 |- ((R e. RingNEW /\ X e. B) -> ((XTZ)(+g` R)(XTZ)) = (Z(+g` R)(XTZ)))
252, 5grprcanNEW 17122 . . 3 |- ((R e. GrpNEW /\ ((XTZ) e. B /\ Z e. B /\ (XTZ) e. B)) -> (((XTZ)(+g` R)(XTZ)) = (Z(+g` R)(XTZ)) <-> (XTZ) = Z))
2618, 20, 13, 20, 25syl13anc 1102 . 2 |- ((R e. RingNEW /\ X e. B) -> (((XTZ)(+g` R)(XTZ)) = (Z(+g` R)(XTZ)) <-> (XTZ) = Z))
2724, 26mpbid 212 1 |- ((R e. RingNEW /\ X e. B) -> (XTZ) = Z)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240   /\ w3a 858   = wceq 1298   e. wcel 1300  ` cfv 3998  (class class class)co 4884  basecbs 16758  +gcplusg 17080  GrpNEWcgrp 17081  0gc0g 17082  .rcmulr 17085  RingNEWcrg 17086
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-rep 3428  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-tru 1262  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-reu 2111  df-rab 2112  df-v 2294  df-sbc 2454  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fn 4009  df-fv 4014  df-opr 4886  df-mpt 5006  df-iota 5089  df-struct 16708  df-grpNEW 17089  df-0g 17090  df-ablNEW 17092  df-ringNEW 17094
Copyright terms: Public domain