Theorem rngorz 38858

Description: Obsolete theorem, use ringrz 20525 instead. The zero of a unital ring is a right-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
rngorz	⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) = 𝑍)

Proof of Theorem rngorz

Step	Hyp	Ref	Expression
1		ringlz.3	. . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅)
2	1	rngogrpo 38845	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		ringlz.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
4		ringlz.1	. . . . . . 7 ⊢ 𝑍 = (GId‘𝐺)
5	3, 4	grpoidcl 31116	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → 𝑍 ∈ 𝑋)
6	3, 4	grpolid 31118	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑍 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
7	2, 5, 6	syl2anc2 597	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
8	7	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
9	8	oveq2d 7436	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻(𝑍𝐺𝑍)) = (𝐴𝐻𝑍))
10		simpr 490	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
11	1, 3, 4	rngo0cl 38854	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝑍 ∈ 𝑋)
12	11	adantr 486	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝑍 ∈ 𝑋)
13	10, 12, 12	3jca 1146	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋))
14		ringlz.4	. . . . 5 ⊢ 𝐻 = (2nd ‘𝑅)
15	1, 14, 3	rngodi 38839	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋)) → (𝐴𝐻(𝑍𝐺𝑍)) = ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)))
16	13, 15	syldan 603	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻(𝑍𝐺𝑍)) = ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)))
17	2	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
18	1, 14, 3	rngocl 38836	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋) → (𝐴𝐻𝑍) ∈ 𝑋)
19	12, 18	mpd3an3 1491	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) ∈ 𝑋)
20	3, 4	grpolid 31118	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐻𝑍) ∈ 𝑋) → (𝑍𝐺(𝐴𝐻𝑍)) = (𝐴𝐻𝑍))
21	20	eqcomd 2766	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐻𝑍) ∈ 𝑋) → (𝐴𝐻𝑍) = (𝑍𝐺(𝐴𝐻𝑍)))
22	17, 19, 21	syl2anc 596	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) = (𝑍𝐺(𝐴𝐻𝑍)))
23	9, 16, 22	3eqtr3d 2803	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)))
24	3	grporcan 31120	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝐴𝐻𝑍) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ (𝐴𝐻𝑍) ∈ 𝑋)) → (((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)) ↔ (𝐴𝐻𝑍) = 𝑍))
25	17, 19, 12, 19, 24	syl13anc 1399	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)) ↔ (𝐴𝐻𝑍) = 𝑍))
26	23, 25	mpbid 235	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) = 𝑍)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ran crn 5651  ‘cfv 6538  (class class class)co 7420  1^st c1st 7999  2^nd c2nd 8000  GrpOpcgr 31091  GIdcgi 31092  RingOpscrngo 38829

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-riota 7377  df-ov 7423  df-1st 8001  df-2nd 8002  df-grpo 31095  df-gid 31096  df-ablo 31147  df-rngo 38830

This theorem is used by:  rngoueqz  38875  rngonegmn1r  38877  zerdivemp1x  38882  0idl  38960  keridl  38967