Theorem gacan 19519

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 19506	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
2	1	adantr 486	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
3		simpr1 1213	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
4		galcan.1	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
5		eqid 2761	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
6		eqid 2761	. . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺)
7		gacan.2	. . . . . . . 8 ⊢ 𝑁 = (invg‘𝐺)
8	4, 5, 6, 7	grprinv 19201	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
9	2, 3, 8	syl2anc 596	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
10	9	oveq1d 7435	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
11		simpl 488	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
12	4, 7	grpinvcl 19198	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
13	2, 3, 12	syl2anc 596	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝑁‘𝐴) ∈ 𝑋)
14		simpr3 1215	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
15	4, 5	gaass 19511	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
16	11, 3, 13, 14, 15	syl13anc 1399	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
17	6	gagrpid 19508	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
18	11, 14, 17	syl2anc 596	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
19	10, 16, 18	3eqtr3d 2804	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) = 𝐶)
20	19	eqeq2d 2772	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ (𝐴 ⊕ 𝐵) = 𝐶))
21		simpr2 1214	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
22	4	gaf 19509	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
23	22	adantr 486	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
24	23, 13, 14	fovcdmd 7593	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)
25	4	galcan 19518	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
26	11, 3, 21, 24, 25	syl13anc 1399	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
27	20, 26	bitr3d 284	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
28		eqcom 2768	. 2 ⊢ (𝐵 = ((𝑁‘𝐴) ⊕ 𝐶) ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵)
29	27, 28	bitrdi 290	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   × cxp 5649  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428  0_gc0g 17610  Grpcgrp 19144  inv_gcminusg 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:  gapm  19520  gaorber  19522  gastacl  19523  gastacos  19524