Theorem ghmeqker 14076

Description: Two source points map to the same destination point under a group homomorphism iff their difference belongs to the kernel. (Contributed by Stefan O'Rear, 31-Dec-2014.)

Hypotheses

Ref	Expression
ghmeqker.b	|- B = ( Base ` S )
ghmeqker.z	|- .0. = ( 0g ` T )
ghmeqker.k	|- K = ( `' F " { .0. } )
ghmeqker.m	|- .- = ( -g ` S )

Assertion

Ref	Expression
ghmeqker	|- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( F ` U ) = ( F ` V ) <-> ( U .- V ) e. K ) )

Proof of Theorem ghmeqker

Step	Hyp	Ref	Expression
1		ghmeqker.k	. . . . 5 |- K = ( `' F " { .0. } )
2		ghmeqker.z	. . . . . . 7 |- .0. = ( 0g ` T )
3	2	sneqi 3721	. . . . . 6 |- { .0. } = { ( 0g ` T ) }
4	3	imaeq2i 5124	. . . . 5 |- ( `' F " { .0. } ) = ( `' F " { ( 0g ` T ) } )
5	1, 4	eqtri 2259	. . . 4 |- K = ( `' F " { ( 0g ` T ) } )
6	5	eleq2i 2305	. . 3 |- ( ( U .- V ) e. K <-> ( U .- V ) e. ( `' F " { ( 0g ` T ) } ) )
7		ghmeqker.b	. . . . . . 7 |- B = ( Base ` S )
8		eqid 2238	. . . . . . 7 |- ( Base ` T ) = ( Base ` T )
9	7, 8	ghmf 14052	. . . . . 6 |- ( F e. ( S GrpHom T ) -> F : B --> ( Base ` T ) )
10	9	ffnd 5534	. . . . 5 |- ( F e. ( S GrpHom T ) -> F Fn B )
11	10	3ad2ant1 1049	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> F Fn B )
12		fniniseg 5829	. . . 4 |- ( F Fn B -> ( ( U .- V ) e. ( `' F " { ( 0g ` T ) } ) <-> ( ( U .- V ) e. B /\ ( F ` ( U .- V ) ) = ( 0g ` T ) ) ) )
13	11, 12	syl 14	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( U .- V ) e. ( `' F " { ( 0g ` T ) } ) <-> ( ( U .- V ) e. B /\ ( F ` ( U .- V ) ) = ( 0g ` T ) ) ) )
14	6, 13	bitrid 192	. 2 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( U .- V ) e. K <-> ( ( U .- V ) e. B /\ ( F ` ( U .- V ) ) = ( 0g ` T ) ) ) )
15		ghmgrp1 14050	. . . . 5 |- ( F e. ( S GrpHom T ) -> S e. Grp )
16		ghmeqker.m	. . . . . 6 |- .- = ( -g ` S )
17	7, 16	grpsubcl 13887	. . . . 5 |- ( ( S e. Grp /\ U e. B /\ V e. B ) -> ( U .- V ) e. B )
18	15, 17	syl3an1 1311	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( U .- V ) e. B )
19	18	biantrurd 305	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( F ` ( U .- V ) ) = ( 0g ` T ) <-> ( ( U .- V ) e. B /\ ( F ` ( U .- V ) ) = ( 0g ` T ) ) ) )
20		eqid 2238	. . . . 5 |- ( -g ` T ) = ( -g ` T )
21	7, 16, 20	ghmsub 14056	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( F ` ( U .- V ) ) = ( ( F ` U ) ( -g ` T ) ( F ` V ) ) )
22	21	eqeq1d 2247	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( F ` ( U .- V ) ) = ( 0g ` T ) <-> ( ( F ` U ) ( -g ` T ) ( F ` V ) ) = ( 0g ` T ) ) )
23	19, 22	bitr3d 190	. 2 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( ( U .- V ) e. B /\ ( F ` ( U .- V ) ) = ( 0g ` T ) ) <-> ( ( F ` U ) ( -g ` T ) ( F ` V ) ) = ( 0g ` T ) ) )
24		ghmgrp2 14051	. . . 4 |- ( F e. ( S GrpHom T ) -> T e. Grp )
25	24	3ad2ant1 1049	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> T e. Grp )
26	9	3ad2ant1 1049	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> F : B --> ( Base ` T ) )
27		simp2 1029	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> U e. B )
28	26, 27	ffvelcdmd 5844	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( F ` U ) e. ( Base ` T ) )
29		simp3 1030	. . . 4 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> V e. B )
30	26, 29	ffvelcdmd 5844	. . 3 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( F ` V ) e. ( Base ` T ) )
31		eqid 2238	. . . 4 |- ( 0g ` T ) = ( 0g ` T )
32	8, 31, 20	grpsubeq0 13893	. . 3 |- ( ( T e. Grp /\ ( F ` U ) e. ( Base ` T ) /\ ( F ` V ) e. ( Base ` T ) ) -> ( ( ( F ` U ) ( -g ` T ) ( F ` V ) ) = ( 0g ` T ) <-> ( F ` U ) = ( F ` V ) ) )
33	25, 28, 30, 32	syl3anc 1278	. 2 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( ( F ` U ) ( -g ` T ) ( F ` V ) ) = ( 0g ` T ) <-> ( F ` U ) = ( F ` V ) ) )
34	14, 23, 33	3bitrrd 215	1 |- ( ( F e. ( S GrpHom T ) /\ U e. B /\ V e. B ) -> ( ( F ` U ) = ( F ` V ) <-> ( U .- V ) e. K ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   {csn 3709   `'ccnv 4773   "cima 4777   Fn wfn 5372   -->wf 5373   ` cfv 5377  (class class class)co 6085   Basecbs 13354   0gc0g 13612   Grpcgrp 13807   -gcsg 13809   GrpHom cghm 14045

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9306  df-2 9364  df-ndx 13357  df-slot 13358  df-base 13360  df-plusg 13446  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-minusg 13811  df-sbg 13812  df-ghm 14046

This theorem is used by:  kerf1ghm  14079