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

Theorem caovcom 5678
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 266 . 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 5676 . 2  |-  ( ( A  e.  _V  /\  ( A  e.  _V  /\  B  e.  _V )
)  ->  ( A F B )  =  ( B F A ) )
71, 3, 6mp2an 416 1  |-  ( A F B )  =  ( B F A )
Colors of variables: wff set class
Syntax hints:    /\ wa 102    = wceq 1284    e. wcel 1433   _Vcvv 2601  (class class class)co 5532
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-iota 4887  df-fv 4930  df-ov 5535
This theorem is referenced by:  caovord2  5693  caov32  5708  caov12  5709  ecopovsym  6225  ecopover  6227
  Copyright terms: Public domain W3C validator