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

Theorem galcan 19518
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 7428 . . 3 ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
2 simpl 488 . . . . . . . 8 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
3 gagrp 19506 . . . . . . . 8 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
42, 3syl 18 . . . . . . 7 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
5 simpr1 1213 . . . . . . 7 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
6 galcan.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
7 eqid 2761 . . . . . . . 8 (+g‘𝐺) = (+g‘𝐺)
8 eqid 2761 . . . . . . . 8 (0g‘𝐺) = (0g‘𝐺)
9 eqid 2761 . . . . . . . 8 (invg‘𝐺) = (invg‘𝐺)
106, 7, 8, 9grplinv 19200 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) = (0g‘𝐺))
114, 5, 10syl2anc 596 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) = (0g‘𝐺))
1211oveq1d 7435 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = ((0g‘𝐺) ⊕ 𝐵))
136, 9grpinvcl 19198 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
144, 5, 13syl2anc 596 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
15 simpr2 1214 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
166, 7gaass 19511 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (((invg‘𝐺)‘𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)))
172, 14, 5, 15, 16syl13anc 1399 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐵) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)))
188gagrpid 19508 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐵 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐵) = 𝐵)
192, 15, 18syl2anc 596 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐵) = 𝐵)
2012, 17, 193eqtr3d 2804 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = 𝐵)
2111oveq1d 7435 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
22 simpr3 1215 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
236, 7gaass 19511 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (((invg‘𝐺)‘𝐴) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
242, 14, 5, 22, 23syl13anc 1399 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴)(+g‘𝐺)𝐴) ⊕ 𝐶) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)))
258gagrpid 19508 . . . . . 6 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
262, 22, 25syl2anc 596 . . . . 5 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
2721, 24, 263eqtr3d 2804 . . . 4 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)) = 𝐶)
2820, 27eqeq12d 2777 . . 3 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐵)) = (((invg‘𝐺)‘𝐴) ⊕ (𝐴 ⊕ 𝐶)) ↔ 𝐵 = 𝐶))
291, 28imbitrid 247 . 2 (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ 𝐶) → 𝐵 = 𝐶))
30 oveq2 7428 . 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 2145  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +gcplusg 17428  0gc0g 17610  Grpcgrp 19144  invgcminusg 19145   GrpAct cga 19503
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-minusg 19148  df-ga 19504
This theorem is used by:  gacan  19519
  Copyright terms: Public domain W3C validator