![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ghmlin | Structured version Visualization version GIF version |
Description: A homomorphism of groups is linear. (Contributed by Stefan O'Rear, 31-Dec-2014.) |
Ref | Expression |
---|---|
ghmlin.x | ⊢ 𝑋 = (Base‘𝑆) |
ghmlin.a | ⊢ + = (+g‘𝑆) |
ghmlin.b | ⊢ ⨣ = (+g‘𝑇) |
Ref | Expression |
---|---|
ghmlin | ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ghmlin.x | . . . . . 6 ⊢ 𝑋 = (Base‘𝑆) | |
2 | eqid 2731 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
3 | ghmlin.a | . . . . . 6 ⊢ + = (+g‘𝑆) | |
4 | ghmlin.b | . . . . . 6 ⊢ ⨣ = (+g‘𝑇) | |
5 | 1, 2, 3, 4 | isghm 19022 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏))))) |
6 | 5 | simprbi 497 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)))) |
7 | 6 | simprd 496 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏))) |
8 | fvoveq1 7385 | . . . . 5 ⊢ (𝑎 = 𝑈 → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑈 + 𝑏))) | |
9 | fveq2 6847 | . . . . . 6 ⊢ (𝑎 = 𝑈 → (𝐹‘𝑎) = (𝐹‘𝑈)) | |
10 | 9 | oveq1d 7377 | . . . . 5 ⊢ (𝑎 = 𝑈 → ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏))) |
11 | 8, 10 | eqeq12d 2747 | . . . 4 ⊢ (𝑎 = 𝑈 → ((𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)))) |
12 | oveq2 7370 | . . . . . 6 ⊢ (𝑏 = 𝑉 → (𝑈 + 𝑏) = (𝑈 + 𝑉)) | |
13 | 12 | fveq2d 6851 | . . . . 5 ⊢ (𝑏 = 𝑉 → (𝐹‘(𝑈 + 𝑏)) = (𝐹‘(𝑈 + 𝑉))) |
14 | fveq2 6847 | . . . . . 6 ⊢ (𝑏 = 𝑉 → (𝐹‘𝑏) = (𝐹‘𝑉)) | |
15 | 14 | oveq2d 7378 | . . . . 5 ⊢ (𝑏 = 𝑉 → ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
16 | 13, 15 | eqeq12d 2747 | . . . 4 ⊢ (𝑏 = 𝑉 → ((𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))) |
17 | 11, 16 | rspc2v 3591 | . . 3 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))) |
18 | 7, 17 | mpan9 507 | . 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
19 | 18 | 3impb 1115 | 1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3060 ⟶wf 6497 ‘cfv 6501 (class class class)co 7362 Basecbs 17094 +gcplusg 17147 Grpcgrp 18762 GrpHom cghm 19019 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5247 ax-sep 5261 ax-nul 5268 ax-pow 5325 ax-pr 5389 ax-un 7677 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3352 df-rab 3406 df-v 3448 df-sbc 3743 df-csb 3859 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-iun 4961 df-br 5111 df-opab 5173 df-mpt 5194 df-id 5536 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6453 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-fv 6509 df-ov 7365 df-oprab 7366 df-mpo 7367 df-ghm 19020 |
This theorem is referenced by: ghmid 19028 ghminv 19029 ghmsub 19030 ghmmhm 19032 ghmrn 19035 resghm 19038 ghmpreima 19044 ghmnsgima 19046 ghmnsgpreima 19047 ghmf1o 19052 lactghmga 19201 invghm 19626 ghmplusg 19638 rhmopp 20198 srngadd 20372 islmhm2 20556 cygznlem3 21013 psgnco 21024 evpmodpmf1o 21037 ipdir 21080 evlslem1 21529 mpfind 21554 evl1addd 21744 mdetralt 21994 cpmatacl 22102 mat2pmatghm 22116 ghmcnp 23503 ply1rem 25565 dchrptlem2 26650 abliso 31957 ghmquskerlem1 32269 ghmqusker 32272 rhmpreimaidl 32275 rhmimaidl 32282 dimkerim 32409 qqhghm 32658 qqhrhm 32659 fldhmf1 40620 evlsaddval 40808 evladdval 40811 gicabl 41484 |
Copyright terms: Public domain | W3C validator |