Mathbox for Jeff Madsen < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rngolz Structured version   Visualization version   GIF version

Theorem rngolz 33692
 Description: The zero of a unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) (New usage is discouraged.)
Hypotheses
Ref Expression
ringlz.1 𝑍 = (GId‘𝐺)
ringlz.2 𝑋 = ran 𝐺
ringlz.3 𝐺 = (1st𝑅)
ringlz.4 𝐻 = (2nd𝑅)
Assertion
Ref Expression
rngolz ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝐻𝐴) = 𝑍)

Proof of Theorem rngolz
StepHypRef Expression
1 ringlz.3 . . . . . . 7 𝐺 = (1st𝑅)
21rngogrpo 33680 . . . . . 6 (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3 ringlz.2 . . . . . . . 8 𝑋 = ran 𝐺
4 ringlz.1 . . . . . . . 8 𝑍 = (GId‘𝐺)
53, 4grpoidcl 27338 . . . . . . 7 (𝐺 ∈ GrpOp → 𝑍𝑋)
63, 4grpolid 27340 . . . . . . 7 ((𝐺 ∈ GrpOp ∧ 𝑍𝑋) → (𝑍𝐺𝑍) = 𝑍)
75, 6mpdan 701 . . . . . 6 (𝐺 ∈ GrpOp → (𝑍𝐺𝑍) = 𝑍)
82, 7syl 17 . . . . 5 (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
98adantr 481 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝐺𝑍) = 𝑍)
109oveq1d 6650 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = (𝑍𝐻𝐴))
111, 3, 4rngo0cl 33689 . . . . . 6 (𝑅 ∈ RingOps → 𝑍𝑋)
1211adantr 481 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → 𝑍𝑋)
13 simpr 477 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → 𝐴𝑋)
1412, 12, 133jca 1240 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝑋𝑍𝑋𝐴𝑋))
15 ringlz.4 . . . . 5 𝐻 = (2nd𝑅)
161, 15, 3rngodir 33675 . . . 4 ((𝑅 ∈ RingOps ∧ (𝑍𝑋𝑍𝑋𝐴𝑋)) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
1714, 16syldan 487 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
182adantr 481 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → 𝐺 ∈ GrpOp)
19 simpl 473 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → 𝑅 ∈ RingOps)
201, 15, 3rngocl 33671 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝑍𝑋𝐴𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
2119, 12, 13, 20syl3anc 1324 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
223, 4grporid 27341 . . . . 5 ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺𝑍) = (𝑍𝐻𝐴))
2322eqcomd 2626 . . . 4 ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
2418, 21, 23syl2anc 692 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
2510, 17, 243eqtr3d 2662 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍))
263grpolcan 27354 . . 3 ((𝐺 ∈ GrpOp ∧ ((𝑍𝐻𝐴) ∈ 𝑋𝑍𝑋 ∧ (𝑍𝐻𝐴) ∈ 𝑋)) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
2718, 21, 12, 21, 26syl13anc 1326 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
2825, 27mpbid 222 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑍𝐻𝐴) = 𝑍)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1481   ∈ wcel 1988  ran crn 5105  ‘cfv 5876  (class class class)co 6635  1st c1st 7151  2nd c2nd 7152  GrpOpcgr 27313  GIdcgi 27314  RingOpscrngo 33664 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-rep 4762  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-reu 2916  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-riota 6596  df-ov 6638  df-1st 7153  df-2nd 7154  df-grpo 27317  df-gid 27318  df-ginv 27319  df-ablo 27369  df-rngo 33665 This theorem is referenced by:  rngonegmn1l  33711  isdrngo3  33729  0idl  33795  keridl  33802  prnc  33837
 Copyright terms: Public domain W3C validator