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

Theorem rnghmmul 20522
Description: A homomorphism of non-unital rings preserves multiplication. (Contributed by AV, 23-Feb-2020.)
Hypotheses
Ref Expression
rnghmmul.x 𝑋 = (Base‘𝑅)
rnghmmul.m · = (.r𝑅)
rnghmmul.n × = (.r𝑆)
Assertion
Ref Expression
rnghmmul ((𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))

Proof of Theorem rnghmmul
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rnghmmul.x . . . 4 𝑋 = (Base‘𝑅)
2 rnghmmul.m . . . 4 · = (.r𝑅)
3 rnghmmul.n . . . 4 × = (.r𝑆)
41, 2, 3isrnghm 20514 . . 3 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))))
5 fvoveq1 7423 . . . . . . 7 (𝑥 = 𝐴 → (𝐹‘(𝑥 · 𝑦)) = (𝐹‘(𝐴 · 𝑦)))
6 fveq2 6871 . . . . . . . 8 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
76oveq1d 7415 . . . . . . 7 (𝑥 = 𝐴 → ((𝐹𝑥) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝑦)))
85, 7eqeq12d 2781 . . . . . 6 (𝑥 = 𝐴 → ((𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦))))
9 oveq2 7408 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
109fveq2d 6875 . . . . . . 7 (𝑦 = 𝐵 → (𝐹‘(𝐴 · 𝑦)) = (𝐹‘(𝐴 · 𝐵)))
11 fveq2 6871 . . . . . . . 8 (𝑦 = 𝐵 → (𝐹𝑦) = (𝐹𝐵))
1211oveq2d 7416 . . . . . . 7 (𝑦 = 𝐵 → ((𝐹𝐴) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝐵)))
1310, 12eqeq12d 2781 . . . . . 6 (𝑦 = 𝐵 → ((𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
148, 13rspc2va 3596 . . . . 5 (((𝐴𝑋𝐵𝑋) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦))) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
1514expcom 418 . . . 4 (∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
1615ad2antll 741 . . 3 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
174, 16sylbi 220 . 2 (𝐹 ∈ (𝑅 RngHom 𝑆) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
18173impib 1132 1 ((𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1563  wcel 2145  wral 3079  cfv 6525  (class class class)co 7400  Basecbs 17259  .rcmulr 17301   GrpHom cghm 19274  Rngcrng 20221   RngHom crnghm 20507
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-map 8814  df-ghm 19275  df-abl 19844  df-rng 20222  df-rnghm 20509
This theorem is referenced by:  rngisom1  20539
  Copyright terms: Public domain W3C validator