Theorem rngodm1dm2 39058

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 39036	. . 3 ⊢ (𝑅 ∈ RingOps → 𝐺 ∈ GrpOp)
3		eqid 2763	. . . 4 ⊢ ran 𝐺 = ran 𝐺
4	3	grpofo 31131	. . 3 ⊢ (𝐺 ∈ GrpOp → 𝐺:(ran 𝐺 × ran 𝐺)⟶ontoran 𝐺)
5	2, 4	syl 18	. 2 ⊢ (𝑅 ∈ RingOps → 𝐺:(ran 𝐺 × ran 𝐺)⟶ontoran 𝐺)
6		rnplrnml0.1	. . 3 ⊢ 𝐻 = (2nd ‘𝑅)
7	1, 6, 3	rngosm 39026	. 2 ⊢ (𝑅 ∈ RingOps → 𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
8		fof 6818	. . . 4 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)⟶ontoran 𝐺 → 𝐺:(ran 𝐺 × ran 𝐺)⟶ran 𝐺)
9	8	fdmd 6742	. . 3 ⊢ (𝐺:(ran 𝐺 × ran 𝐺)⟶ontoran 𝐺 → dom 𝐺 = (ran 𝐺 × ran 𝐺))
10		fdm 6741	. . . 4 ⊢ (𝐻:(ran 𝐺 × ran 𝐺)⟶ran 𝐺 → dom 𝐻 = (ran 𝐺 × ran 𝐺))
11		eqtr 2783	. . . . . . 7 ⊢ ((dom 𝐺 = (ran 𝐺 × ran 𝐺) ∧ (ran 𝐺 × ran 𝐺) = dom 𝐻) → dom 𝐺 = dom 𝐻)
12	11	dmeqd 5894	. . . . . 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 2771	. . . 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 𝐺)⟶ontoran 𝐺 → (𝐻:(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 2147   × cxp 5653  dom cdm 5655  ran crn 5656  ⟶wf 6554  ⟶ontowfo 6556  ‘cfv 6558  1^st c1st 8023  2^nd c2nd 8024  GrpOpcgr 31121  RingOpscrngo 39020

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 7775

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-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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fo 6564  df-fv 6566  df-ov 7446  df-1st 8025  df-2nd 8026  df-grpo 31125  df-ablo 31177  df-rngo 39021

This theorem is used by:  rngorn1  39059