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

Theorem caov411d 7650
Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovd.1 (𝜑 → 𝐴 ∈ 𝑆)
caovd.2 (𝜑 → 𝐵 ∈ 𝑆)
caovd.3 (𝜑 → 𝐶 ∈ 𝑆)
caovd.com ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
caovd.ass ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
caovd.4 (𝜑 → 𝐷 ∈ 𝑆)
caovd.cl ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
Assertion
Ref Expression
caov411d (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐷,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caov411d
StepHypRef Expression
1 caovd.2 . . 3 (𝜑 → 𝐵 ∈ 𝑆)
2 caovd.1 . . 3 (𝜑 → 𝐴 ∈ 𝑆)
3 caovd.3 . . 3 (𝜑 → 𝐶 ∈ 𝑆)
4 caovd.com . . 3 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
5 caovd.ass . . 3 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
6 caovd.4 . . 3 (𝜑 → 𝐷 ∈ 𝑆)
7 caovd.cl . . 3 ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
81, 2, 3, 4, 5, 6, 7caov4d 7649 . 2 (𝜑 → ((𝐵𝐹𝐴)𝐹(𝐶𝐹𝐷)) = ((𝐵𝐹𝐶)𝐹(𝐴𝐹𝐷)))
94, 1, 2caovcomd 7621 . . 3 (𝜑 → (𝐵𝐹𝐴) = (𝐴𝐹𝐵))
109oveq1d 7439 . 2 (𝜑 → ((𝐵𝐹𝐴)𝐹(𝐶𝐹𝐷)) = ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)))
114, 1, 3caovcomd 7621 . . 3 (𝜑 → (𝐵𝐹𝐶) = (𝐶𝐹𝐵))
1211oveq1d 7439 . 2 (𝜑 → ((𝐵𝐹𝐶)𝐹(𝐴𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))
138, 10, 123eqtr3d 2803 1 (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  (class class class)co 7424
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-ext 2732
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fv 6551  df-ov 7427
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator