Theorem rngolz 38606

Description: Obsolete theorem, use ringlz 20401 instead. The zero of a unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009.) (New usage is discouraged.) (Proof modification 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 38594	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		ringlz.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
4		ringlz.1	. . . . . . 7 ⊢ 𝑍 = (GId‘𝐺)
5	3, 4	grpoidcl 30895	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → 𝑍 ∈ 𝑋)
6	3, 4	grpolid 30897	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑍 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
7	2, 5, 6	syl2anc2 597	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
8	7	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
9	8	oveq1d 7431	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = (𝑍𝐻𝐴))
10	1, 3, 4	rngo0cl 38603	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝑍 ∈ 𝑋)
11	10	adantr 486	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑍 ∈ 𝑋)
12		simpr 490	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
13	11, 11, 12	3jca 1146	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋))
14		ringlz.4	. . . . 5 ⊢ 𝐻 = (2nd ‘𝑅)
15	1, 14, 3	rngodir 38589	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
16	13, 15	syldan 603	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐺𝑍)𝐻𝐴) = ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)))
17	2	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
18		simpl 488	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑅 ∈ RingOps)
19	1, 14, 3	rngocl 38585	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝑍 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
20	18, 11, 12, 19	syl3anc 1398	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) ∈ 𝑋)
21	3, 4	grporid 30898	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺𝑍) = (𝑍𝐻𝐴))
22	21	eqcomd 2771	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑍𝐻𝐴) ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
23	17, 20, 22	syl2anc 596	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = ((𝑍𝐻𝐴)𝐺𝑍))
24	9, 16, 23	3eqtr3d 2808	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍))
25	3	grpolcan 30911	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝑍𝐻𝐴) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ (𝑍𝐻𝐴) ∈ 𝑋)) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
26	17, 20, 11, 20, 25	syl13anc 1399	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (((𝑍𝐻𝐴)𝐺(𝑍𝐻𝐴)) = ((𝑍𝐻𝐴)𝐺𝑍) ↔ (𝑍𝐻𝐴) = 𝑍))
27	24, 26	mpbid 235	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐻𝐴) = 𝑍)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ran crn 5664  ‘cfv 6540  (class class class)co 7416  1^st c1st 7986  2^nd c2nd 7987  GrpOpcgr 30870  GIdcgi 30871  RingOpscrngo 38578

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-1st 7988  df-2nd 7989  df-grpo 30874  df-gid 30875  df-ginv 30876  df-ablo 30926  df-rngo 38579

This theorem is used by:  rngonegmn1l  38625  isdrngo3  38643  0idl  38709  keridl  38716  prnc  38751