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

Theorem gaass 18419
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 2819 . . . . . . 7 (0g𝐺) = (0g𝐺)
41, 2, 3isga 18413 . . . . . 6 ( ∈ (𝐺 GrpAct 𝑌) ↔ ((𝐺 ∈ Grp ∧ 𝑌 ∈ V) ∧ ( :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))))))
54simprbi 499 . . . . 5 ( ∈ (𝐺 GrpAct 𝑌) → ( :(𝑋 × 𝑌)⟶𝑌 ∧ ∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))))
6 simpr 487 . . . . . 6 ((((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))) → ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
76ralimi 3158 . . . . 5 (∀𝑥𝑌 (((0g𝐺) 𝑥) = 𝑥 ∧ ∀𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥))) → ∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
85, 7simpl2im 506 . . . 4 ( ∈ (𝐺 GrpAct 𝑌) → ∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)))
9 oveq2 7156 . . . . . 6 (𝑥 = 𝐶 → ((𝑦 + 𝑧) 𝑥) = ((𝑦 + 𝑧) 𝐶))
10 oveq2 7156 . . . . . . 7 (𝑥 = 𝐶 → (𝑧 𝑥) = (𝑧 𝐶))
1110oveq2d 7164 . . . . . 6 (𝑥 = 𝐶 → (𝑦 (𝑧 𝑥)) = (𝑦 (𝑧 𝐶)))
129, 11eqeq12d 2835 . . . . 5 (𝑥 = 𝐶 → (((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)) ↔ ((𝑦 + 𝑧) 𝐶) = (𝑦 (𝑧 𝐶))))
13 oveq1 7155 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 + 𝑧) = (𝐴 + 𝑧))
1413oveq1d 7163 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 + 𝑧) 𝐶) = ((𝐴 + 𝑧) 𝐶))
15 oveq1 7155 . . . . . 6 (𝑦 = 𝐴 → (𝑦 (𝑧 𝐶)) = (𝐴 (𝑧 𝐶)))
1614, 15eqeq12d 2835 . . . . 5 (𝑦 = 𝐴 → (((𝑦 + 𝑧) 𝐶) = (𝑦 (𝑧 𝐶)) ↔ ((𝐴 + 𝑧) 𝐶) = (𝐴 (𝑧 𝐶))))
17 oveq2 7156 . . . . . . 7 (𝑧 = 𝐵 → (𝐴 + 𝑧) = (𝐴 + 𝐵))
1817oveq1d 7163 . . . . . 6 (𝑧 = 𝐵 → ((𝐴 + 𝑧) 𝐶) = ((𝐴 + 𝐵) 𝐶))
19 oveq1 7155 . . . . . . 7 (𝑧 = 𝐵 → (𝑧 𝐶) = (𝐵 𝐶))
2019oveq2d 7164 . . . . . 6 (𝑧 = 𝐵 → (𝐴 (𝑧 𝐶)) = (𝐴 (𝐵 𝐶)))
2118, 20eqeq12d 2835 . . . . 5 (𝑧 = 𝐵 → (((𝐴 + 𝑧) 𝐶) = (𝐴 (𝑧 𝐶)) ↔ ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
2212, 16, 21rspc3v 3634 . . . 4 ((𝐶𝑌𝐴𝑋𝐵𝑋) → (∀𝑥𝑌𝑦𝑋𝑧𝑋 ((𝑦 + 𝑧) 𝑥) = (𝑦 (𝑧 𝑥)) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
238, 22syl5 34 . . 3 ((𝐶𝑌𝐴𝑋𝐵𝑋) → ( ∈ (𝐺 GrpAct 𝑌) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
24233coml 1122 . 2 ((𝐴𝑋𝐵𝑋𝐶𝑌) → ( ∈ (𝐺 GrpAct 𝑌) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶))))
2524impcom 410 1 (( ∈ (𝐺 GrpAct 𝑌) ∧ (𝐴𝑋𝐵𝑋𝐶𝑌)) → ((𝐴 + 𝐵) 𝐶) = (𝐴 (𝐵 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1082   = wceq 1531  wcel 2108  wral 3136  Vcvv 3493   × cxp 5546  wf 6344  cfv 6348  (class class class)co 7148  Basecbs 16475  +gcplusg 16557  0gc0g 16705  Grpcgrp 18095   GrpAct cga 18411
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-map 8400  df-ga 18412
This theorem is referenced by:  gass  18423  gasubg  18424  galcan  18426  gacan  18427  gaorber  18430  gastacl  18431  gastacos  18432  galactghm  18524
  Copyright terms: Public domain W3C validator