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

Theorem isrnghmd 20693
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 20389 . . . 4 (𝑅 ∈ Rng → 𝑅 ∈ Abel)
11 ablgrp 20011 . . . 4 (𝑅 ∈ Abel → 𝑅 ∈ Grp)
124, 10, 113syl 19 . . 3 (𝜑 → 𝑅 ∈ Grp)
13 rngabl 20389 . . . 4 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
14 ablgrp 20011 . . . 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 19451 . 2 (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑆))
191, 2, 3, 4, 5, 6, 18isrnghm2d 20692 1 (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ⟶wf 6542  ‘cfv 6546  (class class class)co 7427  Basecbs 17399  +gcplusg 17440  .rcmulr 17441  Grpcgrp 19156  Abelcabl 20007  Rngcrng 20386   RngHom crnghm 20676
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-1st 8008  df-2nd 8009  df-map 8860  df-ghm 19440  df-abl 20009  df-rng 20387  df-rnghm 20678
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator