Theorem caovcl 6160

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

Step	Hyp	Ref	Expression
1		tru 1399	. 2 |- T.
2		caovcl.1	. . . 4 |- ( ( x e. S /\ y e. S ) -> ( x F y ) e. S )
3	2	adantl 277	. . 3 |- ( ( T. /\ ( x e. S /\ y e. S ) ) -> ( x F y ) e. S )
4	3	caovclg 6158	. 2 |- ( ( T. /\ ( A e. S /\ B e. S ) ) -> ( A F B ) e. S )
5	1, 4	mpan 424	1 |- ( ( A e. S /\ B e. S ) -> ( A F B ) e. S )

Syntax hints:   -> wi 4   /\ wa 104   T. wtru 1396   e. wcel 2200  (class class class)co 6001

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-iota 5278  df-fv 5326  df-ov 6004

This theorem is referenced by:  ecopovtrn  6779  ecopovtrng  6782  genpelvl  7699  genpelvu  7700  genpml  7704  genpmu  7705  genprndl  7708  genprndu  7709  genpassl  7711  genpassu  7712  genpassg  7713  expcllem  10772