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 2736 | . . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
3 | ghmlin.a | . . . . . 6 ⊢ + = (+g‘𝑆) | |
4 | ghmlin.b | . . . . . 6 ⊢ ⨣ = (+g‘𝑇) | |
5 | 1, 2, 3, 4 | isghm 18879 | . . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏))))) |
6 | 5 | simprbi 498 | . . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)))) |
7 | 6 | simprd 497 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏))) |
8 | fvoveq1 7330 | . . . . 5 ⊢ (𝑎 = 𝑈 → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑈 + 𝑏))) | |
9 | fveq2 6804 | . . . . . 6 ⊢ (𝑎 = 𝑈 → (𝐹‘𝑎) = (𝐹‘𝑈)) | |
10 | 9 | oveq1d 7322 | . . . . 5 ⊢ (𝑎 = 𝑈 → ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏))) |
11 | 8, 10 | eqeq12d 2752 | . . . 4 ⊢ (𝑎 = 𝑈 → ((𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)))) |
12 | oveq2 7315 | . . . . . 6 ⊢ (𝑏 = 𝑉 → (𝑈 + 𝑏) = (𝑈 + 𝑉)) | |
13 | 12 | fveq2d 6808 | . . . . 5 ⊢ (𝑏 = 𝑉 → (𝐹‘(𝑈 + 𝑏)) = (𝐹‘(𝑈 + 𝑉))) |
14 | fveq2 6804 | . . . . . 6 ⊢ (𝑏 = 𝑉 → (𝐹‘𝑏) = (𝐹‘𝑉)) | |
15 | 14 | oveq2d 7323 | . . . . 5 ⊢ (𝑏 = 𝑉 → ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
16 | 13, 15 | eqeq12d 2752 | . . . 4 ⊢ (𝑏 = 𝑉 → ((𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))) |
17 | 11, 16 | rspc2v 3575 | . . 3 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))) |
18 | 7, 17 | mpan9 508 | . 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
19 | 18 | 3impb 1115 | 1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1087 = wceq 1539 ∈ wcel 2104 ∀wral 3062 ⟶wf 6454 ‘cfv 6458 (class class class)co 7307 Basecbs 16957 +gcplusg 17007 Grpcgrp 18622 GrpHom cghm 18876 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3286 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-id 5500 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-ghm 18877 |
This theorem is referenced by: ghmid 18885 ghminv 18886 ghmsub 18887 ghmmhm 18889 ghmrn 18892 resghm 18895 ghmpreima 18901 ghmnsgima 18903 ghmnsgpreima 18904 ghmf1o 18909 lactghmga 19058 invghm 19480 ghmplusg 19492 srngadd 20162 islmhm2 20345 cygznlem3 20822 psgnco 20833 evpmodpmf1o 20846 ipdir 20889 evlslem1 21337 mpfind 21362 evl1addd 21552 mdetralt 21802 cpmatacl 21910 mat2pmatghm 21924 ghmcnp 23311 ply1rem 25373 dchrptlem2 26458 abliso 31350 rhmopp 31563 rhmpreimaidl 31648 rhmimaidl 31654 dimkerim 31753 qqhghm 31983 qqhrhm 31984 evlsaddval 40314 gicabl 40962 |
Copyright terms: Public domain | W3C validator |