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

Theorem grpoass 31164
Description: A group operation is associative. (Contributed by NM, 10-Oct-2006.) (New usage is discouraged.)
Hypothesis
Ref Expression
grpfo.1 𝑋 = ran 𝐺
Assertion
Ref Expression
grpoass ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶)))

Proof of Theorem grpoass
Dummy variables 𝑥 𝑦 𝑧 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpfo.1 . . . . 5 𝑋 = ran 𝐺
21isgrpo 31158 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
32ibi 270 . . 3 (𝐺 ∈ GrpOp → (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
43simp2d 1162 . 2 (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
5 oveq1 7457 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
65oveq1d 7465 . . . 4 (𝑥 = 𝐴 → ((𝑥𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝑦)𝐺𝑧))
7 oveq1 7457 . . . 4 (𝑥 = 𝐴 → (𝑥𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝑦𝐺𝑧)))
86, 7eqeq12d 2782 . . 3 (𝑥 = 𝐴 → (((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧))))
9 oveq2 7458 . . . . 5 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
109oveq1d 7465 . . . 4 (𝑦 = 𝐵 → ((𝐴𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝑧))
11 oveq1 7457 . . . . 5 (𝑦 = 𝐵 → (𝑦𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7466 . . . 4 (𝑦 = 𝐵 → (𝐴𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝑧)))
1310, 12eqeq12d 2782 . . 3 (𝑦 = 𝐵 → (((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧))))
14 oveq2 7458 . . . 4 (𝑧 = 𝐶 → ((𝐴𝐺𝐵)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝐶))
15 oveq2 7458 . . . . 5 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
1615oveq2d 7466 . . . 4 (𝑧 = 𝐶 → (𝐴𝐺(𝐵𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝐶)))
1714, 16eqeq12d 2782 . . 3 (𝑧 = 𝐶 → (((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶))))
188, 13, 17rspc3v 3594 . 2 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶))))
194, 18mpan9 516 1 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093   × cxp 5655  ran crn 5658  ⟶wf 6561  (class class class)co 7450  GrpOpcgr 31150
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fo 6571  df-fv 6573  df-ov 7453  df-grpo 31154
This theorem is used by:  grpoidinvlem1  31165  grpoidinvlem2  31166  grpoidinvlem4  31168  grporcan  31179  grpoinvid1  31189  grpoinvid2  31190  grpolcan  31191  grpoinvop  31194  grpomuldivass  31202  grponpcan  31204  ablo32  31210  ablo4  31211  vcm  31237  nvass  31283  hhssabloilem  31922  rngoaass  39116
  Copyright terms: Public domain W3C validator