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

Theorem isrnghmmul 20385
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 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))

Proof of Theorem isrnghmmul
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2725 . . 3 (Base‘𝑅) = (Base‘𝑅)
2 eqid 2725 . . 3 (.r𝑅) = (.r𝑅)
3 eqid 2725 . . 3 (.r𝑆) = (.r𝑆)
41, 2, 3isrnghm 20384 . 2 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
5 isrnghmmul.m . . . . . . . . . . 11 𝑀 = (mulGrp‘𝑅)
65rngmgp 20100 . . . . . . . . . 10 (𝑅 ∈ Rng → 𝑀 ∈ Smgrp)
7 sgrpmgm 18683 . . . . . . . . . 10 (𝑀 ∈ Smgrp → 𝑀 ∈ Mgm)
86, 7syl 17 . . . . . . . . 9 (𝑅 ∈ Rng → 𝑀 ∈ Mgm)
9 isrnghmmul.n . . . . . . . . . . 11 𝑁 = (mulGrp‘𝑆)
109rngmgp 20100 . . . . . . . . . 10 (𝑆 ∈ Rng → 𝑁 ∈ Smgrp)
11 sgrpmgm 18683 . . . . . . . . . 10 (𝑁 ∈ Smgrp → 𝑁 ∈ Mgm)
1210, 11syl 17 . . . . . . . . 9 (𝑆 ∈ Rng → 𝑁 ∈ Mgm)
138, 12anim12i 611 . . . . . . . 8 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm))
14 eqid 2725 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
151, 14ghmf 19178 . . . . . . . 8 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
1613, 15anim12i 611 . . . . . . 7 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)))
1716biantrurd 531 . . . . . 6 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ (((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
18 anass 467 . . . . . 6 ((((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
1917, 18bitrdi 286 . . . . 5 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))))))
205, 1mgpbas 20084 . . . . . 6 (Base‘𝑅) = (Base‘𝑀)
219, 14mgpbas 20084 . . . . . 6 (Base‘𝑆) = (Base‘𝑁)
225, 2mgpplusg 20082 . . . . . 6 (.r𝑅) = (+g𝑀)
239, 3mgpplusg 20082 . . . . . 6 (.r𝑆) = (+g𝑁)
2420, 21, 22, 23ismgmhm 18655 . . . . 5 (𝐹 ∈ (𝑀 MgmHom 𝑁) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
2519, 24bitr4di 288 . . . 4 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ 𝐹 ∈ (𝑀 MgmHom 𝑁)))
2625pm5.32da 577 . . 3 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
2726pm5.32i 573 . 2 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
284, 27bitri 274 1 (𝐹 ∈ (𝑅 RngHom 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 394   = wceq 1533  wcel 2098  wral 3051  wf 6539  cfv 6543  (class class class)co 7416  Basecbs 17179  .rcmulr 17233  Mgmcmgm 18597   MgmHom cmgmhm 18649  Smgrpcsgrp 18677   GrpHom cghm 19171  mulGrpcmgp 20078  Rngcrng 20096   RngHom crnghm 20377
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7738  ax-cnex 11194  ax-resscn 11195  ax-1cn 11196  ax-icn 11197  ax-addcl 11198  ax-addrcl 11199  ax-mulcl 11200  ax-mulrcl 11201  ax-mulcom 11202  ax-addass 11203  ax-mulass 11204  ax-distr 11205  ax-i2m1 11206  ax-1ne0 11207  ax-1rid 11208  ax-rnegex 11209  ax-rrecex 11210  ax-cnre 11211  ax-pre-lttri 11212  ax-pre-lttrn 11213  ax-pre-ltadd 11214  ax-pre-mulgt0 11215
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3465  df-sbc 3769  df-csb 3885  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-pss 3959  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5227  df-tr 5261  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7372  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7869  df-2nd 7992  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-er 8723  df-map 8845  df-en 8963  df-dom 8964  df-sdom 8965  df-pnf 11280  df-mnf 11281  df-xr 11282  df-ltxr 11283  df-le 11284  df-sub 11476  df-neg 11477  df-nn 12243  df-2 12305  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17180  df-plusg 17245  df-mgmhm 18651  df-sgrp 18678  df-ghm 19172  df-abl 19742  df-mgp 20079  df-rng 20097  df-rnghm 20379
This theorem is referenced by:  rnghmmgmhm  20386  rnghmval2  20387  rnghmf1o  20395  rnghmco  20400  idrnghm  20401  rhmisrnghm  20423  c0rnghm  20476
  Copyright terms: Public domain W3C validator