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

Theorem isrnghmd 20681
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 20377 . . . 4 (𝑅 ∈ Rng → 𝑅 ∈ Abel)
11 ablgrp 19999 . . . 4 (𝑅 ∈ Abel → 𝑅 ∈ Grp)
124, 10, 113syl 19 . . 3 (𝜑 → 𝑅 ∈ Grp)
13 rngabl 20377 . . . 4 (𝑆 ∈ Rng → 𝑆 ∈ Abel)
14 ablgrp 19999 . . . 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 19439 . 2 (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑆))
191, 2, 3, 4, 5, 6, 18isrnghm2d 20680 1 (𝜑 → 𝐹 ∈ (𝑅 RngHom 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +gcplusg 17428  .rcmulr 17429  Grpcgrp 19144  Abelcabl 19995  Rngcrng 20374   RngHom crnghm 20664
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849  df-ghm 19428  df-abl 19997  df-rng 20375  df-rnghm 20666
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator