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

Theorem caovord 7581
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 7377 . . . 4 (𝑧 = 𝐶 → (𝑧𝐹𝐴) = (𝐶𝐹𝐴))
2 oveq1 7377 . . . 4 (𝑧 = 𝐶 → (𝑧𝐹𝐵) = (𝐶𝐹𝐵))
31, 2breq12d 5113 . . 3 (𝑧 = 𝐶 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵) ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
43bibi2d 342 . 2 (𝑧 = 𝐶 → ((𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)) ↔ (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
5 caovord.1 . . 3 𝐴 ∈ V
6 caovord.2 . . 3 𝐵 ∈ V
7 breq1 5103 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝑦𝐴𝑅𝑦))
8 oveq2 7378 . . . . . . 7 (𝑥 = 𝐴 → (𝑧𝐹𝑥) = (𝑧𝐹𝐴))
98breq1d 5110 . . . . . 6 (𝑥 = 𝐴 → ((𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)))
107, 9bibi12d 345 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦))))
11 breq2 5104 . . . . . 6 (𝑦 = 𝐵 → (𝐴𝑅𝑦𝐴𝑅𝐵))
12 oveq2 7378 . . . . . . 7 (𝑦 = 𝐵 → (𝑧𝐹𝑦) = (𝑧𝐹𝐵))
1312breq2d 5112 . . . . . 6 (𝑦 = 𝐵 → ((𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦) ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
1411, 13bibi12d 345 . . . . 5 (𝑦 = 𝐵 → ((𝐴𝑅𝑦 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
1510, 14sylan9bb 509 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)) ↔ (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵))))
1615imbi2d 340 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑧𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦))) ↔ (𝑧𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))))
17 caovord.3 . . 3 (𝑧𝑆 → (𝑥𝑅𝑦 ↔ (𝑧𝐹𝑥)𝑅(𝑧𝐹𝑦)))
185, 6, 16, 17vtocl2 3524 . 2 (𝑧𝑆 → (𝐴𝑅𝐵 ↔ (𝑧𝐹𝐴)𝑅(𝑧𝐹𝐵)))
194, 18vtoclga 3534 1 (𝐶𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3442   class class class wbr 5100  (class class class)co 7370
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6458  df-fv 6510  df-ov 7373
This theorem is referenced by:  caovord2  7582  caovord3  7583  genpcl  10933
  Copyright terms: Public domain W3C validator