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

Theorem isrnghmd 20732
Description: Demonstration of non-unital ring homomorphism. (Contributed by AV, 23-Feb-2020.)
Hypotheses
Ref Expression
isrnghmd.b 𝐵 = (Base‘𝑅)
isrnghmd.t · = (.r‘𝑅)
isrnghmd.u × = (.r‘𝑆)
isrnghmd.r (𝜑 → 𝑅 ∈ Rng)
isrnghmd.s (𝜑 → 𝑆 ∈ Rng)
isrnghmd.ht ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) × (𝐹‘𝑦)))
isrnghmd.c 𝐶 = (Base‘𝑆)
isrnghmd.p + = (+g‘𝑅)
isrnghmd.q ⨣ = (+g‘𝑆)
isrnghmd.f (𝜑 → 𝐹:𝐵⟶𝐶)
isrnghmd.hp ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))
Assertion
Ref Expression
isrnghmd (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑆))
Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦   𝑥, + ,𝑦   𝑥, ⨣ ,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   · (𝑥, 𝑦)   × (𝑥, 𝑦)

Proof of Theorem isrnghmd
StepHypRef Expression
1 isrnghmd.b . 2 𝐵 = (Base‘𝑅)
2 isrnghmd.t . 2 · = (.r‘𝑅)
3 isrnghmd.u . 2 × = (.r‘𝑆)
4 isrnghmd.r . 2 (𝜑 → 𝑅 ∈ Rng)
5 isrnghmd.s . 2 (𝜑 → 𝑆 ∈ Rng)
6 isrnghmd.ht . 2 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘(𝑥 · 𝑦)) = ((𝐹‘𝑥) × (𝐹‘𝑦)))
7 isrnghmd.c . . 3 𝐶 = (Base‘𝑆)
8 isrnghmd.p . . 3 + = (+g‘𝑅)
9 isrnghmd.q . . 3 ⨣ = (+g‘𝑆)
10 rngabl 20428 . . . 4 (𝑅 ∈ Rng → 𝑅 ∈ Abel)
11 ablgrp 20050 . . . 4 (𝑅 ∈ Abel → 𝑅 ∈ Grp)
124, 10, 113syl 19 . . 3 (𝜑 → 𝑅 ∈ Grp)
13 rngabl 20428 . . . 4 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
14 ablgrp 20050 . . . 4 (𝑆 ∈ Abel → 𝑆 ∈ Grp)
155, 13, 143syl 19 . . 3 (𝜑 → 𝑆 ∈ Grp)
16 isrnghmd.f . . 3 (𝜑 → 𝐹:𝐵⟶𝐶)
17 isrnghmd.hp . . 3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))
181, 7, 8, 9, 12, 15, 16, 17isghmd 19489 . 2 (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑆))
191, 2, 3, 4, 5, 6, 18isrnghm2d 20731 1 (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  .rcmulr 17473  Grpcgrp 19194  Abelcabl 20046  Rngcrng 20425   RngHom crnghm 20715
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  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-csb 3852  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-ghm 19478  df-abl 20048  df-rng 20426  df-rnghm 20717
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator