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

Theorem caov4d 6756
 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
caov4d (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐴𝐹𝐶)𝐹(𝐵𝐹𝐷)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐷,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caov4d
StepHypRef Expression
1 caovd.2 . . . 4 (𝜑𝐵𝑆)
2 caovd.3 . . . 4 (𝜑𝐶𝑆)
3 caovd.4 . . . 4 (𝜑𝐷𝑆)
4 caovd.com . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
5 caovd.ass . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
61, 2, 3, 4, 5caov12d 6753 . . 3 (𝜑 → (𝐵𝐹(𝐶𝐹𝐷)) = (𝐶𝐹(𝐵𝐹𝐷)))
76oveq2d 6565 . 2 (𝜑 → (𝐴𝐹(𝐵𝐹(𝐶𝐹𝐷))) = (𝐴𝐹(𝐶𝐹(𝐵𝐹𝐷))))
8 caovd.1 . . 3 (𝜑𝐴𝑆)
9 caovd.cl . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
109, 2, 3caovcld 6725 . . 3 (𝜑 → (𝐶𝐹𝐷) ∈ 𝑆)
115, 8, 1, 10caovassd 6731 . 2 (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = (𝐴𝐹(𝐵𝐹(𝐶𝐹𝐷))))
129, 1, 3caovcld 6725 . . 3 (𝜑 → (𝐵𝐹𝐷) ∈ 𝑆)
135, 8, 2, 12caovassd 6731 . 2 (𝜑 → ((𝐴𝐹𝐶)𝐹(𝐵𝐹𝐷)) = (𝐴𝐹(𝐶𝐹(𝐵𝐹𝐷))))
147, 11, 133eqtr4d 2654 1 (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐴𝐹𝐶)𝐹(𝐵𝐹𝐷)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  (class class class)co 6549 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812  df-ov 6552 This theorem is referenced by:  caov411d  6757  caov42d  6758
 Copyright terms: Public domain W3C validator