Theorem rngodm1dm2 38786

Description: Obsolete theorem. In a unital ring the domain of the first variable of the addition equals the domain of the first variable of the multiplication. (Contributed by FL, 24-Jan-2010.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
rnplrnml0.1	⊢ 𝐻 = (2nd ‘𝑅)
rnplrnml0.2	⊢ 𝐺 = (1st ‘𝑅)

Assertion

Ref	Expression
rngodm1dm2	⊢ (𝑅 ∈ RingOps → dom dom 𝐺 = dom dom 𝐻)

Proof of Theorem rngodm1dm2

Step	Hyp	Ref	Expression
1		rnplrnml0.2	. . . 4 ⊢ 𝐺 = (1st ‘𝑅)
2	1	rngogrpo 38764	. . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		eqid 2760	. . . 4 ⊢ ran 𝐺 = ran 𝐺
4	3	grpofo 31034	. . 3 ⊢ (𝐺 ∈ GrpOp → 𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺)
5	2, 4	syl 18	. 2 ⊢ (𝑅 ∈ RingOps → 𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺)
6		rnplrnml0.1	. . 3 ⊢ 𝐻 = (2nd ‘𝑅)
7	1, 6, 3	rngosm 38754	. 2 ⊢ (𝑅 ∈ RingOps → 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
8		fof 6784	. . . 4 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
9	8	fdmd 6708	. . 3 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → dom 𝐺 = (ran 𝐺 × ran 𝐺))
10		fdm 6707	. . . 4 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom 𝐻 = (ran 𝐺 × ran 𝐺))
11		eqtr 2780	. . . . . . 7 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom 𝐺 = dom 𝐻)
12	11	dmeqd 5883	. . . . . 6 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom dom 𝐺 = dom dom 𝐻)
13	12	expcom 419	. . . . 5 ⊢ ((ran 𝐺 × ran 𝐺) = dom 𝐻 → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
14	13	eqcoms 2768	. . . 4 ⊢ (dom 𝐻 = (ran 𝐺 × ran 𝐺) → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
15	10, 14	syl 18	. . 3 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
16	9, 15	syl5com 32	. 2 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom dom 𝐺 = dom dom 𝐻))
17	5, 7, 16	sylc 66	1 ⊢ (𝑅 ∈ RingOps → dom dom 𝐺 = dom dom 𝐻)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   × cxp 5645  dom cdm 5647  ran crn 5648  ⟶wf 6523  –onto→wfo 6525  ‘cfv 6527  1^st c1st 7982  2^nd c2nd 7983  GrpOpcgr 31024  RingOpscrngo 38748

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7734

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 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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  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 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-ov 7411  df-1st 7984  df-2nd 7985  df-grpo 31028  df-ablo 31080  df-rngo 38749

This theorem is used by:  rngorn1  38787