MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rhmval0 Structured version   Visualization version   GIF version

Theorem rhmval0 20603
Description: The set of ring homomorphisms. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 22-Sep-2015.) (Revised by AV, 24-Jul-2026.)
Hypotheses
Ref Expression
rhmval0.b 𝐵 = (Base‘𝑅)
rhmval0.c 𝐶 = (Base‘𝑆)
rhmval0.1 1 = (1r𝑅)
rhmval0.i 𝑁 = (1r𝑆)
rhmval0.m · = (.r𝑅)
rhmval0.n × = (.r𝑆)
rhmval0.p + = (+g𝑅)
rhmval0.q = (+g𝑆)
Assertion
Ref Expression
rhmval0 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 RingHom 𝑆) = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
Distinct variable groups:   𝐵,𝑓,𝑥,𝑦   𝐶,𝑓   𝑓,𝑁   𝑅,𝑓,𝑥,𝑦   𝑆,𝑓,𝑥,𝑦   1 ,𝑓   + ,𝑓   ,𝑓   · ,𝑓   × ,𝑓
Allowed substitution hints:   𝐶(𝑥, 𝑦)   + (𝑥, 𝑦)   (𝑥, 𝑦)   · (𝑥, 𝑦)   × (𝑥, 𝑦)   1 (𝑥, 𝑦)   𝑁(𝑥, 𝑦)

Proof of Theorem rhmval0
Dummy variables 𝑣 𝑟 𝑠 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6885 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
2 rhmval0.b . . . . . 6 𝐵 = (Base‘𝑅)
31, 2eqtr4di 2818 . . . . 5 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
43adantr 486 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑟) = 𝐵)
5 fveq2 6885 . . . . . . . . . 10 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
6 rhmval0.1 . . . . . . . . . 10 1 = (1r𝑅)
75, 6eqtr4di 2818 . . . . . . . . 9 (𝑟 = 𝑅 → (1r𝑟) = 1 )
87fveq2d 6889 . . . . . . . 8 (𝑟 = 𝑅 → (𝑓‘(1r𝑟)) = (𝑓1 ))
9 fveq2 6885 . . . . . . . . 9 (𝑠 = 𝑆 → (1r𝑠) = (1r𝑆))
10 rhmval0.i . . . . . . . . 9 𝑁 = (1r𝑆)
119, 10eqtr4di 2818 . . . . . . . 8 (𝑠 = 𝑆 → (1r𝑠) = 𝑁)
128, 11eqeqan12d 2779 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(1r𝑟)) = (1r𝑠) ↔ (𝑓1 ) = 𝑁))
13 fveq2 6885 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (+g𝑟) = (+g𝑅))
14 rhmval0.p . . . . . . . . . . . . 13 + = (+g𝑅)
1513, 14eqtr4di 2818 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (+g𝑟) = + )
1615oveqd 7436 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑥(+g𝑟)𝑦) = (𝑥 + 𝑦))
1716fveq2d 6889 . . . . . . . . . 10 (𝑟 = 𝑅 → (𝑓‘(𝑥(+g𝑟)𝑦)) = (𝑓‘(𝑥 + 𝑦)))
18 fveq2 6885 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (+g𝑠) = (+g𝑆))
19 rhmval0.q . . . . . . . . . . . 12 = (+g𝑆)
2018, 19eqtr4di 2818 . . . . . . . . . . 11 (𝑠 = 𝑆 → (+g𝑠) = )
2120oveqd 7436 . . . . . . . . . 10 (𝑠 = 𝑆 → ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) = ((𝑓𝑥) (𝑓𝑦)))
2217, 21eqeqan12d 2779 . . . . . . . . 9 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ↔ (𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦))))
23 fveq2 6885 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
24 rhmval0.m . . . . . . . . . . . . 13 · = (.r𝑅)
2523, 24eqtr4di 2818 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (.r𝑟) = · )
2625oveqd 7436 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑥(.r𝑟)𝑦) = (𝑥 · 𝑦))
2726fveq2d 6889 . . . . . . . . . 10 (𝑟 = 𝑅 → (𝑓‘(𝑥(.r𝑟)𝑦)) = (𝑓‘(𝑥 · 𝑦)))
28 fveq2 6885 . . . . . . . . . . . 12 (𝑠 = 𝑆 → (.r𝑠) = (.r𝑆))
29 rhmval0.n . . . . . . . . . . . 12 × = (.r𝑆)
3028, 29eqtr4di 2818 . . . . . . . . . . 11 (𝑠 = 𝑆 → (.r𝑠) = × )
3130oveqd 7436 . . . . . . . . . 10 (𝑠 = 𝑆 → ((𝑓𝑥)(.r𝑠)(𝑓𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))
3227, 31eqeqan12d 2779 . . . . . . . . 9 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦)) ↔ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))
3322, 32anbi12d 644 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → (((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))) ↔ ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
34332ralbidv 3231 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))) ↔ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
3512, 34anbi12d 644 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦)))) ↔ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))))
3635rabbidv 3425 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → {𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))))} = {𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
3736csbeq2dv 3861 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))))} = (Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
384, 37csbeq12dv 3863 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑟) / 𝑣(Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))))} = 𝐵 / 𝑣(Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
39 fveq2 6885 . . . . . . 7 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
40 rhmval0.c . . . . . . 7 𝐶 = (Base‘𝑆)
4139, 40eqtr4di 2818 . . . . . 6 (𝑠 = 𝑆 → (Base‘𝑠) = 𝐶)
4241adantl 487 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑠) = 𝐶)
4342csbeq1d 3858 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} = 𝐶 / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
4443csbeq2dv 3861 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → 𝐵 / 𝑣(Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} = 𝐵 / 𝑣𝐶 / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
452fvexi 6899 . . . . 5 𝐵 ∈ V
4640fvexi 6899 . . . . 5 𝐶 ∈ V
47 oveq12 7428 . . . . . . 7 ((𝑤 = 𝐶𝑣 = 𝐵) → (𝑤m 𝑣) = (𝐶m 𝐵))
4847ancoms 464 . . . . . 6 ((𝑣 = 𝐵𝑤 = 𝐶) → (𝑤m 𝑣) = (𝐶m 𝐵))
49 raleq 3322 . . . . . . . . 9 (𝑣 = 𝐵 → (∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))) ↔ ∀𝑥𝐵𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
50 raleq 3322 . . . . . . . . . 10 (𝑣 = 𝐵 → (∀𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))) ↔ ∀𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
5150ralbidv 3190 . . . . . . . . 9 (𝑣 = 𝐵 → (∀𝑥𝐵𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
5249, 51bitrd 282 . . . . . . . 8 (𝑣 = 𝐵 → (∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
5352adantr 486 . . . . . . 7 ((𝑣 = 𝐵𝑤 = 𝐶) → (∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))))
5453anbi2d 642 . . . . . 6 ((𝑣 = 𝐵𝑤 = 𝐶) → (((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦)))) ↔ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))))
5548, 54rabeqbidv 3436 . . . . 5 ((𝑣 = 𝐵𝑤 = 𝐶) → {𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
5645, 46, 55csbie2 3893 . . . 4 𝐵 / 𝑣𝐶 / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))}
5756a1i 11 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → 𝐵 / 𝑣𝐶 / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
5838, 44, 573eqtrd 2804 . 2 ((𝑟 = 𝑅𝑠 = 𝑆) → (Base‘𝑟) / 𝑣(Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))))} = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
59 df-rhm 20600 . 2 RingHom = (𝑟 ∈ Ring, 𝑠 ∈ Ring ↦ (Base‘𝑟) / 𝑣(Base‘𝑠) / 𝑤{𝑓 ∈ (𝑤m 𝑣) ∣ ((𝑓‘(1r𝑟)) = (1r𝑠) ∧ ∀𝑥𝑣𝑦𝑣 ((𝑓‘(𝑥(+g𝑟)𝑦)) = ((𝑓𝑥)(+g𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(.r𝑟)𝑦)) = ((𝑓𝑥)(.r𝑠)(𝑓𝑦))))})
60 ovex 7452 . . 3 (𝐶m 𝐵) ∈ V
6160rabex 5311 . 2 {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))} ∈ V
6258, 59, 61ovmpoa 7574 1 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 RingHom 𝑆) = {𝑓 ∈ (𝐶m 𝐵) ∣ ((𝑓1 ) = 𝑁 ∧ ∀𝑥𝐵𝑦𝐵 ((𝑓‘(𝑥 + 𝑦)) = ((𝑓𝑥) (𝑓𝑦)) ∧ (𝑓‘(𝑥 · 𝑦)) = ((𝑓𝑥) × (𝑓𝑦))))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  {crab 3418  csb 3854  cfv 6540  (class class class)co 7419  m cmap 8830  Basecbs 17291  +gcplusg 17332  .rcmulr 17333  1rcur 20307  Ringcrg 20359   RingHom crh 20597
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-rhm 20600
This theorem is used by:  isrhm0  20604
  Copyright terms: Public domain W3C validator