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

Theorem caovordg 6185
Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.) (Revised by Mario Carneiro, 30-Dec-2014.)
Hypothesis
Ref Expression
caovordg.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
Assertion
Ref Expression
caovordg ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝑆)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovordg
StepHypRef Expression
1 caovordg.1 . . 3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
21ralrimivvva 2613 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
3 breq1 4089 . . . 4 (𝑥 = 𝐴 → (𝑥𝑅𝑦𝐴𝑅𝑦))
4 oveq2 6021 . . . . 5 (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
54breq1d 4096 . . . 4 (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
63, 5bibi12d 235 . . 3 (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
7 breq2 4090 . . . 4 (𝑦 = 𝐵 → (𝐴𝑅𝑦𝐴𝑅𝐵))
8 oveq2 6021 . . . . 5 (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
98breq2d 4098 . . . 4 (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
107, 9bibi12d 235 . . 3 (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
11 oveq1 6020 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
12 oveq1 6020 . . . . 5 (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
1311, 12breq12d 4099 . . . 4 (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
1413bibi2d 232 . . 3 (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
156, 10, 14rspc3v 2924 . 2 ((𝐴𝑆𝐵𝑆𝐶𝑆) → (∀𝑥𝑆𝑦𝑆𝑧𝑆 (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
162, 15mpan9 281 1 ((𝜑 ∧ (𝐴𝑆𝐵𝑆𝐶𝑆)) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wcel 2200  wral 2508   class class class wbr 4086  (class class class)co 6013
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-iota 5284  df-fv 5332  df-ov 6016
This theorem is referenced by:  caovordd  6186
  Copyright terms: Public domain W3C validator