ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caovcom Unicode version

Theorem caovcom 6190
Description: Convert an operation commutative law to class notation. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 1-Jun-2013.)
Hypotheses
Ref Expression
caovcom.1  |-  A  e. 
_V
caovcom.2  |-  B  e. 
_V
caovcom.3  |-  ( x F y )  =  ( y F x )
Assertion
Ref Expression
caovcom  |-  ( A F B )  =  ( B F A )
Distinct variable groups:    x, y, A   
x, B, y    x, F, y

Proof of Theorem caovcom
StepHypRef Expression
1 caovcom.1 . 2  |-  A  e. 
_V
2 caovcom.2 . . 3  |-  B  e. 
_V
31, 2pm3.2i 272 . 2  |-  ( A  e.  _V  /\  B  e.  _V )
4 caovcom.3 . . . 4  |-  ( x F y )  =  ( y F x )
54a1i 9 . . 3  |-  ( ( A  e.  _V  /\  ( x  e.  _V  /\  y  e.  _V )
)  ->  ( x F y )  =  ( y F x ) )
65caovcomg 6188 . 2  |-  ( ( A  e.  _V  /\  ( A  e.  _V  /\  B  e.  _V )
)  ->  ( A F B )  =  ( B F A ) )
71, 3, 6mp2an 426 1  |-  ( A F B )  =  ( B F A )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1398    e. wcel 2202   _Vcvv 2803  (class class class)co 6028
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031
This theorem is referenced by:  caovord2  6205  caov32  6220  caov12  6221  ecopovsym  6843  ecopover  6845
  Copyright terms: Public domain W3C validator