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

Theorem caovcl 6187
Description: Convert an operation closure law to class notation. (Contributed by NM, 4-Aug-1995.) (Revised by Mario Carneiro, 26-May-2014.)
Hypothesis
Ref Expression
caovcl.1  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( x F y )  e.  S )
Assertion
Ref Expression
caovcl  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( A F B )  e.  S )
Distinct variable groups:    x, y, A   
y, B    x, F, y    x, S, y
Allowed substitution hint:    B( x)

Proof of Theorem caovcl
StepHypRef Expression
1 tru 1402 . 2  |- T.
2 caovcl.1 . . . 4  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( x F y )  e.  S )
32adantl 277 . . 3  |-  ( ( T.  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  e.  S )
43caovclg 6185 . 2  |-  ( ( T.  /\  ( A  e.  S  /\  B  e.  S ) )  -> 
( A F B )  e.  S )
51, 4mpan 424 1  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( A F B )  e.  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   T. wtru 1399    e. wcel 2202  (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:  ecopovtrn  6844  ecopovtrng  6847  genpelvl  7775  genpelvu  7776  genpml  7780  genpmu  7781  genprndl  7784  genprndu  7785  genpassl  7787  genpassu  7788  genpassg  7789  expcllem  10858
  Copyright terms: Public domain W3C validator