Theorem rngodm1dm2 35214

Description: 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.)

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 35192	. . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		eqid 2824	. . . 4 ⊢ ran 𝐺 = ran 𝐺
4	3	grpofo 28279	. . 3 ⊢ (𝐺 ∈ GrpOp → 𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺)
5	2, 4	syl 17	. 2 ⊢ (𝑅 ∈ RingOps → 𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺)
6		rnplrnml0.1	. . 3 ⊢ 𝐻 = (2nd ‘𝑅)
7	1, 6, 3	rngosm 35182	. 2 ⊢ (𝑅 ∈ RingOps → 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
8		fof 6593	. . . 4 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
9	8	fdmd 6526	. . 3 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → dom 𝐺 = (ran 𝐺 × ran 𝐺))
10		fdm 6525	. . . 4 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom 𝐻 = (ran 𝐺 × ran 𝐺))
11		eqtr 2844	. . . . . . 7 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom 𝐺 = dom 𝐻)
12	11	dmeqd 5777	. . . . . 6 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom dom 𝐺 = dom dom 𝐻)
13	12	expcom 416	. . . . 5 ⊢ ((ran 𝐺 × ran 𝐺) = dom 𝐻 → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
14	13	eqcoms 2832	. . . 4 ⊢ (dom 𝐻 = (ran 𝐺 × ran 𝐺) → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
15	10, 14	syl 17	. . 3 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → (dom 𝐺 = (ran 𝐺 × ran 𝐺) → dom dom 𝐺 = dom dom 𝐻))
16	9, 15	syl5com 31	. 2 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)–onto→ran 𝐺 → (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom dom 𝐺 = dom dom 𝐻))
17	5, 7, 16	sylc 65	1 ⊢ (𝑅 ∈ RingOps → dom dom 𝐺 = dom dom 𝐻)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113   × cxp 5556  dom cdm 5558  ran crn 5559  ⟶wf 6354  –onto→wfo 6356  ‘cfv 6358  1^st c1st 7690  2^nd c2nd 7691  GrpOpcgr 28269  RingOpscrngo 35176

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-fo 6364  df-fv 6366  df-ov 7162  df-1st 7692  df-2nd 7693  df-grpo 28273  df-ablo 28325  df-rngo 35177

This theorem is referenced by:  rngorn1  35215