Theorem caovcl 6075

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 1368	. 2 ⊢ ⊤
2		caovcl.1	. . . 4 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥𝐹𝑦) ∈ 𝑆)
3	2	adantl 277	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
4	3	caovclg 6073	. 2 ⊢ ((⊤ ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) ∈ 𝑆)
5	1, 4	mpan 424	1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆)

Syntax hints:   → wi 4   ∧ wa 104  ⊤wtru 1365   ∈ wcel 2164  (class class class)co 5919

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3158  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-iota 5216  df-fv 5263  df-ov 5922

This theorem is referenced by:  ecopovtrn  6688  ecopovtrng  6691  genpelvl  7574  genpelvu  7575  genpml  7579  genpmu  7580  genprndl  7583  genprndu  7584  genpassl  7586  genpassu  7587  genpassg  7588  expcllem  10624