Theorem gacan 19317

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 19304	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
2	1	adantr 483	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
3		simpr1 1204	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
4		galcan.1	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
5		eqid 2752	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
6		eqid 2752	. . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺)
7		gacan.2	. . . . . . . 8 ⊢ 𝑁 = (invg‘𝐺)
8	4, 5, 6, 7	grprinv 19004	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
9	2, 3, 8	syl2anc 592	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
10	9	oveq1d 7396	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
11		simpl 485	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
12	4, 7	grpinvcl 19001	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
13	2, 3, 12	syl2anc 592	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝑁‘𝐴) ∈ 𝑋)
14		simpr3 1206	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
15	4, 5	gaass 19309	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
16	11, 3, 13, 14, 15	syl13anc 1383	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
17	6	gagrpid 19306	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
18	11, 14, 17	syl2anc 592	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
19	10, 16, 18	3eqtr3d 2795	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) = 𝐶)
20	19	eqeq2d 2763	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ (𝐴 ⊕ 𝐵) = 𝐶))
21		simpr2 1205	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
22	4	gaf 19307	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
23	22	adantr 483	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
24	23, 13, 14	fovcdmd 7553	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)
25	4	galcan 19316	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
26	11, 3, 21, 24, 25	syl13anc 1383	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
27	20, 26	bitr3d 283	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
28		eqcom 2759	. 2 ⊢ (𝐵 = ((𝑁‘𝐴) ⊕ 𝐶) ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵)
29	27, 28	bitrdi 289	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1095   = wceq 1550   ∈ wcel 2132   × cxp 5634  ⟶wf 6502  ‘cfv 6506  (class class class)co 7381  Basecbs 17217  +_gcplusg 17258  0_gc0g 17440  Grpcgrp 18947  inv_gcminusg 18948   GrpAct cga 19301

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-br 5091  df-opab 5153  df-mpt 5172  df-id 5531  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-fv 6514  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-map 8794  df-0g 17442  df-mgm 18646  df-sgrp 18725  df-mnd 18741  df-grp 18950  df-minusg 18951  df-ga 19302

This theorem is referenced by:  gapm  19318  gaorber  19320  gastacl  19321  gastacos  19322