ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isrhm GIF version

Theorem isrhm 14116
Description: A function is a ring homomorphism iff it preserves both addition and multiplication. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Hypotheses
Ref Expression
isrhm.m 𝑀 = (mulGrp‘𝑅)
isrhm.n 𝑁 = (mulGrp‘𝑆)
Assertion
Ref Expression
isrhm (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁))))

Proof of Theorem isrhm
Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfrhm2 14112 . . 3 RingHom = (𝑟 ∈ Ring, 𝑠 ∈ Ring ↦ ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠))))
21elmpocl 6199 . 2 (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑅 ∈ Ring ∧ 𝑆 ∈ Ring))
3 ringgrp 13959 . . . . . . 7 (𝑅 ∈ Ring → 𝑅 ∈ Grp)
4 ringgrp 13959 . . . . . . 7 (𝑆 ∈ Ring → 𝑆 ∈ Grp)
5 ghmex 13787 . . . . . . 7 ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → (𝑅 GrpHom 𝑆) ∈ V)
63, 4, 5syl2an 289 . . . . . 6 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 GrpHom 𝑆) ∈ V)
7 inex1g 4219 . . . . . 6 ((𝑅 GrpHom 𝑆) ∈ V → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V)
86, 7syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V)
9 oveq12 6009 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑟 GrpHom 𝑠) = (𝑅 GrpHom 𝑆))
10 fveq2 5626 . . . . . . . 8 (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅))
11 fveq2 5626 . . . . . . . 8 (𝑠 = 𝑆 → (mulGrp‘𝑠) = (mulGrp‘𝑆))
1210, 11oveqan12d 6019 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠)) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))
139, 12ineq12d 3406 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠))) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))
1413, 1ovmpoga 6133 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring ∧ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))
158, 14mpd3an3 1372 . . . 4 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))
1615eleq2d 2299 . . 3 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ 𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))))
17 elin 3387 . . . 4 (𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))
18 isrhm.m . . . . . . . 8 𝑀 = (mulGrp‘𝑅)
19 isrhm.n . . . . . . . 8 𝑁 = (mulGrp‘𝑆)
2018, 19oveq12i 6012 . . . . . . 7 (𝑀 MndHom 𝑁) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))
2120eqcomi 2233 . . . . . 6 ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) = (𝑀 MndHom 𝑁)
2221eleq2i 2296 . . . . 5 (𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) ↔ 𝐹 ∈ (𝑀 MndHom 𝑁))
2322anbi2i 457 . . . 4 ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁)))
2417, 23bitri 184 . . 3 (𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁)))
2516, 24bitrdi 196 . 2 ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁))))
262, 25biadanii 615 1 (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁))))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1395  wcel 2200  Vcvv 2799  cin 3196  cfv 5317  (class class class)co 6000   MndHom cmhm 13485  Grpcgrp 13528   GrpHom cghm 13772  mulGrpcmgp 13878  Ringcrg 13954   RingHom crh 14108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-3 9166  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-plusg 13118  df-mulr 13119  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-mhm 13487  df-grp 13531  df-ghm 13773  df-mgp 13879  df-ur 13918  df-ring 13956  df-rhm 14110
This theorem is referenced by:  rhmmhm  14117  rhmghm  14120  isrhm2d  14123  rhmf1o  14126  rhmco  14132  resrhm  14206  resrhm2b  14207  rhmpropd  14212
  Copyright terms: Public domain W3C validator