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

Theorem caovcomd 6032
Description: Convert an operation commutative law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovcomg.1  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
caovcomd.2  |-  ( ph  ->  A  e.  S )
caovcomd.3  |-  ( ph  ->  B  e.  S )
Assertion
Ref Expression
caovcomd  |-  ( ph  ->  ( A F B )  =  ( B F A ) )
Distinct variable groups:    x, y, A    x, B, y    ph, x, y    x, F, y    x, S, y

Proof of Theorem caovcomd
StepHypRef Expression
1 id 19 . 2  |-  ( ph  ->  ph )
2 caovcomd.2 . 2  |-  ( ph  ->  A  e.  S )
3 caovcomd.3 . 2  |-  ( ph  ->  B  e.  S )
4 caovcomg.1 . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
54caovcomg 6031 . 2  |-  ( (
ph  /\  ( A  e.  S  /\  B  e.  S ) )  -> 
( A F B )  =  ( B F A ) )
61, 2, 3, 5syl12anc 1180 1  |-  ( ph  ->  ( A F B )  =  ( B F A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696  (class class class)co 5874
This theorem is referenced by:  caovcanrd  6039  caovord2d  6045  caovdir2d  6052  caov32d  6056  caov12d  6057  caov31d  6058  caov411d  6061  caov42d  6062  seqf1olem2a  11100
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-iota 5235  df-fv 5279  df-ov 5877
  Copyright terms: Public domain W3C validator