Theorem caovcl 5996

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	⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥𝐹𝑦) ∈ 𝑆)

Assertion

Ref	Expression
caovcl	⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem caovcl

Step	Hyp	Ref	Expression
1		tru 1347	. 2 ⊢ ⊤
2		caovcl.1	. . . 4 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥𝐹𝑦) ∈ 𝑆)
3	2	adantl 275	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
4	3	caovclg 5994	. 2 ⊢ ((⊤ ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) ∈ 𝑆)
5	1, 4	mpan 421	1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆)

Syntax hints:   → wi 4   ∧ wa 103  ⊤wtru 1344   ∈ wcel 2136  (class class class)co 5842

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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-iota 5153  df-fv 5196  df-ov 5845

This theorem is referenced by:  ecopovtrn  6598  ecopovtrng  6601  genpelvl  7453  genpelvu  7454  genpml  7458  genpmu  7459  genprndl  7462  genprndu  7463  genpassl  7465  genpassu  7466  genpassg  7467  expcllem  10466