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

Theorem caov4d 6230
 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 6227 . . 3
76oveq2d 6056 . 2
8 caovd.1 . . 3
9 caovd.cl . . . 4
109, 2, 3caovcld 6199 . . 3
115, 8, 1, 10caovassd 6205 . 2
129, 1, 3caovcld 6199 . . 3
135, 8, 2, 12caovassd 6205 . 2
147, 11, 133eqtr4d 2446 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 359   w3a 936   wceq 1649   wcel 1721  (class class class)co 6040 This theorem is referenced by:  caov411d  6231  caov42d  6232 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-br 4173  df-iota 5377  df-fv 5421  df-ov 6043
 Copyright terms: Public domain W3C validator