Theorem gacan 19531

Description: Group inverses cancel in a group action. (Contributed by Jeff Hankins, 11-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
galcan.1	⊢ 𝑋 = (Base‘𝐺)
gacan.2	⊢ 𝑁 = (invg‘𝐺)

Assertion

Ref	Expression
gacan	⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵))

Proof of Theorem gacan

Step	Hyp	Ref	Expression
1		gagrp 19518	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
2	1	adantr 486	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
3		simpr1 1213	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
4		galcan.1	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
5		eqid 2763	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
6		eqid 2763	. . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺)
7		gacan.2	. . . . . . . 8 ⊢ 𝑁 = (invg‘𝐺)
8	4, 5, 6, 7	grprinv 19213	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
9	2, 3, 8	syl2anc 596	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
10	9	oveq1d 7442	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
11		simpl 488	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
12	4, 7	grpinvcl 19210	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
13	2, 3, 12	syl2anc 596	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝑁‘𝐴) ∈ 𝑋)
14		simpr3 1215	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
15	4, 5	gaass 19523	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
16	11, 3, 13, 14, 15	syl13anc 1399	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
17	6	gagrpid 19520	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
18	11, 14, 17	syl2anc 596	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
19	10, 16, 18	3eqtr3d 2806	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) = 𝐶)
20	19	eqeq2d 2774	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ (𝐴 ⊕ 𝐵) = 𝐶))
21		simpr2 1214	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
22	4	gaf 19521	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
23	22	adantr 486	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
24	23, 13, 14	fovcdmd 7600	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)
25	4	galcan 19530	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
26	11, 3, 21, 24, 25	syl13anc 1399	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
27	20, 26	bitr3d 284	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
28		eqcom 2770	. 2 ⊢ (𝐵 = ((𝑁‘𝐴) ⊕ 𝐶) ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵)
29	27, 28	bitrdi 290	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   × cxp 5652  ⟶wf 6542  ‘cfv 6546  (class class class)co 7427  Basecbs 17399  +_gcplusg 17440  0_gc0g 17622  Grpcgrp 19156  inv_gcminusg 19157   GrpAct cga 19515

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-map 8860  df-0g 17624  df-mgm 18828  df-sgrp 18920  df-mnd 18936  df-grp 19159  df-minusg 19160  df-ga 19516

This theorem is used by:  gapm  19532  gaorber  19534  gastacl  19535  gastacos  19536