Theorem rngorz 39048

Description: Obsolete theorem, use ringrz 20552 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 39035	. . . . . 6 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		ringlz.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
4		ringlz.1	. . . . . . 7 ⊢ 𝑍 = (GId‘𝐺)
5	3, 4	grpoidcl 31143	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → 𝑍 ∈ 𝑋)
6	3, 4	grpolid 31145	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑍 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
7	2, 5, 6	syl2anc2 597	. . . . 5 ⊢ (𝑅 ∈ RingOps → (𝑍𝐺𝑍) = 𝑍)
8	7	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑍𝐺𝑍) = 𝑍)
9	8	oveq2d 7456	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻(𝑍𝐺𝑍)) = (𝐴𝐻𝑍))
10		simpr 490	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
11	1, 3, 4	rngo0cl 39044	. . . . . 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 39029	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋)) → (𝐴𝐻(𝑍𝐺𝑍)) = ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)))
16	13, 15	syldan 603	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻(𝑍𝐺𝑍)) = ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)))
17	2	adantr 486	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → 𝐺 ∈ GrpOp)
18	1, 14, 3	rngocl 39026	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝑍 ∈ 𝑋) → (𝐴𝐻𝑍) ∈ 𝑋)
19	12, 18	mpd3an3 1492	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) ∈ 𝑋)
20	3, 4	grpolid 31145	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐻𝑍) ∈ 𝑋) → (𝑍𝐺(𝐴𝐻𝑍)) = (𝐴𝐻𝑍))
21	20	eqcomd 2769	. . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴𝐻𝑍) ∈ 𝑋) → (𝐴𝐻𝑍) = (𝑍𝐺(𝐴𝐻𝑍)))
22	17, 19, 21	syl2anc 596	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) = (𝑍𝐺(𝐴𝐻𝑍)))
23	9, 16, 22	3eqtr3d 2806	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)))
24	3	grporcan 31147	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ ((𝐴𝐻𝑍) ∈ 𝑋 ∧ 𝑍 ∈ 𝑋 ∧ (𝐴𝐻𝑍) ∈ 𝑋)) → (((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)) ↔ (𝐴𝐻𝑍) = 𝑍))
25	17, 19, 12, 19, 24	syl13anc 1400	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (((𝐴𝐻𝑍)𝐺(𝐴𝐻𝑍)) = (𝑍𝐺(𝐴𝐻𝑍)) ↔ (𝐴𝐻𝑍) = 𝑍))
26	23, 25	mpbid 235	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝐴𝐻𝑍) = 𝑍)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ran crn 5656  ‘cfv 6555  (class class class)co 7440  1^st c1st 8020  2^nd c2nd 8021  GrpOpcgr 31118  GIdcgi 31119  RingOpscrngo 39019

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fo 6561  df-fv 6563  df-riota 7397  df-ov 7443  df-1st 8022  df-2nd 8023  df-grpo 31122  df-gid 31123  df-ablo 31174  df-rngo 39020

This theorem is used by:  rngoueqz  39065  rngonegmn1r  39067  zerdivemp1x  39072  0idl  39150  keridl  39157