Theorem rngolz 36007

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 35995	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		ringlz.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
4		ringlz.1	. . . . . . 7 ⊢ 𝑍 = (GId‘𝐺)
5	3, 4	grpoidcl 28777	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → 𝑍 ∈ 𝑋)
6	3, 4	grpolid 28779	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑍 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
7	2, 5, 6	syl2anc2 584	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
8	7	adantr 480	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
9	8	oveq1d 7270	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = (𝑍𝐻𝐴))
10	1, 3, 4	rngo0cl 36004	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝑍 ∈ 𝑋)
11	10	adantr 480	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑍 ∈ 𝑋)
12		simpr 484	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
13	11, 11, 12	3jca 1126	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋))
14		ringlz.4	. . . . 5 ⊢ 𝐻 = (2nd ‘𝑅)
15	1, 14, 3	rngodir 35990	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
16	13, 15	syldan 590	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
17	2	adantr 480	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
18		simpl 482	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑅 ∈ RingOps)
19	1, 14, 3	rngocl 35986	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
20	18, 11, 12, 19	syl3anc 1369	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
21	3, 4	grporid 28780	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺𝑍) = (𝑍𝐻𝐴))
22	21	eqcomd 2744	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
23	17, 20, 22	syl2anc 583	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
24	9, 16, 23	3eqtr3d 2786	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍))
25	3	grpolcan 28793	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝑍𝐻𝐴) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ (𝑍𝐻𝐴) ∈ 𝑋)) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
26	17, 20, 11, 20, 25	syl13anc 1370	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
27	24, 26	mpbid 231	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = 𝑍)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ran crn 5581  ‘cfv 6418  (class class class)co 7255  1^st c1st 7802  2^nd c2nd 7803  GrpOpcgr 28752  GIdcgi 28753  RingOpscrngo 35979

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-1st 7804  df-2nd 7805  df-grpo 28756  df-gid 28757  df-ginv 28758  df-ablo 28808  df-rngo 35980

This theorem is referenced by:  rngonegmn1l  36026  isdrngo3  36044  0idl  36110  keridl  36117  prnc  36152