| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isrhm | GIF version | ||
| Description: A function is a ring homomorphism iff it preserves both addition and multiplication. (Contributed by Stefan O'Rear, 7-Mar-2015.) |
| Ref | Expression |
|---|---|
| isrhm.m | ⊢ 𝑀 = (mulGrp‘𝑅) |
| isrhm.n | ⊢ 𝑁 = (mulGrp‘𝑆) |
| Ref | Expression |
|---|---|
| isrhm | ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrhm2 14077 | . . 3 ⊢ RingHom = (𝑟 ∈ Ring, 𝑠 ∈ Ring ↦ ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠)))) | |
| 2 | 1 | elmpocl 6166 | . 2 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑅 ∈ Ring ∧ 𝑆 ∈ Ring)) |
| 3 | ringgrp 13924 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 4 | ringgrp 13924 | . . . . . . 7 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ Grp) | |
| 5 | ghmex 13752 | . . . . . . 7 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → (𝑅 GrpHom 𝑆) ∈ V) | |
| 6 | 3, 4, 5 | syl2an 289 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 GrpHom 𝑆) ∈ V) |
| 7 | inex1g 4197 | . . . . . 6 ⊢ ((𝑅 GrpHom 𝑆) ∈ V → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) | |
| 8 | 6, 7 | syl 14 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) |
| 9 | oveq12 5978 | . . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑟 GrpHom 𝑠) = (𝑅 GrpHom 𝑆)) | |
| 10 | fveq2 5600 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅)) | |
| 11 | fveq2 5600 | . . . . . . . 8 ⊢ (𝑠 = 𝑆 → (mulGrp‘𝑠) = (mulGrp‘𝑆)) | |
| 12 | 10, 11 | oveqan12d 5988 | . . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠)) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) |
| 13 | 9, 12 | ineq12d 3384 | . . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠))) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
| 14 | 13, 1 | ovmpoga 6100 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring ∧ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
| 15 | 8, 14 | mpd3an3 1351 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
| 16 | 15 | eleq2d 2277 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ 𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))) |
| 17 | elin 3365 | . . . 4 ⊢ (𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) | |
| 18 | isrhm.m | . . . . . . . 8 ⊢ 𝑀 = (mulGrp‘𝑅) | |
| 19 | isrhm.n | . . . . . . . 8 ⊢ 𝑁 = (mulGrp‘𝑆) | |
| 20 | 18, 19 | oveq12i 5981 | . . . . . . 7 ⊢ (𝑀 MndHom 𝑁) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) |
| 21 | 20 | eqcomi 2211 | . . . . . 6 ⊢ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) = (𝑀 MndHom 𝑁) |
| 22 | 21 | eleq2i 2274 | . . . . 5 ⊢ (𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) ↔ 𝐹 ∈ (𝑀 MndHom 𝑁)) |
| 23 | 22 | anbi2i 457 | . . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁))) |
| 24 | 17, 23 | bitri 184 | . . 3 ⊢ (𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁))) |
| 25 | 16, 24 | bitrdi 196 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁)))) |
| 26 | 2, 25 | biadanii 613 | 1 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ (𝑀 MndHom 𝑁)))) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2178 Vcvv 2777 ∩ cin 3174 ‘cfv 5291 (class class class)co 5969 MndHom cmhm 13450 Grpcgrp 13493 GrpHom cghm 13737 mulGrpcmgp 13843 Ringcrg 13919 RingHom crh 14073 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4176 ax-sep 4179 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-setind 4604 ax-cnex 8053 ax-resscn 8054 ax-1cn 8055 ax-1re 8056 ax-icn 8057 ax-addcl 8058 ax-addrcl 8059 ax-mulcl 8060 ax-addcom 8062 ax-addass 8064 ax-i2m1 8067 ax-0lt1 8068 ax-0id 8070 ax-rnegex 8071 ax-pre-ltirr 8074 ax-pre-ltadd 8078 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2779 df-sbc 3007 df-csb 3103 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-nul 3470 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-iun 3944 df-br 4061 df-opab 4123 df-mpt 4124 df-id 4359 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-ima 4707 df-iota 5252 df-fun 5293 df-fn 5294 df-f 5295 df-f1 5296 df-fo 5297 df-f1o 5298 df-fv 5299 df-riota 5924 df-ov 5972 df-oprab 5973 df-mpo 5974 df-1st 6251 df-2nd 6252 df-map 6762 df-pnf 8146 df-mnf 8147 df-ltxr 8149 df-inn 9074 df-2 9132 df-3 9133 df-ndx 12996 df-slot 12997 df-base 12999 df-sets 13000 df-plusg 13083 df-mulr 13084 df-0g 13251 df-mgm 13349 df-sgrp 13395 df-mnd 13410 df-mhm 13452 df-grp 13496 df-ghm 13738 df-mgp 13844 df-ur 13883 df-ring 13921 df-rhm 14075 |
| This theorem is referenced by: rhmmhm 14082 rhmghm 14085 isrhm2d 14088 rhmf1o 14091 rhmco 14097 resrhm 14171 resrhm2b 14172 rhmpropd 14177 |
| Copyright terms: Public domain | W3C validator |