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

Theorem gaass 19202
Description: An "associative" property for group actions. (Contributed by Jeff Hankins, 11-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
gaass.1 𝑋 = (Base‘𝐺)
gaass.2 + = (+g𝐺)
Assertion
Ref Expression
gaass (( ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴𝑋𝐵𝑋𝐶𝑌)) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶)))

Proof of Theorem gaass
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 gaass.1 . . . . . . 7 𝑋 = (Base‘𝐺)
2 gaass.2 . . . . . . 7 + = (+g𝐺)
3 eqid 2730 . . . . . . 7 (0g𝐺) = (0g𝐺)
41, 2, 3isga 19196 . . . . . 6 ( ∈ (𝐺 GrpAct 𝑌) ↔ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) ∧ ( :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))))))
54simprbi 496 . . . . 5 ( ∈ (𝐺 GrpAct 𝑌) → ( :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))))
6 simpr 484 . . . . . 6 ((((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))) → ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
76ralimi 3067 . . . . 5 (∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))) → ∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
85, 7simpl2im 503 . . . 4 ( ∈ (𝐺 GrpAct 𝑌) → ∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
9 oveq2 7349 . . . . . 6 (𝑥 = 𝐶 → ((𝑦 + 𝑧) 𝑥) = ((𝑦 + 𝑧) 𝐶))
10 oveq2 7349 . . . . . . 7 (𝑥 = 𝐶 → (𝑧 𝑥) = (𝑧 𝐶))
1110oveq2d 7357 . . . . . 6 (𝑥 = 𝐶 → (𝑦 (𝑧 𝑥)) = (𝑦 (𝑧 𝐶)))
129, 11eqeq12d 2746 . . . . 5 (𝑥 = 𝐶 → (((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)) ↔ ((𝑦 + 𝑧) 𝐶) = (𝑦 (𝑧 𝐶))))
13 oveq1 7348 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 + 𝑧) = (𝐴 + 𝑧))
1413oveq1d 7356 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 + 𝑧) 𝐶) = ((𝐴 + 𝑧) 𝐶))
15 oveq1 7348 . . . . . 6 (𝑦 = 𝐴 → (𝑦 (𝑧 𝐶)) = (𝐴 (𝑧 𝐶)))
1614, 15eqeq12d 2746 . . . . 5 (𝑦 = 𝐴 → (((𝑦 + 𝑧) 𝐶) = (𝑦 (𝑧 𝐶)) ↔ ((𝐴 + 𝑧) 𝐶) = (𝐴 (𝑧 𝐶))))
17 oveq2 7349 . . . . . . 7 (𝑧 = 𝐵 → (𝐴 + 𝑧) = (𝐴 + 𝐵))
1817oveq1d 7356 . . . . . 6 (𝑧 = 𝐵 → ((𝐴 + 𝑧) 𝐶) = ((𝐴 + 𝐵) 𝐶))
19 oveq1 7348 . . . . . . 7 (𝑧 = 𝐵 → (𝑧 𝐶) = (𝐵 𝐶))
2019oveq2d 7357 . . . . . 6 (𝑧 = 𝐵 → (𝐴 (𝑧 𝐶)) = (𝐴 (𝐵 𝐶)))
2118, 20eqeq12d 2746 . . . . 5 (𝑧 = 𝐵 → (((𝐴 + 𝑧) 𝐶) = (𝐴 (𝑧 𝐶)) ↔ ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
2212, 16, 21rspc3v 3591 . . . 4 ((𝐶𝑌𝐴𝑋𝐵𝑋) → (∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
238, 22syl5 34 . . 3 ((𝐶𝑌𝐴𝑋𝐵𝑋) → ( ∈ (𝐺 GrpAct 𝑌) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
24233coml 1127 . 2 ((𝐴𝑋𝐵𝑋𝐶𝑌) → ( ∈ (𝐺 GrpAct 𝑌) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
2524impcom 407 1 (( ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴𝑋𝐵𝑋𝐶𝑌)) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2110  wral 3045  Vcvv 3434   × cxp 5612  wf 6473  cfv 6477  (class class class)co 7341  Basecbs 17112  +gcplusg 17153  0gc0g 17335  Grpcgrp 18838   GrpAct cga 19194
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-fv 6485  df-ov 7344  df-oprab 7345  df-mpo 7346  df-map 8747  df-ga 19195
This theorem is referenced by:  gass  19206  gasubg  19207  galcan  19209  gacan  19210  gaorber  19213  gastacl  19214  gastacos  19215  galactghm  19309
  Copyright terms: Public domain W3C validator