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

Theorem galcan 19569
Description: The action of a particular group element is left-cancelable. (Contributed by FL, 17-May-2010.) (Revised by Mario Carneiro, 13-Jan-2015.)
Hypothesis
Ref Expression
galcan.1 𝑋 = (Base‘𝐺)
Assertion
Ref Expression
galcan (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) ↔ 𝐵 = 𝐶))

Proof of Theorem galcan
StepHypRef Expression
1 oveq2 7459 . . 3 ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
2 simpl 488 . . . . . . . 8 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
3 gagrp 19557 . . . . . . . 8 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
42, 3syl 18 . . . . . . 7 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
5 simpr1 1213 . . . . . . 7 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
6 galcan.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
7 eqid 2763 . . . . . . . 8 (+g‘𝐺) = (+g‘𝐺)
8 eqid 2763 . . . . . . . 8 (0g‘𝐺) = (0g‘𝐺)
9 eqid 2763 . . . . . . . 8 (invg‘𝐺) = (invg‘𝐺)
106, 7, 8, 9grplinv 19250 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) = (0g‘𝐺))
114, 5, 10syl2anc 596 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) = (0g‘𝐺))
1211oveq1d 7466 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = ((0g‘𝐺) ⊕ 𝐵))
136, 9grpinvcl 19248 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
144, 5, 13syl2anc 596 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
15 simpr2 1214 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
166, 7gaass 19562 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (((invg‘𝐺)‘𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)))
172, 14, 5, 15, 16syl13anc 1400 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)))
188gagrpid 19559 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐵 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐵) = 𝐵)
192, 15, 18syl2anc 596 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐵) = 𝐵)
2012, 17, 193eqtr3d 2806 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = 𝐵)
2111oveq1d 7466 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
22 simpr3 1215 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
236, 7gaass 19562 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (((invg‘𝐺)‘𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
242, 14, 5, 22, 23syl13anc 1400 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
258gagrpid 19559 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
262, 22, 25syl2anc 596 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
2721, 24, 263eqtr3d 2806 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)) = 𝐶)
2820, 27eqeq12d 2779 . . 3 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)) ↔ 𝐵 = 𝐶))
291, 28imbitrid 247 . 2 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) → 𝐵 = 𝐶))
30 oveq2 7459 . 2 (𝐵 = 𝐶 → (𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶))
3129, 30impbid1 228 1 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) ↔ 𝐵 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Grpcgrp 19194  invgcminusg 19195   GrpAct cga 19554
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198  df-ga 19555
This theorem is used by:  gacan  19570
  Copyright terms: Public domain W3C validator