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

Theorem grpoass 31105
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 31099 . . . 4 (𝐺 ∈ GrpOp → (𝐺 ∈ GrpOp ↔ (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢))))
32ibi 270 . . 3 (𝐺 ∈ GrpOp → (𝐺:(𝑋 × 𝑋)⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐺𝑥) = 𝑥 ∧ ∃𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑢)))
43simp2d 1161 . 2 (𝐺 ∈ GrpOp → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 ((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)))
5 oveq1 7427 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
65oveq1d 7435 . . . 4 (𝑥 = 𝐴 → ((𝑥𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝑦)𝐺𝑧))
7 oveq1 7427 . . . 4 (𝑥 = 𝐴 → (𝑥𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝑦𝐺𝑧)))
86, 7eqeq12d 2776 . . 3 (𝑥 = 𝐴 → (((𝑥𝐺𝑦)𝐺𝑧) = (𝑥𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧))))
9 oveq2 7428 . . . . 5 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
109oveq1d 7435 . . . 4 (𝑦 = 𝐵 → ((𝐴𝐺𝑦)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝑧))
11 oveq1 7427 . . . . 5 (𝑦 = 𝐵 → (𝑦𝐺𝑧) = (𝐵𝐺𝑧))
1211oveq2d 7436 . . . 4 (𝑦 = 𝐵 → (𝐴𝐺(𝑦𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝑧)))
1310, 12eqeq12d 2776 . . 3 (𝑦 = 𝐵 → (((𝐴𝐺𝑦)𝐺𝑧) = (𝐴𝐺(𝑦𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧))))
14 oveq2 7428 . . . 4 (𝑧 = 𝐶 → ((𝐴𝐺𝐵)𝐺𝑧) = ((𝐴𝐺𝐵)𝐺𝐶))
15 oveq2 7428 . . . . 5 (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
1615oveq2d 7436 . . . 4 (𝑧 = 𝐶 → (𝐴𝐺(𝐵𝐺𝑧)) = (𝐴𝐺(𝐵𝐺𝐶)))
1714, 16eqeq12d 2776 . . 3 (𝑧 = 𝐶 → (((𝐴𝐺𝐵)𝐺𝑧) = (𝐴𝐺(𝐵𝐺𝑧)) ↔ ((𝐴𝐺𝐵)𝐺𝐶) = (𝐴𝐺(𝐵𝐺𝐶))))
188, 13, 17rspc3v 3591 . 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 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   × cxp 5648  ran crn 5651  ⟶wf 6534  (class class class)co 7420  GrpOpcgr 31091
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-ov 7423  df-grpo 31095
This theorem is used by:  grpoidinvlem1  31106  grpoidinvlem2  31107  grpoidinvlem4  31109  grporcan  31120  grpoinvid1  31130  grpoinvid2  31131  grpolcan  31132  grpoinvop  31135  grpomuldivass  31143  grponpcan  31145  ablo32  31151  ablo4  31152  vcm  31178  nvass  31224  hhssabloilem  31863  rngoaass  38849
  Copyright terms: Public domain W3C validator