Theorem rngodm1dm2 38669

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 38647	. . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		eqid 2762	. . . 4 ⊢ ran 𝐺 = ran 𝐺
4	3	grpofo 30966	. . 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 38637	. 2 ⊢ (𝑅 ∈ RingOps → 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
8		fof 6793	. . . 4 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
9	8	fdmd 6717	. . 3 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → dom 𝐺 = (ran 𝐺 × ran 𝐺))
10		fdm 6716	. . . 4 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom 𝐻 = (ran 𝐺 × ran 𝐺))
11		eqtr 2782	. . . . . . 7 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom 𝐺 = dom 𝐻)
12	11	dmeqd 5893	. . . . . 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 2770	. . . 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 5657  dom cdm 5659  ran crn 5660  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  1^st c1st 7987  2^nd c2nd 7988  GrpOpcgr 30956  RingOpscrngo 38631

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-ov 7419  df-1st 7989  df-2nd 7990  df-grpo 30960  df-ablo 31012  df-rngo 38632

This theorem is used by:  rngorn1  38670