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

Theorem ghmeqker 18380
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 𝐵 = (Base‘𝑆)
ghmeqker.z 0 = (0g𝑇)
ghmeqker.k 𝐾 = (𝐹 “ { 0 })
ghmeqker.m = (-g𝑆)
Assertion
Ref Expression
ghmeqker ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝐹𝑈) = (𝐹𝑉) ↔ (𝑈 𝑉) ∈ 𝐾))

Proof of Theorem ghmeqker
StepHypRef Expression
1 ghmeqker.k . . . . 5 𝐾 = (𝐹 “ { 0 })
2 ghmeqker.z . . . . . . 7 0 = (0g𝑇)
32sneqi 4571 . . . . . 6 { 0 } = {(0g𝑇)}
43imaeq2i 5920 . . . . 5 (𝐹 “ { 0 }) = (𝐹 “ {(0g𝑇)})
51, 4eqtri 2843 . . . 4 𝐾 = (𝐹 “ {(0g𝑇)})
65eleq2i 2903 . . 3 ((𝑈 𝑉) ∈ 𝐾 ↔ (𝑈 𝑉) ∈ (𝐹 “ {(0g𝑇)}))
7 ghmeqker.b . . . . . . 7 𝐵 = (Base‘𝑆)
8 eqid 2820 . . . . . . 7 (Base‘𝑇) = (Base‘𝑇)
97, 8ghmf 18357 . . . . . 6 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝐵⟶(Base‘𝑇))
109ffnd 6508 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹 Fn 𝐵)
11103ad2ant1 1128 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → 𝐹 Fn 𝐵)
12 fniniseg 6823 . . . 4 (𝐹 Fn 𝐵 → ((𝑈 𝑉) ∈ (𝐹 “ {(0g𝑇)}) ↔ ((𝑈 𝑉) ∈ 𝐵 ∧ (𝐹‘(𝑈 𝑉)) = (0g𝑇))))
1311, 12syl 17 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝑈 𝑉) ∈ (𝐹 “ {(0g𝑇)}) ↔ ((𝑈 𝑉) ∈ 𝐵 ∧ (𝐹‘(𝑈 𝑉)) = (0g𝑇))))
146, 13syl5bb 285 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝑈 𝑉) ∈ 𝐾 ↔ ((𝑈 𝑉) ∈ 𝐵 ∧ (𝐹‘(𝑈 𝑉)) = (0g𝑇))))
15 ghmgrp1 18355 . . . . 5 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
16 ghmeqker.m . . . . . 6 = (-g𝑆)
177, 16grpsubcl 18174 . . . . 5 ((𝑆 ∈ Grp ∧ 𝑈𝐵𝑉𝐵) → (𝑈 𝑉) ∈ 𝐵)
1815, 17syl3an1 1158 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (𝑈 𝑉) ∈ 𝐵)
1918biantrurd 535 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝐹‘(𝑈 𝑉)) = (0g𝑇) ↔ ((𝑈 𝑉) ∈ 𝐵 ∧ (𝐹‘(𝑈 𝑉)) = (0g𝑇))))
20 eqid 2820 . . . . 5 (-g𝑇) = (-g𝑇)
217, 16, 20ghmsub 18361 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (𝐹‘(𝑈 𝑉)) = ((𝐹𝑈)(-g𝑇)(𝐹𝑉)))
2221eqeq1d 2822 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝐹‘(𝑈 𝑉)) = (0g𝑇) ↔ ((𝐹𝑈)(-g𝑇)(𝐹𝑉)) = (0g𝑇)))
2319, 22bitr3d 283 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (((𝑈 𝑉) ∈ 𝐵 ∧ (𝐹‘(𝑈 𝑉)) = (0g𝑇)) ↔ ((𝐹𝑈)(-g𝑇)(𝐹𝑉)) = (0g𝑇)))
24 ghmgrp2 18356 . . . 4 (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
25243ad2ant1 1128 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → 𝑇 ∈ Grp)
2693ad2ant1 1128 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → 𝐹:𝐵⟶(Base‘𝑇))
27 simp2 1132 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → 𝑈𝐵)
2826, 27ffvelrnd 6845 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (𝐹𝑈) ∈ (Base‘𝑇))
29 simp3 1133 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → 𝑉𝐵)
3026, 29ffvelrnd 6845 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (𝐹𝑉) ∈ (Base‘𝑇))
31 eqid 2820 . . . 4 (0g𝑇) = (0g𝑇)
328, 31, 20grpsubeq0 18180 . . 3 ((𝑇 ∈ Grp ∧ (𝐹𝑈) ∈ (Base‘𝑇) ∧ (𝐹𝑉) ∈ (Base‘𝑇)) → (((𝐹𝑈)(-g𝑇)(𝐹𝑉)) = (0g𝑇) ↔ (𝐹𝑈) = (𝐹𝑉)))
3325, 28, 30, 32syl3anc 1366 . 2 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → (((𝐹𝑈)(-g𝑇)(𝐹𝑉)) = (0g𝑇) ↔ (𝐹𝑈) = (𝐹𝑉)))
3414, 23, 333bitrrd 308 1 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈𝐵𝑉𝐵) → ((𝐹𝑈) = (𝐹𝑉) ↔ (𝑈 𝑉) ∈ 𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1082   = wceq 1536  wcel 2113  {csn 4560  ccnv 5547  cima 5551   Fn wfn 6343  wf 6344  cfv 6348  (class class class)co 7149  Basecbs 16478  0gc0g 16708  Grpcgrp 18098  -gcsg 18100   GrpHom cghm 18350
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 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-ral 3142  df-rex 3143  df-reu 3144  df-rmo 3145  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7107  df-ov 7152  df-oprab 7153  df-mpo 7154  df-1st 7682  df-2nd 7683  df-0g 16710  df-mgm 17847  df-sgrp 17896  df-mnd 17907  df-grp 18101  df-minusg 18102  df-sbg 18103  df-ghm 18351
This theorem is referenced by:  kerf1ghm  19492  kerf1hrmOLD  19493  kercvrlsm  39759
  Copyright terms: Public domain W3C validator