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

Theorem rnghmmul 20397
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 20389 . . 3 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))))
5 fvoveq1 7391 . . . . . . 7 (𝑥 = 𝐴 → (𝐹‘(𝑥 · 𝑦)) = (𝐹‘(𝐴 · 𝑦)))
6 fveq2 6842 . . . . . . . 8 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
76oveq1d 7383 . . . . . . 7 (𝑥 = 𝐴 → ((𝐹𝑥) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝑦)))
85, 7eqeq12d 2753 . . . . . 6 (𝑥 = 𝐴 → ((𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦))))
9 oveq2 7376 . . . . . . . 8 (𝑦 = 𝐵 → (𝐴 · 𝑦) = (𝐴 · 𝐵))
109fveq2d 6846 . . . . . . 7 (𝑦 = 𝐵 → (𝐹‘(𝐴 · 𝑦)) = (𝐹‘(𝐴 · 𝐵)))
11 fveq2 6842 . . . . . . . 8 (𝑦 = 𝐵 → (𝐹𝑦) = (𝐹𝐵))
1211oveq2d 7384 . . . . . . 7 (𝑦 = 𝐵 → ((𝐹𝐴) × (𝐹𝑦)) = ((𝐹𝐴) × (𝐹𝐵)))
1310, 12eqeq12d 2753 . . . . . 6 (𝑦 = 𝐵 → ((𝐹‘(𝐴 · 𝑦)) = ((𝐹𝐴) × (𝐹𝑦)) ↔ (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
148, 13rspc2va 3590 . . . . 5 (((𝐴𝑋𝐵𝑋) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦))) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
1514expcom 413 . . . 4 (∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
1615ad2antll 730 . . 3 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥𝑋𝑦𝑋 (𝐹‘(𝑥 · 𝑦)) = ((𝐹𝑥) × (𝐹𝑦)))) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
174, 16sylbi 217 . 2 (𝐹 ∈ (𝑅 RngHom 𝑆) → ((𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵))))
18173impib 1117 1 ((𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐴𝑋𝐵𝑋) → (𝐹‘(𝐴 · 𝐵)) = ((𝐹𝐴) × (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  cfv 6500  (class class class)co 7368  Basecbs 17148  .rcmulr 17190   GrpHom cghm 19153  Rngcrng 20099   RngHom crnghm 20382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-map 8777  df-ghm 19154  df-abl 19724  df-rng 20100  df-rnghm 20384
This theorem is referenced by:  rngisom1  20414
  Copyright terms: Public domain W3C validator