| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mhmfmhm | Structured version Visualization version GIF version | ||
| Description: The function fulfilling the conditions of mhmmnd 19324 is a monoid homomorphism. (Contributed by Thierry Arnoux, 26-Jan-2020.) |
| Ref | Expression |
|---|---|
| ghmgrp.f | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
| ghmgrp.x | ⊢ 𝑋 = (Base‘𝐺) |
| ghmgrp.y | ⊢ 𝑌 = (Base‘𝐻) |
| ghmgrp.p | ⊢ + = (+g‘𝐺) |
| ghmgrp.q | ⊢ ⨣ = (+g‘𝐻) |
| ghmgrp.1 | ⊢ (𝜑 → 𝐹:𝑋⟶onto𝑌) |
| mhmmnd.3 | ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| Ref | Expression |
|---|---|
| mhmfmhm | ⊢ (𝜑 → 𝐹 ∈ (𝐺 MndHom 𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mhmmnd.3 | . 2 ⊢ (𝜑 → 𝐺 ∈ Mnd) | |
| 2 | ghmgrp.f | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) | |
| 3 | ghmgrp.x | . . 3 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | ghmgrp.y | . . 3 ⊢ 𝑌 = (Base‘𝐻) | |
| 5 | ghmgrp.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 6 | ghmgrp.q | . . 3 ⊢ ⨣ = (+g‘𝐻) | |
| 7 | ghmgrp.1 | . . 3 ⊢ (𝜑 → 𝐹:𝑋⟶onto𝑌) | |
| 8 | 2, 3, 4, 5, 6, 7, 1 | mhmmnd 19324 | . 2 ⊢ (𝜑 → 𝐻 ∈ Mnd) |
| 9 | fof 6826 | . . . 4 ⊢ (𝐹:𝑋⟶onto𝑌 → 𝐹:𝑋⟶𝑌) | |
| 10 | 7, 9 | syl 18 | . . 3 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) |
| 11 | 2 | 3expb 1138 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
| 12 | 11 | ralrimivva 3209 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
| 13 | eqid 2763 | . . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 14 | 2, 3, 4, 5, 6, 7, 1, 13 | mhmid 19323 | . . 3 ⊢ (𝜑 → (𝐹‘(0g‘𝐺)) = (0g‘𝐻)) |
| 15 | 10, 12, 14 | 3jca 1146 | . 2 ⊢ (𝜑 → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝐺)) = (0g‘𝐻))) |
| 16 | eqid 2763 | . . 3 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 17 | 3, 4, 5, 6, 13, 16 | ismhm 19030 | . 2 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) ↔ ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝐺)) = (0g‘𝐻)))) |
| 18 | 1, 8, 15, 17 | syl21anbrc 1363 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝐺 MndHom 𝐻)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⟶wf 6562 ⟶ontowfo 6564 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 +gcplusg 17472 0gc0g 17660 Mndcmnd 18973 MndHom cmhm 19026 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fo 6572 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-map 8887 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-mhm 19028 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |