![]() |
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 13521 | . . 3 ⊢ RingHom = (𝑟 ∈ Ring, 𝑠 ∈ Ring ↦ ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠)))) | |
2 | 1 | elmpocl 6092 | . 2 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑅 ∈ Ring ∧ 𝑆 ∈ Ring)) |
3 | ringgrp 13372 | . . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
4 | ringgrp 13372 | . . . . . . 7 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ Grp) | |
5 | ghmex 13211 | . . . . . . 7 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → (𝑅 GrpHom 𝑆) ∈ V) | |
6 | 3, 4, 5 | syl2an 289 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 GrpHom 𝑆) ∈ V) |
7 | inex1g 4154 | . . . . . 6 ⊢ ((𝑅 GrpHom 𝑆) ∈ V → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) | |
8 | 6, 7 | syl 14 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) |
9 | oveq12 5906 | . . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑟 GrpHom 𝑠) = (𝑅 GrpHom 𝑆)) | |
10 | fveq2 5534 | . . . . . . . 8 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅)) | |
11 | fveq2 5534 | . . . . . . . 8 ⊢ (𝑠 = 𝑆 → (mulGrp‘𝑠) = (mulGrp‘𝑆)) | |
12 | 10, 11 | oveqan12d 5916 | . . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠)) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) |
13 | 9, 12 | ineq12d 3352 | . . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ((𝑟 GrpHom 𝑠) ∩ ((mulGrp‘𝑟) MndHom (mulGrp‘𝑠))) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
14 | 13, 1 | ovmpoga 6027 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring ∧ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ∈ V) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
15 | 8, 14 | mpd3an3 1349 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝑅 RingHom 𝑆) = ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) |
16 | 15 | eleq2d 2259 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑆 ∈ Ring) → (𝐹 ∈ (𝑅 RingHom 𝑆) ↔ 𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))))) |
17 | elin 3333 | . . . 4 ⊢ (𝐹 ∈ ((𝑅 GrpHom 𝑆) ∩ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)))) | |
18 | isrhm.m | . . . . . . . 8 ⊢ 𝑀 = (mulGrp‘𝑅) | |
19 | isrhm.n | . . . . . . . 8 ⊢ 𝑁 = (mulGrp‘𝑆) | |
20 | 18, 19 | oveq12i 5909 | . . . . . . 7 ⊢ (𝑀 MndHom 𝑁) = ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) |
21 | 20 | eqcomi 2193 | . . . . . 6 ⊢ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) = (𝑀 MndHom 𝑁) |
22 | 21 | eleq2i 2256 | . . . . 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 1364 ∈ wcel 2160 Vcvv 2752 ∩ cin 3143 ‘cfv 5235 (class class class)co 5897 MndHom cmhm 12924 Grpcgrp 12960 GrpHom cghm 13196 mulGrpcmgp 13291 Ringcrg 13367 RingHom crh 13517 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-cnex 7933 ax-resscn 7934 ax-1cn 7935 ax-1re 7936 ax-icn 7937 ax-addcl 7938 ax-addrcl 7939 ax-mulcl 7940 ax-addcom 7942 ax-addass 7944 ax-i2m1 7947 ax-0lt1 7948 ax-0id 7950 ax-rnegex 7951 ax-pre-ltirr 7954 ax-pre-ltadd 7958 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4311 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5852 df-ov 5900 df-oprab 5901 df-mpo 5902 df-1st 6166 df-2nd 6167 df-map 6677 df-pnf 8025 df-mnf 8026 df-ltxr 8028 df-inn 8951 df-2 9009 df-3 9010 df-ndx 12518 df-slot 12519 df-base 12521 df-sets 12522 df-plusg 12605 df-mulr 12606 df-0g 12766 df-mgm 12835 df-sgrp 12880 df-mnd 12893 df-mhm 12926 df-grp 12963 df-ghm 13197 df-mgp 13292 df-ur 13331 df-ring 13369 df-rhm 13519 |
This theorem is referenced by: rhmmhm 13526 rhmghm 13529 isrhm2d 13532 rhmf1o 13535 rhmco 13541 |
Copyright terms: Public domain | W3C validator |