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

Theorem caovcang 6986
Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.)
Hypothesis
Ref Expression
caovcang.1 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
Assertion
Ref Expression
caovcang ((𝜑 ∧ (𝐴𝑇𝐵𝑆𝐶𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧

Proof of Theorem caovcang
StepHypRef Expression
1 caovcang.1 . . 3 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
21ralrimivvva 3121 . 2 (𝜑 → ∀𝑥𝑇𝑦𝑆𝑧𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
3 oveq1 6803 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
4 oveq1 6803 . . . . 5 (𝑥 = 𝐴 → (𝑥𝐹𝑧) = (𝐴𝐹𝑧))
53, 4eqeq12d 2786 . . . 4 (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ (𝐴𝐹𝑦) = (𝐴𝐹𝑧)))
65bibi1d 332 . . 3 (𝑥 = 𝐴 → (((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧)))
7 oveq2 6804 . . . . 5 (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
87eqeq1d 2773 . . . 4 (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝑧)))
9 eqeq1 2775 . . . 4 (𝑦 = 𝐵 → (𝑦 = 𝑧𝐵 = 𝑧))
108, 9bibi12d 334 . . 3 (𝑦 = 𝐵 → (((𝐴𝐹𝑦) = (𝐴𝐹𝑧) ↔ 𝑦 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧)))
11 oveq2 6804 . . . . 5 (𝑧 = 𝐶 → (𝐴𝐹𝑧) = (𝐴𝐹𝐶))
1211eqeq2d 2781 . . . 4 (𝑧 = 𝐶 → ((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ (𝐴𝐹𝐵) = (𝐴𝐹𝐶)))
13 eqeq2 2782 . . . 4 (𝑧 = 𝐶 → (𝐵 = 𝑧𝐵 = 𝐶))
1412, 13bibi12d 334 . . 3 (𝑧 = 𝐶 → (((𝐴𝐹𝐵) = (𝐴𝐹𝑧) ↔ 𝐵 = 𝑧) ↔ ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)))
156, 10, 14rspc3v 3475 . 2 ((𝐴𝑇𝐵𝑆𝐶𝑆) → (∀𝑥𝑇𝑦𝑆𝑧𝑆 ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶)))
162, 15mpan9 496 1 ((𝜑 ∧ (𝐴𝑇𝐵𝑆𝐶𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1071   = wceq 1631  wcel 2145  wral 3061  (class class class)co 6796
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4227  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-br 4788  df-iota 5993  df-fv 6038  df-ov 6799
This theorem is referenced by:  caovcand  6987  caofcan  39048
  Copyright terms: Public domain W3C validator