Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mhmlin | Structured version Visualization version GIF version |
Description: A monoid homomorphism commutes with composition. (Contributed by Mario Carneiro, 7-Mar-2015.) |
Ref | Expression |
---|---|
mhmlin.b | ⊢ 𝐵 = (Base‘𝑆) |
mhmlin.p | ⊢ + = (+g‘𝑆) |
mhmlin.q | ⊢ ⨣ = (+g‘𝑇) |
Ref | Expression |
---|---|
mhmlin | ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mhmlin.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑆) | |
2 | eqid 2622 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
3 | mhmlin.p | . . . . . 6 ⊢ + = (+g‘𝑆) | |
4 | mhmlin.q | . . . . . 6 ⊢ ⨣ = (+g‘𝑇) | |
5 | eqid 2622 | . . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
6 | eqid 2622 | . . . . . 6 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
7 | 1, 2, 3, 4, 5, 6 | ismhm 17337 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇)))) |
8 | 7 | simprbi 480 | . . . 4 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) |
9 | 8 | simp2d 1074 | . . 3 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
10 | oveq1 6657 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 + 𝑦) = (𝑋 + 𝑦)) | |
11 | 10 | fveq2d 6195 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦))) |
12 | fveq2 6191 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
13 | 12 | oveq1d 6665 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦))) |
14 | 11, 13 | eqeq12d 2637 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)))) |
15 | oveq2 6658 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌)) | |
16 | 15 | fveq2d 6195 | . . . . 5 ⊢ (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌))) |
17 | fveq2 6191 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌)) | |
18 | 17 | oveq2d 6666 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
19 | 16, 18 | eqeq12d 2637 | . . . 4 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
20 | 14, 19 | rspc2v 3322 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
21 | 9, 20 | syl5com 31 | . 2 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
22 | 21 | 3impib 1262 | 1 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 +gcplusg 15941 0gc0g 16100 Mndcmnd 17294 MndHom cmhm 17333 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-map 7859 df-mhm 17335 |
This theorem is referenced by: mhmf1o 17345 resmhm 17359 resmhm2 17360 resmhm2b 17361 mhmco 17362 mhmima 17363 mhmeql 17364 pwsco2mhm 17371 gsumwmhm 17382 mhmmulg 17583 ghmmhmb 17671 cntzmhm 17771 gsumzmhm 18337 rhmmul 18727 evlslem1 19515 mpfind 19536 mhmvlin 20203 mdetunilem7 20424 dchrzrhmul 24971 dchrmulcl 24974 dchrn0 24975 dchrinvcl 24978 dchrsum2 24993 sum2dchr 24999 mhmhmeotmd 29973 |
Copyright terms: Public domain | W3C validator |