Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mhmfmhm | GIF version |
Description: The function fulfilling the conditions of mhmmnd 12836 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 12836 | . 2 ⊢ (𝜑 → 𝐻 ∈ Mnd) |
9 | fof 5427 | . . . 4 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹:𝑋⟶𝑌) | |
10 | 7, 9 | syl 14 | . . 3 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌) |
11 | 2 | 3expb 1202 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
12 | 11 | ralrimivva 2555 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))) |
13 | eqid 2173 | . . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
14 | 2, 3, 4, 5, 6, 7, 1, 13 | mhmid 12835 | . . 3 ⊢ (𝜑 → (𝐹‘(0g‘𝐺)) = (0g‘𝐻)) |
15 | 10, 12, 14 | 3jca 1175 | . 2 ⊢ (𝜑 → (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝐺)) = (0g‘𝐻))) |
16 | eqid 2173 | . . 3 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
17 | 3, 4, 5, 6, 13, 16 | ismhm 12712 | . 2 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) ↔ ((𝐺 ∈ Mnd ∧ 𝐻 ∈ Mnd) ∧ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝐺)) = (0g‘𝐻)))) |
18 | 1, 8, 15, 17 | syl21anbrc 1180 | 1 ⊢ (𝜑 → 𝐹 ∈ (𝐺 MndHom 𝐻)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 976 = wceq 1351 ∈ wcel 2144 ∀wral 2451 ⟶wf 5201 –onto→wfo 5203 ‘cfv 5205 (class class class)co 5862 Basecbs 12425 +gcplusg 12489 0gc0g 12623 Mndcmnd 12679 MndHom cmhm 12708 |
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 612 ax-in2 613 ax-io 707 ax-5 1443 ax-7 1444 ax-gen 1445 ax-ie1 1489 ax-ie2 1490 ax-8 1500 ax-10 1501 ax-11 1502 ax-i12 1503 ax-bndl 1505 ax-4 1506 ax-17 1522 ax-i9 1526 ax-ial 1530 ax-i5r 1531 ax-13 2146 ax-14 2147 ax-ext 2155 ax-sep 4113 ax-pow 4166 ax-pr 4200 ax-un 4424 ax-setind 4527 ax-cnex 7874 ax-resscn 7875 ax-1re 7877 ax-addrcl 7880 |
This theorem depends on definitions: df-bi 117 df-3an 978 df-tru 1354 df-fal 1357 df-nf 1457 df-sb 1759 df-eu 2025 df-mo 2026 df-clab 2160 df-cleq 2166 df-clel 2169 df-nfc 2304 df-ne 2344 df-ral 2456 df-rex 2457 df-reu 2458 df-rmo 2459 df-rab 2460 df-v 2735 df-sbc 2959 df-csb 3053 df-dif 3126 df-un 3128 df-in 3130 df-ss 3137 df-pw 3571 df-sn 3592 df-pr 3593 df-op 3595 df-uni 3803 df-int 3838 df-iun 3881 df-br 3996 df-opab 4057 df-mpt 4058 df-id 4284 df-xp 4623 df-rel 4624 df-cnv 4625 df-co 4626 df-dm 4627 df-rn 4628 df-res 4629 df-ima 4630 df-iota 5167 df-fun 5207 df-fn 5208 df-f 5209 df-fo 5211 df-fv 5213 df-riota 5818 df-ov 5865 df-oprab 5866 df-mpo 5867 df-1st 6128 df-2nd 6129 df-map 6637 df-inn 8888 df-2 8946 df-ndx 12428 df-slot 12429 df-base 12431 df-plusg 12502 df-0g 12625 df-mgm 12637 df-sgrp 12670 df-mnd 12680 df-mhm 12710 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |