Theorem caovcl 6101

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 1377	. 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 6099	. 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 1374   e. wcel 2176  (class class class)co 5944

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-iota 5232  df-fv 5279  df-ov 5947

This theorem is referenced by:  ecopovtrn  6719  ecopovtrng  6722  genpelvl  7625  genpelvu  7626  genpml  7630  genpmu  7631  genprndl  7634  genprndu  7635  genpassl  7637  genpassu  7638  genpassg  7639  expcllem  10695