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

Theorem caovordig 6245
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 2633 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
3 breq1 4128 . . . 4 (𝑥 = 𝐴 → (𝑥𝑅𝑦𝐴𝑅𝑦))
4 oveq2 6083 . . . . 5 (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
54breq1d 4135 . . . 4 (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
63, 5imbi12d 234 . . 3 (𝑥 = 𝐴 → ((𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
7 breq2 4129 . . . 4 (𝑦 = 𝐵 → (𝐴𝑅𝑦𝐴𝑅𝐵))
8 oveq2 6083 . . . . 5 (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
98breq2d 4137 . . . 4 (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
107, 9imbi12d 234 . . 3 (𝑦 = 𝐵 → ((𝐴𝑅𝑦 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
11 oveq1 6082 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
12 oveq1 6082 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
1311, 12breq12d 4138 . . . 4 (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
1413imbi2d 230 . . 3 (𝑧 = 𝐶 → ((𝐴𝑅𝐵 → (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
156, 10, 14rspc3v 2946 . 2 ((𝐴𝑆𝐵𝑆𝐶𝑆) → (∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 → (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
162, 15mpan9 281 1 ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝑆)) → (𝐴𝑅𝐵 → (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1009   = wceq 1402  wcel 2209  wral 2528   class class class wbr 4125  (class class class)co 6075
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-iota 5332  df-fv 5380  df-ov 6078
This theorem is referenced by:  caovordid  6246
  Copyright terms: Public domain W3C validator