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

Theorem caov31 6268
 Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.)
Hypotheses
Ref Expression
caov.1
caov.2
caov.3
caov.com
caov.ass
Assertion
Ref Expression
caov31
Distinct variable groups:   ,,,   ,,,   ,,,   ,,,

Proof of Theorem caov31
StepHypRef Expression
1 caov.1 . . . 4
2 caov.3 . . . 4
3 caov.2 . . . 4
4 caov.ass . . . 4
51, 2, 3, 4caovass 6239 . . 3
6 caov.com . . . 4
71, 2, 3, 6, 4caov12 6267 . . 3
85, 7eqtri 2455 . 2
91, 3, 2, 6, 4caov32 6266 . 2
102, 1, 3, 6, 4caov32 6266 . . 3
112, 1, 3, 4caovass 6239 . . 3
1210, 11eqtr3i 2457 . 2
138, 9, 123eqtr4i 2465 1
 Colors of variables: wff set class Syntax hints:   wceq 1652   wcel 1725  cvv 2948  (class class class)co 6073 This theorem is referenced by:  caov13  6269  caov411  6271 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-iota 5410  df-fv 5454  df-ov 6076
 Copyright terms: Public domain W3C validator