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

Theorem caovcl 6007
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 1352 . 2  |- T.
2 caovcl.1 . . . 4  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( x F y )  e.  S )
32adantl 275 . . 3  |-  ( ( T.  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  e.  S )
43caovclg 6005 . 2  |-  ( ( T.  /\  ( A  e.  S  /\  B  e.  S ) )  -> 
( A F B )  e.  S )
51, 4mpan 422 1  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( A F B )  e.  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   T. wtru 1349    e. wcel 2141  (class class class)co 5853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-iota 5160  df-fv 5206  df-ov 5856
This theorem is referenced by:  ecopovtrn  6610  ecopovtrng  6613  genpelvl  7474  genpelvu  7475  genpml  7479  genpmu  7480  genprndl  7483  genprndu  7484  genpassl  7486  genpassu  7487  genpassg  7488  expcllem  10487
  Copyright terms: Public domain W3C validator