| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rhm1 | Structured version Visualization version GIF version | ||
| Description: Ring homomorphisms are required to fix 1. (Contributed by Stefan O'Rear, 8-Mar-2015.) |
| Ref | Expression |
|---|---|
| rhm1.o | ⊢ 1 = (1r‘𝑅) |
| rhm1.n | ⊢ 𝑁 = (1r‘𝑆) |
| Ref | Expression |
|---|---|
| rhm1 | ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘ 1 ) = 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2762 | . . . 4 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 2 | eqid 2762 | . . . 4 ⊢ (mulGrp‘𝑆) = (mulGrp‘𝑆) | |
| 3 | 1, 2 | rhmmhm 20569 | . . 3 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆))) |
| 4 | eqid 2762 | . . . 4 ⊢ (0g‘(mulGrp‘𝑅)) = (0g‘(mulGrp‘𝑅)) | |
| 5 | eqid 2762 | . . . 4 ⊢ (0g‘(mulGrp‘𝑆)) = (0g‘(mulGrp‘𝑆)) | |
| 6 | 4, 5 | mhm0 18858 | . . 3 ⊢ (𝐹 ∈ ((mulGrp‘𝑅) MndHom (mulGrp‘𝑆)) → (𝐹‘(0g‘(mulGrp‘𝑅))) = (0g‘(mulGrp‘𝑆))) |
| 7 | 3, 6 | syl 18 | . 2 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘(0g‘(mulGrp‘𝑅))) = (0g‘(mulGrp‘𝑆))) |
| 8 | rhm1.o | . . . 4 ⊢ 1 = (1r‘𝑅) | |
| 9 | 1, 8 | ringidval 20271 | . . 3 ⊢ 1 = (0g‘(mulGrp‘𝑅)) |
| 10 | 9 | fveq2i 6884 | . 2 ⊢ (𝐹‘ 1 ) = (𝐹‘(0g‘(mulGrp‘𝑅))) |
| 11 | rhm1.n | . . 3 ⊢ 𝑁 = (1r‘𝑆) | |
| 12 | 2, 11 | ringidval 20271 | . 2 ⊢ 𝑁 = (0g‘(mulGrp‘𝑆)) |
| 13 | 7, 10, 12 | 3eqtr4g 2822 | 1 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘ 1 ) = 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ‘cfv 6536 (class class class)co 7412 0gc0g 17498 MndHom cmhm 18845 mulGrpcmgp 20222 1rcur 20269 RingHom crh 20558 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-sets 17230 df-slot 17248 df-ndx 17260 df-base 17276 df-plusg 17329 df-0g 17500 df-mhm 18847 df-ghm 19290 df-mgp 20223 df-ur 20270 df-ring 20323 df-rhm 20561 |
| This theorem is used by: rhmopp 20617 elrhmunit 20618 rhmunitinv 20619 nrhmzr 20647 srng1 20967 rhmqusnsg 21436 rhmpreimaprmidl 21490 mulgrhm2 21639 zrh1 21673 mplind 22232 evlslem1 22244 rhmmpl 22551 rhmply1vr1 22555 cpmidgsumm2pm 23037 lgsqrlem1 27521 fxpsubrg 33503 ricnzr1 33617 kerunit 33654 rhmquskerlem 33742 rhmzrhval 42767 fldhmf1 42885 aks5lem2 42982 ricdrng1 43324 rhmpsr 43343 |
| Copyright terms: Public domain | W3C validator |