Theorem rngohomadd 39049

Description: Obsolete theorem, use rhmadd 20733 instead. Ring homomorphisms preserve addition. (Contributed by Jeff Madsen, 3-Jan-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
rnghomadd.1	⊢ 𝐺 = (1st ‘𝑅)
rnghomadd.2	⊢ 𝑋 = ran 𝐺
rnghomadd.3	⊢ 𝐽 = (1st ‘𝑆)

Assertion

Ref	Expression
rngohomadd	⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘(𝐴𝐺𝐵)) = ((𝐹‘𝐴)𝐽(𝐹‘𝐵)))

Proof of Theorem rngohomadd

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rnghomadd.1	. . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅)
2		eqid 2763	. . . . . . 7 ⊢ (2nd ‘𝑅) = (2nd ‘𝑅)
3		rnghomadd.2	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
4		eqid 2763	. . . . . . 7 ⊢ (GId‘(2nd ‘𝑅)) = (GId‘(2nd ‘𝑅))
5		rnghomadd.3	. . . . . . 7 ⊢ 𝐽 = (1st ‘𝑆)
6		eqid 2763	. . . . . . 7 ⊢ (2nd ‘𝑆) = (2nd ‘𝑆)
7		eqid 2763	. . . . . . 7 ⊢ ran 𝐽 = ran 𝐽
8		eqid 2763	. . . . . . 7 ⊢ (GId‘(2nd ‘𝑆)) = (GId‘(2nd ‘𝑆))
9	1, 2, 3, 4, 5, 6, 7, 8	isrngohom 39045	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RingOpsHom 𝑆) ↔ (𝐹:𝑋⟶ran 𝐽 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))))))
10	9	biimpa 482	. . . . 5 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹:𝑋⟶ran 𝐽 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦)))))
11	10	simp3d 1162	. . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))))
12	11	3impa 1127	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))))
13		simpl 488	. . . 4 ⊢ (((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))) → (𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
14	13	2ralimi 3136	. . 3 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
15	12, 14	syl 18	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)))
16		fvoveq1 7453	. . . 4 ⊢ (𝑥 = 𝐴 → (𝐹‘(𝑥𝐺𝑦)) = (𝐹‘(𝐴𝐺𝑦)))
17		fveq2 6896	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
18	17	oveq1d 7445	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝐴)𝐽(𝐹‘𝑦)))
19	16, 18	eqeq12d 2779	. . 3 ⊢ (𝑥 = 𝐴 → ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ↔ (𝐹‘(𝐴𝐺𝑦)) = ((𝐹‘𝐴)𝐽(𝐹‘𝑦))))
20		oveq2 7438	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
21	20	fveq2d 6900	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐹‘(𝐴𝐺𝑦)) = (𝐹‘(𝐴𝐺𝐵)))
22		fveq2 6896	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐹‘𝑦) = (𝐹‘𝐵))
23	22	oveq2d 7446	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐹‘𝐴)𝐽(𝐹‘𝑦)) = ((𝐹‘𝐴)𝐽(𝐹‘𝐵)))
24	21, 23	eqeq12d 2779	. . 3 ⊢ (𝑦 = 𝐵 → ((𝐹‘(𝐴𝐺𝑦)) = ((𝐹‘𝐴)𝐽(𝐹‘𝑦)) ↔ (𝐹‘(𝐴𝐺𝐵)) = ((𝐹‘𝐴)𝐽(𝐹‘𝐵))))
25	19, 24	rspc2v 3590	. 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) → (𝐹‘(𝐴𝐺𝐵)) = ((𝐹‘𝐴)𝐽(𝐹‘𝐵))))
26	15, 25	mpan9 516	1 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐹‘(𝐴𝐺𝐵)) = ((𝐹‘𝐴)𝐽(𝐹‘𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ran crn 5656  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430  1^st c1st 8009  2^nd c2nd 8010  GIdcgi 31107  RingOpscrngo 38974   RingOpsHom crngohom 39040

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-map 8863  df-rngohom 39043

This theorem is used by:  rngogrphom  39051  rngohomco  39054  rngoisocnv  39061  keridl  39112