MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  caovcl Structured version   Visualization version   GIF version

Theorem caovcl 6813
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
StepHypRef Expression
1 tru 1485 . 2
2 caovcl.1 . . . 4 ((𝑥𝑆𝑦𝑆) → (𝑥𝐹𝑦) ∈ 𝑆)
32adantl 482 . . 3 ((⊤ ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
43caovclg 6811 . 2 ((⊤ ∧ (𝐴𝑆𝐵𝑆)) → (𝐴𝐹𝐵) ∈ 𝑆)
51, 4mpan 705 1 ((𝐴𝑆𝐵𝑆) → (𝐴𝐹𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wtru 1482  wcel 1988  (class class class)co 6635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-iota 5839  df-fv 5884  df-ov 6638
This theorem is referenced by:  ecopovtrn  7835  eceqoveq  7838  genpss  9811  genpnnp  9812  genpass  9816  expcllem  12854  txlly  21420  txnlly  21421
  Copyright terms: Public domain W3C validator