ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caovordig GIF version

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

Proof of Theorem caovordig
StepHypRef Expression
1 caovordig.1 . . 3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
21ralrimivvva 2616 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
3 breq1 4096 . . . 4 (𝑥 = 𝐴 → (𝑥𝑅𝑦𝐴𝑅𝑦))
4 oveq2 6036 . . . . 5 (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
54breq1d 4103 . . . 4 (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
63, 5imbi12d 234 . . 3 (𝑥 = 𝐴 → ((𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
7 breq2 4097 . . . 4 (𝑦 = 𝐵 → (𝐴𝑅𝑦𝐴𝑅𝐵))
8 oveq2 6036 . . . . 5 (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
98breq2d 4105 . . . 4 (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
107, 9imbi12d 234 . . 3 (𝑦 = 𝐵 → ((𝐴𝑅𝑦 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
11 oveq1 6035 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
12 oveq1 6035 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
1311, 12breq12d 4106 . . . 4 (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
1413imbi2d 230 . . 3 (𝑧 = 𝐶 → ((𝐴𝑅𝐵 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
156, 10, 14rspc3v 2927 . 2 ((𝐴𝑆𝐵𝑆𝐶𝑆) → (∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
162, 15mpan9 281 1 ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝑆)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wcel 2202  wral 2511   class class class wbr 4093  (class class class)co 6028
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031
This theorem is referenced by:  caovordid  6199
  Copyright terms: Public domain W3C validator