| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 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 2737 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 3 | mgmhmlin.p | . . . 4 ⊢ + = (+g‘𝑆) | |
| 4 | mgmhmlin.q | . . . 4 ⊢ ⨣ = (+g‘𝑇) | |
| 5 | 1, 2, 3, 4 | ismgmhm 18655 | . . 3 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ ((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦))))) |
| 6 | fvoveq1 7383 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦))) | |
| 7 | fveq2 6834 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 8 | 7 | oveq1d 7375 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦))) |
| 9 | 6, 8 | eqeq12d 2753 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)))) |
| 10 | oveq2 7368 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌)) | |
| 11 | 10 | fveq2d 6838 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌))) |
| 12 | fveq2 6834 | . . . . . . . 8 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌)) | |
| 13 | 12 | oveq2d 7376 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
| 14 | 11, 13 | eqeq12d 2753 | . . . . . 6 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
| 15 | 9, 14 | rspc2v 3576 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
| 16 | 15 | com12 32 | . . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
| 17 | 16 | ad2antll 730 | . . 3 ⊢ (((𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm) ∧ (𝐹:𝐵⟶(Base‘𝑇) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) = ((𝐹‘𝑥) ⨣ (𝐹‘𝑦)))) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
| 18 | 5, 17 | sylbi 217 | . 2 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌)))) |
| 19 | 18 | 3impib 1117 | 1 ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑇) ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) = ((𝐹‘𝑋) ⨣ (𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 +gcplusg 17211 Mgmcmgm 18597 MgmHom cmgmhm 18649 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8768 df-mgmhm 18651 |
| This theorem is referenced by: mgmhmf1o 18659 resmgmhm 18670 resmgmhm2 18671 resmgmhm2b 18672 mgmhmco 18673 mgmhmima 18674 mgmhmeql 18675 |
| Copyright terms: Public domain | W3C validator |