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

Theorem grpoass 31132
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 31126 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
32ibi 270 . . 3 (𝐺 ∈ GrpOp → (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
43simp2d 1161 . 2 (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
5 oveq1 7447 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
65oveq1d 7455 . . . 4 (𝑥 = 𝐴 → ((𝑥𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝑦)𝐺𝑧))
7 oveq1 7447 . . . 4 (𝑥 = 𝐴 → (𝑥𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝑦𝐺𝑧)))
86, 7eqeq12d 2779 . . 3 (𝑥 = 𝐴 → (((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧))))
9 oveq2 7448 . . . . 5 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
109oveq1d 7455 . . . 4 (𝑦 = 𝐵 → ((𝐴𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝑧))
11 oveq1 7447 . . . . 5 (𝑦 = 𝐵 → (𝑦𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7456 . . . 4 (𝑦 = 𝐵 → (𝐴𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝑧)))
1310, 12eqeq12d 2779 . . 3 (𝑦 = 𝐵 → (((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧))))
14 oveq2 7448 . . . 4 (𝑧 = 𝐶 → ((𝐴𝐺𝐵)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝐶))
15 oveq2 7448 . . . . 5 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
1615oveq2d 7456 . . . 4 (𝑧 = 𝐶 → (𝐴𝐺(𝐵𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝐶)))
1714, 16eqeq12d 2779 . . 3 (𝑧 = 𝐶 → (((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶))))
188, 13, 17rspc3v 3595 . 2 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) → ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶))))
194, 18mpan9 516 1 ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   × cxp 5653  ran crn 5656  ⟶wf 6551  (class class class)co 7440  GrpOpcgr 31118
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fo 6561  df-fv 6563  df-ov 7443  df-grpo 31122
This theorem is used by:  grpoidinvlem1  31133  grpoidinvlem2  31134  grpoidinvlem4  31136  grporcan  31147  grpoinvid1  31157  grpoinvid2  31158  grpolcan  31159  grpoinvop  31162  grpomuldivass  31170  grponpcan  31172  ablo32  31178  ablo4  31179  vcm  31205  nvass  31251  hhssabloilem  31890  rngoaass  39039
  Copyright terms: Public domain W3C validator