Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isrnghmmul Structured version   Visualization version   GIF version

Theorem isrnghmmul 42494
Description: A function is a non-unital ring homomorphism iff it preserves both addition and multiplication. (Contributed by AV, 27-Feb-2020.)
Hypotheses
Ref Expression
isrnghmmul.m 𝑀 = (mulGrp‘𝑅)
isrnghmmul.n 𝑁 = (mulGrp‘𝑆)
Assertion
Ref Expression
isrnghmmul (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))

Proof of Theorem isrnghmmul
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2765 . . 3 (Base‘𝑅) = (Base‘𝑅)
2 eqid 2765 . . 3 (.r𝑅) = (.r𝑅)
3 eqid 2765 . . 3 (.r𝑆) = (.r𝑆)
41, 2, 3isrnghm 42493 . 2 (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
5 isrnghmmul.m . . . . . . . . . . 11 𝑀 = (mulGrp‘𝑅)
65rngmgp 42479 . . . . . . . . . 10 (𝑅 ∈ Rng → 𝑀 ∈ SGrp)
7 sgrpmgm 17557 . . . . . . . . . 10 (𝑀 ∈ SGrp → 𝑀 ∈ Mgm)
86, 7syl 17 . . . . . . . . 9 (𝑅 ∈ Rng → 𝑀 ∈ Mgm)
9 isrnghmmul.n . . . . . . . . . . 11 𝑁 = (mulGrp‘𝑆)
109rngmgp 42479 . . . . . . . . . 10 (𝑆 ∈ Rng → 𝑁 ∈ SGrp)
11 sgrpmgm 17557 . . . . . . . . . 10 (𝑁 ∈ SGrp → 𝑁 ∈ Mgm)
1210, 11syl 17 . . . . . . . . 9 (𝑆 ∈ Rng → 𝑁 ∈ Mgm)
138, 12anim12i 606 . . . . . . . 8 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm))
14 eqid 2765 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
151, 14ghmf 17930 . . . . . . . 8 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
1613, 15anim12i 606 . . . . . . 7 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)))
1716biantrurd 528 . . . . . 6 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ (((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
18 anass 460 . . . . . 6 ((((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
1917, 18syl6bb 278 . . . . 5 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))))))
205, 1mgpbas 18762 . . . . . 6 (Base‘𝑅) = (Base‘𝑀)
219, 14mgpbas 18762 . . . . . 6 (Base‘𝑆) = (Base‘𝑁)
225, 2mgpplusg 18760 . . . . . 6 (.r𝑅) = (+g𝑀)
239, 3mgpplusg 18760 . . . . . 6 (.r𝑆) = (+g𝑁)
2420, 21, 22, 23ismgmhm 42384 . . . . 5 (𝐹 ∈ (𝑀 MgmHom 𝑁) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
2519, 24syl6bbr 280 . . . 4 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ 𝐹 ∈ (𝑀 MgmHom 𝑁)))
2625pm5.32da 574 . . 3 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
2726pm5.32i 570 . 2 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
284, 27bitri 266 1 (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
Colors of variables: wff setvar class
Syntax hints:  wb 197  wa 384   = wceq 1652  wcel 2155  wral 3055  wf 6064  cfv 6068  (class class class)co 6842  Basecbs 16132  .rcmulr 16217  Mgmcmgm 17508  SGrpcsgrp 17551   GrpHom cghm 17923  mulGrpcmgp 18756   MgmHom cmgmhm 42378  Rngcrng 42475   RngHomo crngh 42486
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-rep 4930  ax-sep 4941  ax-nul 4949  ax-pow 5001  ax-pr 5062  ax-un 7147  ax-cnex 10245  ax-resscn 10246  ax-1cn 10247  ax-icn 10248  ax-addcl 10249  ax-addrcl 10250  ax-mulcl 10251  ax-mulrcl 10252  ax-mulcom 10253  ax-addass 10254  ax-mulass 10255  ax-distr 10256  ax-i2m1 10257  ax-1ne0 10258  ax-1rid 10259  ax-rnegex 10260  ax-rrecex 10261  ax-cnre 10262  ax-pre-lttri 10263  ax-pre-lttrn 10264  ax-pre-ltadd 10265  ax-pre-mulgt0 10266
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3or 1108  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ne 2938  df-nel 3041  df-ral 3060  df-rex 3061  df-reu 3062  df-rab 3064  df-v 3352  df-sbc 3597  df-csb 3692  df-dif 3735  df-un 3737  df-in 3739  df-ss 3746  df-pss 3748  df-nul 4080  df-if 4244  df-pw 4317  df-sn 4335  df-pr 4337  df-tp 4339  df-op 4341  df-uni 4595  df-iun 4678  df-br 4810  df-opab 4872  df-mpt 4889  df-tr 4912  df-id 5185  df-eprel 5190  df-po 5198  df-so 5199  df-fr 5236  df-we 5238  df-xp 5283  df-rel 5284  df-cnv 5285  df-co 5286  df-dm 5287  df-rn 5288  df-res 5289  df-ima 5290  df-pred 5865  df-ord 5911  df-on 5912  df-lim 5913  df-suc 5914  df-iota 6031  df-fun 6070  df-fn 6071  df-f 6072  df-f1 6073  df-fo 6074  df-f1o 6075  df-fv 6076  df-riota 6803  df-ov 6845  df-oprab 6846  df-mpt2 6847  df-om 7264  df-wrecs 7610  df-recs 7672  df-rdg 7710  df-er 7947  df-map 8062  df-en 8161  df-dom 8162  df-sdom 8163  df-pnf 10330  df-mnf 10331  df-xr 10332  df-ltxr 10333  df-le 10334  df-sub 10522  df-neg 10523  df-nn 11275  df-2 11335  df-ndx 16135  df-slot 16136  df-base 16138  df-sets 16139  df-plusg 16229  df-sgrp 17552  df-ghm 17924  df-abl 18462  df-mgp 18757  df-mgmhm 42380  df-rng0 42476  df-rnghomo 42488
This theorem is referenced by:  rnghmmgmhm  42495  rnghmval2  42496  rnghmf1o  42504  rnghmco  42508  idrnghm  42509  c0rnghm  42514  rhmisrnghm  42521
  Copyright terms: Public domain W3C validator