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

Theorem caovcan 6736
Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.)
Hypotheses
Ref Expression
caovcan.1 𝐶 ∈ V
caovcan.2 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧))
Assertion
Ref Expression
caovcan ((𝐴𝑆𝐵𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovcan
StepHypRef Expression
1 oveq1 6556 . . . 4 (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
2 oveq1 6556 . . . 4 (𝑥 = 𝐴 → (𝑥𝐹𝐶) = (𝐴𝐹𝐶))
31, 2eqeq12d 2625 . . 3 (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝐶)))
43imbi1d 330 . 2 (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶)))
5 oveq2 6557 . . . 4 (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
65eqeq1d 2612 . . 3 (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝐶) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶)))
7 eqeq1 2614 . . 3 (𝑦 = 𝐵 → (𝑦 = 𝐶𝐵 = 𝐶))
86, 7imbi12d 333 . 2 (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝐶) → 𝑦 = 𝐶) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶)))
9 caovcan.1 . . 3 𝐶 ∈ V
10 oveq2 6557 . . . . . 6 (𝑧 = 𝐶 → (𝑥𝐹𝑧) = (𝑥𝐹𝐶))
1110eqeq2d 2620 . . . . 5 (𝑧 = 𝐶 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝑥𝐹𝑦) = (𝑥𝐹𝐶)))
12 eqeq2 2621 . . . . 5 (𝑧 = 𝐶 → (𝑦 = 𝑧𝑦 = 𝐶))
1311, 12imbi12d 333 . . . 4 (𝑧 = 𝐶 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶)))
1413imbi2d 329 . . 3 (𝑧 = 𝐶 → (((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧)) ↔ ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))))
15 caovcan.2 . . 3 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) → 𝑦 = 𝑧))
169, 14, 15vtocl 3232 . 2 ((𝑥𝑆𝑦𝑆) → ((𝑥𝐹𝑦) = (𝑥𝐹𝐶) → 𝑦 = 𝐶))
174, 8, 16vtocl2ga 3247 1 ((𝐴𝑆𝐵𝑆) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) → 𝐵 = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  Vcvv 3173  (class class class)co 6549
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812  df-ov 6552
This theorem is referenced by:  ecopovtrn  7737
  Copyright terms: Public domain W3C validator