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

Theorem caovordid 7345
 Description: Convert an operation ordering law to class notation. (Contributed by Mario Carneiro, 31-Dec-2014.)
Hypotheses
Ref Expression
caovordig.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
caovordid.2 (𝜑𝐴𝑆)
caovordid.3 (𝜑𝐵𝑆)
caovordid.4 (𝜑𝐶𝑆)
Assertion
Ref Expression
caovordid (𝜑 → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovordid
StepHypRef Expression
1 id 22 . 2 (𝜑𝜑)
2 caovordid.2 . 2 (𝜑𝐴𝑆)
3 caovordid.3 . 2 (𝜑𝐵𝑆)
4 caovordid.4 . 2 (𝜑𝐶𝑆)
5 caovordig.1 . . 3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
65caovordig 7344 . 2 ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝑆)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
71, 2, 3, 4, 6syl13anc 1369 1 (𝜑 → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   ∈ wcel 2111   class class class wbr 5034  (class class class)co 7145 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-v 3444  df-un 3888  df-in 3890  df-ss 3900  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4805  df-br 5035  df-iota 6291  df-fv 6340  df-ov 7148 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator