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 41683
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 2610 . . 3 (Base‘𝑅) = (Base‘𝑅)
2 eqid 2610 . . 3 (.r𝑅) = (.r𝑅)
3 eqid 2610 . . 3 (.r𝑆) = (.r𝑆)
41, 2, 3isrnghm 41682 . 2 (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
5 isrnghmmul.m . . . . . . . . . . 11 𝑀 = (mulGrp‘𝑅)
65rngmgp 41668 . . . . . . . . . 10 (𝑅 ∈ Rng → 𝑀 ∈ SGrp)
7 sgrpmgm 17112 . . . . . . . . . 10 (𝑀 ∈ SGrp → 𝑀 ∈ Mgm)
86, 7syl 17 . . . . . . . . 9 (𝑅 ∈ Rng → 𝑀 ∈ Mgm)
9 isrnghmmul.n . . . . . . . . . . 11 𝑁 = (mulGrp‘𝑆)
109rngmgp 41668 . . . . . . . . . 10 (𝑆 ∈ Rng → 𝑁 ∈ SGrp)
11 sgrpmgm 17112 . . . . . . . . . 10 (𝑁 ∈ SGrp → 𝑁 ∈ Mgm)
1210, 11syl 17 . . . . . . . . 9 (𝑆 ∈ Rng → 𝑁 ∈ Mgm)
138, 12anim12i 588 . . . . . . . 8 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → (𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm))
14 eqid 2610 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
151, 14ghmf 17487 . . . . . . . 8 (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
1613, 15anim12i 588 . . . . . . 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 679 . . . . . 6 ((((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ 𝐹:(Base‘𝑅)⟶(Base‘𝑆)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
1917, 18syl6bb 275 . . . . 5 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))))))
205, 1mgpbas 18318 . . . . . 6 (Base‘𝑅) = (Base‘𝑀)
219, 14mgpbas 18318 . . . . . 6 (Base‘𝑆) = (Base‘𝑁)
225, 2mgpplusg 18316 . . . . . 6 (.r𝑅) = (+g𝑀)
239, 3mgpplusg 18316 . . . . . 6 (.r𝑆) = (+g𝑁)
2420, 21, 22, 23ismgmhm 41573 . . . . 5 (𝐹 ∈ (𝑀 MgmHom 𝑁) ↔ ((𝑀 ∈ Mgm ∧ 𝑁 ∈ Mgm) ∧ (𝐹:(Base‘𝑅)⟶(Base‘𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))))
2519, 24syl6bbr 277 . . . 4 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ 𝐹 ∈ (𝑅 GrpHom 𝑆)) → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)) ↔ 𝐹 ∈ (𝑀 MgmHom 𝑁)))
2625pm5.32da 671 . . 3 ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) → ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
2726pm5.32i 667 . 2 (((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝐹‘(𝑥(.r𝑅)𝑦)) = ((𝐹𝑥)(.r𝑆)(𝐹𝑦)))) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
284, 27bitri 263 1 (𝐹 ∈ (𝑅 RngHomo 𝑆) ↔ ((𝑅 ∈ Rng ∧ 𝑆 ∈ Rng) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MgmHom 𝑁))))
Colors of variables: wff setvar class
Syntax hints:  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  wf 5800  cfv 5804  (class class class)co 6549  Basecbs 15695  .rcmulr 15769  Mgmcmgm 17063  SGrpcsgrp 17106   GrpHom cghm 17480  mulGrpcmgp 18312   MgmHom cmgmhm 41567  Rngcrng 41664   RngHomo crngh 41675
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-ndx 15698  df-slot 15699  df-base 15700  df-sets 15701  df-plusg 15781  df-sgrp 17107  df-ghm 17481  df-abl 18019  df-mgp 18313  df-mgmhm 41569  df-rng0 41665  df-rnghomo 41677
This theorem is referenced by:  rnghmmgmhm  41684  rnghmval2  41685  rnghmf1o  41693  rnghmco  41697  idrnghm  41698  c0rnghm  41703  rhmisrnghm  41710
  Copyright terms: Public domain W3C validator