ghmlin - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ghmlin		Structured version Visualization version GIF version

Theorem ghmlin 19168

Description: A homomorphism of groups is linear. (Contributed by Stefan O'Rear, 31-Dec-2014.)

**Hypotheses**
Ref	Expression
ghmlin.x	⊢ 𝑋 = (Base‘𝑆)
ghmlin.a	⊢ + = (+_g‘𝑆)
ghmlin.b	⊢ ⨣ = (+_g‘𝑇)

**Assertion**
Ref	Expression
ghmlin	⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))

Proof of Theorem ghmlin Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ghmlin.x	. . . . . 6 ⊢ 𝑋 = (Base‘𝑆)
2		eqid 2728	. . . . . 6 ⊢ (Base‘𝑇) = (Base‘𝑇)
3		ghmlin.a	. . . . . 6 ⊢ + = (+_g‘𝑆)
4		ghmlin.b	. . . . . 6 ⊢ ⨣ = (+_g‘𝑇)
5	1, 2, 3, 4	isghm 19163	. . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)))))
6	5	simprbi 496	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋⟶(Base‘𝑇) ∧ ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏))))
7	6	simprd 495	. . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → ∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)))
8		fvoveq1 7437	. . . . 5 ⊢ (𝑎 = 𝑈 → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑈 + 𝑏)))
9		fveq2 6891	. . . . . 6 ⊢ (𝑎 = 𝑈 → (𝐹‘𝑎) = (𝐹‘𝑈))
10	9	oveq1d 7429	. . . . 5 ⊢ (𝑎 = 𝑈 → ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)))
11	8, 10	eqeq12d 2744	. . . 4 ⊢ (𝑎 = 𝑈 → ((𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏))))
12		oveq2 7422	. . . . . 6 ⊢ (𝑏 = 𝑉 → (𝑈 + 𝑏) = (𝑈 + 𝑉))
13	12	fveq2d 6895	. . . . 5 ⊢ (𝑏 = 𝑉 → (𝐹‘(𝑈 + 𝑏)) = (𝐹‘(𝑈 + 𝑉)))
14		fveq2 6891	. . . . . 6 ⊢ (𝑏 = 𝑉 → (𝐹‘𝑏) = (𝐹‘𝑉))
15	14	oveq2d 7430	. . . . 5 ⊢ (𝑏 = 𝑉 → ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))
16	13, 15	eqeq12d 2744	. . . 4 ⊢ (𝑏 = 𝑉 → ((𝐹‘(𝑈 + 𝑏)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑏)) ↔ (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))))
17	11, 16	rspc2v 3619	. . 3 ⊢ ((𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (∀𝑎 ∈ 𝑋 ∀𝑏 ∈ 𝑋 (𝐹‘(𝑎 + 𝑏)) = ((𝐹‘𝑎) ⨣ (𝐹‘𝑏)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉))))
18	7, 17	mpan9 506	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋)) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))
19	18	3impb 1113	1 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ 𝑋 ∧ 𝑉 ∈ 𝑋) → (𝐹‘(𝑈 + 𝑉)) = ((𝐹‘𝑈) ⨣ (𝐹‘𝑉)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ∀wral 3057 ⟶wf 6538 ‘cfv 6542 (class class class)co 7414 Basecbs 17173 +_gcplusg 17226 Grpcgrp 18883 GrpHom cghm 19160

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7417 df-oprab 7418 df-mpo 7419 df-ghm 19161

This theorem is referenced by: ghmid 19169 ghminv 19170 ghmsub 19171 ghmmhm 19173 ghmrn 19176 resghm 19179 ghmpreima 19185 ghmnsgima 19187 ghmnsgpreima 19188 ghmf1o 19195 ghmquskerlem1 19227 ghmquskerlem3 19230 lactghmga 19353 invghm 19781 ghmplusg 19794 rhmopp 20441 srngadd 20730 islmhm2 20916 cygznlem3 21496 psgnco 21508 evpmodpmf1o 21521 ipdir 21564 evlslem1 22021 mpfind 22046 evl1addd 22253 mdetralt 22503 cpmatacl 22611 mat2pmatghm 22625 ghmcnp 24012 ply1rem 26093 dchrptlem2 27191 abliso 32750 ghmqusnsglem1 33123 ghmqusnsg 33125 rhmpreimaidl 33127 rhmimaidl 33142 r1pquslmic 33271 dimkerim 33315 qqhghm 33583 qqhrhm 33584 fldhmf1 41555 aks6d1c1p3 41575 aks6d1c5lem1 41601 aks6d1c5lem2 41603 evlsaddval 41795 evladdval 41802 gicabl 42517

W3C validator

	
		OSZAR »