Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mgmhmlin | Structured version Visualization version GIF version |
Description: A magma homomorphism preserves the binary operation. (Contributed by AV, 25-Feb-2020.) |
Ref | Expression |
---|---|
mgmhmlin.b | ⊢ 𝐵 = (Base‘𝑆) |
mgmhmlin.p | ⊢ + = (+g‘𝑆) |
mgmhmlin.q | ⊢ ⨣ = (+g‘𝑇) |
Ref | Expression |
---|---|
mgmhmlin | ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mgmhmlin.b | . . . 4 ⊢ 𝐵 = (Base‘𝑆) | |
2 | eqid 2823 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
3 | mgmhmlin.p | . . . 4 ⊢ + = (+g‘𝑆) | |
4 | mgmhmlin.q | . . . 4 ⊢ ⨣ = (+g‘𝑇) | |
5 | 1, 2, 3, 4 | ismgmhm 44057 | . . 3 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))) |
6 | fvoveq1 7181 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦))) | |
7 | fveq2 6672 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
8 | 7 | oveq1d 7173 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦))) |
9 | 6, 8 | eqeq12d 2839 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)))) |
10 | oveq2 7166 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌)) | |
11 | 10 | fveq2d 6676 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌))) |
12 | fveq2 6672 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌)) | |
13 | 12 | oveq2d 7174 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
14 | 11, 13 | eqeq12d 2839 | . . . . . 6 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
15 | 9, 14 | rspc2v 3635 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
16 | 15 | com12 32 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
17 | 16 | ad2antll 727 | . . 3 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
18 | 5, 17 | sylbi 219 | . 2 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
19 | 18 | 3impib 1112 | 1 ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 +gcplusg 16567 Mgmcmgm 17852 MgmHom cmgmhm 44051 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-map 8410 df-mgmhm 44053 |
This theorem is referenced by: mgmhmf1o 44061 resmgmhm 44072 resmgmhm2 44073 resmgmhm2b 44074 mgmhmco 44075 mgmhmima 44076 mgmhmeql 44077 |
Copyright terms: Public domain | W3C validator |