Theorem gacan 19345

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 19332	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
2	1	adantr 480	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐺 ∈ Grp)
3		simpr1 1194	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐴 ∈ 𝑋)
4		galcan.1	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
5		eqid 2740	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
6		eqid 2740	. . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺)
7		gacan.2	. . . . . . . 8 ⊢ 𝑁 = (invg‘𝐺)
8	4, 5, 6, 7	grprinv 19030	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
9	2, 3, 8	syl2anc 583	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴(+g‘𝐺)(𝑁‘𝐴)) = (0g‘𝐺))
10	9	oveq1d 7463	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = ((0g‘𝐺) ⊕ 𝐶))
11		simpl 482	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
12	4, 7	grpinvcl 19027	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) ∈ 𝑋)
13	2, 3, 12	syl2anc 583	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝑁‘𝐴) ∈ 𝑋)
14		simpr3 1196	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐶 ∈ 𝑌)
15	4, 5	gaass 19337	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ (𝑁‘𝐴) ∈ 𝑋 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
16	11, 3, 13, 14, 15	syl13anc 1372	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴(+g‘𝐺)(𝑁‘𝐴)) ⊕ 𝐶) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)))
17	6	gagrpid 19334	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐶 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
18	11, 14, 17	syl2anc 583	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((0g‘𝐺) ⊕ 𝐶) = 𝐶)
19	10, 16, 18	3eqtr3d 2788	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) = 𝐶)
20	19	eqeq2d 2751	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ (𝐴 ⊕ 𝐵) = 𝐶))
21		simpr2 1195	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → 𝐵 ∈ 𝑌)
22	4	gaf 19335	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
23	22	adantr 480	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
24	23, 13, 14	fovcdmd 7622	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)
25	4	galcan 19344	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ ((𝑁‘𝐴) ⊕ 𝐶) ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
26	11, 3, 21, 24, 25	syl13anc 1372	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = (𝐴 ⊕ ((𝑁‘𝐴) ⊕ 𝐶)) ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
27	20, 26	bitr3d 281	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ 𝐵 = ((𝑁‘𝐴) ⊕ 𝐶)))
28		eqcom 2747	. 2 ⊢ (𝐵 = ((𝑁‘𝐴) ⊕ 𝐶) ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵)
29	27, 28	bitrdi 287	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑌)) → ((𝐴 ⊕ 𝐵) = 𝐶 ↔ ((𝑁‘𝐴) ⊕ 𝐶) = 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   × cxp 5698  ⟶wf 6569  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  +_gcplusg 17311  0_gc0g 17499  Grpcgrp 18973  inv_gcminusg 18974   GrpAct cga 19329

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-map 8886  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773  df-grp 18976  df-minusg 18977  df-ga 19330

This theorem is referenced by:  gapm  19346  gaorber  19348  gastacl  19349  gastacos  19350