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

Theorem rnghmmul 20477
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 20469 . . 3 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))))
5 fvoveq1 7415 . . . . . . 7 (𝑥 = 𝐴 → (𝐹‘(𝑥 · 𝑦)) = (𝐹‘(𝐴 · 𝑦)))
6 fveq2 6863 . . . . . . . 8 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
76oveq1d 7407 . . . . . . 7 (𝑥 = 𝐴 → ((𝐹𝑥) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝑦)))
85, 7eqeq12d 2777 . . . . . 6 (𝑥 = 𝐴 → ((𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦))))
9 oveq2 7400 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
109fveq2d 6867 . . . . . . 7 (𝑦 = 𝐵 → (𝐹‘(𝐴 · 𝑦)) = (𝐹‘(𝐴 · 𝐵)))
11 fveq2 6863 . . . . . . . 8 (𝑦 = 𝐵 → (𝐹𝑦) = (𝐹𝐵))
1211oveq2d 7408 . . . . . . 7 (𝑦 = 𝐵 → ((𝐹𝐴) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝐵)))
1310, 12eqeq12d 2777 . . . . . 6 (𝑦 = 𝐵 → ((𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
148, 13rspc2va 3593 . . . . 5 (((𝐴𝑋𝐵𝑋) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦))) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
1514expcom 417 . . . 4 (∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
1615ad2antll 739 . . 3 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
174, 16sylbi 219 . 2 (𝐹 ∈ (𝑅 RngHom 𝑆) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
18173impib 1128 1 ((𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1097   = wceq 1559  wcel 2141  wral 3075  cfv 6517  (class class class)co 7392  Basecbs 17228  .rcmulr 17270   GrpHom cghm 19236  Rngcrng 20181   RngHom crnghm 20462
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-1st 7966  df-2nd 7967  df-map 8805  df-ghm 19237  df-abl 19806  df-rng 20182  df-rnghm 20464
This theorem is referenced by:  rngisom1  20494
  Copyright terms: Public domain W3C validator