Theorem rngolz 33721

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

Step	Hyp	Ref	Expression
1		ringlz.3	. . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅)
2	1	rngogrpo 33709	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		ringlz.2	. . . . . . . 8 ⊢ 𝑋 = ran 𝐺
4		ringlz.1	. . . . . . . 8 ⊢ 𝑍 = (GId‘𝐺)
5	3, 4	grpoidcl 27368	. . . . . . 7 ⊢ (𝐺 ∈ GrpOp → 𝑍 ∈ 𝑋)
6	3, 4	grpolid 27370	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑍 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
7	5, 6	mpdan 702	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → (𝑍𝐺𝑍) = 𝑍)
8	2, 7	syl 17	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
9	8	adantr 481	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
10	9	oveq1d 6665	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = (𝑍𝐻𝐴))
11	1, 3, 4	rngo0cl 33718	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝑍 ∈ 𝑋)
12	11	adantr 481	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑍 ∈ 𝑋)
13		simpr 477	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
14	12, 12, 13	3jca 1242	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋))
15		ringlz.4	. . . . 5 ⊢ 𝐻 = (2nd ‘𝑅)
16	1, 15, 3	rngodir 33704	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
17	14, 16	syldan 487	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
18	2	adantr 481	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
19		simpl 473	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑅 ∈ RingOps)
20	1, 15, 3	rngocl 33700	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
21	19, 12, 13, 20	syl3anc 1326	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
22	3, 4	grporid 27371	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺𝑍) = (𝑍𝐻𝐴))
23	22	eqcomd 2628	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
24	18, 21, 23	syl2anc 693	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
25	10, 17, 24	3eqtr3d 2664	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍))
26	3	grpolcan 27384	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝑍𝐻𝐴) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ (𝑍𝐻𝐴) ∈ 𝑋)) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
27	18, 21, 12, 21, 26	syl13anc 1328	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
28	25, 27	mpbid 222	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = 𝑍)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ran crn 5115  ‘cfv 5888  (class class class)co 6650  1^st c1st 7166  2^nd c2nd 7167  GrpOpcgr 27343  GIdcgi 27344  RingOpscrngo 33693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-1st 7168  df-2nd 7169  df-grpo 27347  df-gid 27348  df-ginv 27349  df-ablo 27399  df-rngo 33694

This theorem is referenced by:  rngonegmn1l  33740  isdrngo3  33758  0idl  33824  keridl  33831  prnc  33866