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

Theorem caovord 7345
Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.)
Hypotheses
Ref Expression
caovord.1 𝐴 ∈ V
caovord.2 𝐵 ∈ V
caovord.3 (𝑧𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
Assertion
Ref Expression
caovord (𝐶𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovord
StepHypRef Expression
1 oveq1 7149 . . . 4 (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
2 oveq1 7149 . . . 4 (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
31, 2breq12d 5065 . . 3 (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
43bibi2d 345 . 2 (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
5 caovord.1 . . 3 𝐴 ∈ V
6 caovord.2 . . 3 𝐵 ∈ V
7 breq1 5055 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝑦𝐴𝑅𝑦))
8 oveq2 7150 . . . . . . 7 (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
98breq1d 5062 . . . . . 6 (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
107, 9bibi12d 348 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
11 breq2 5056 . . . . . 6 (𝑦 = 𝐵 → (𝐴𝑅𝑦𝐴𝑅𝐵))
12 oveq2 7150 . . . . . . 7 (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
1312breq2d 5064 . . . . . 6 (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
1411, 13bibi12d 348 . . . . 5 (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
1510, 14sylan9bb 512 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
1615imbi2d 343 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑧𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) ↔ (𝑧𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))))
17 caovord.3 . . 3 (𝑧𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
185, 6, 16, 17vtocl2 3553 . 2 (𝑧𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
194, 18vtoclga 3566 1 (𝐶𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  Vcvv 3486   class class class wbr 5052  (class class class)co 7142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3488  df-dif 3927  df-un 3929  df-in 3931  df-ss 3940  df-nul 4280  df-if 4454  df-sn 4554  df-pr 4556  df-op 4560  df-uni 4825  df-br 5053  df-iota 6300  df-fv 6349  df-ov 7145
This theorem is referenced by:  caovord2  7346  caovord3  7347  genpcl  10416
  Copyright terms: Public domain W3C validator