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

Theorem caovcand 5865
Description: Convert an operation cancellation law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovcang.1 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
caovcand.2 (𝜑𝐴𝑇)
caovcand.3 (𝜑𝐵𝑆)
caovcand.4 (𝜑𝐶𝑆)
Assertion
Ref Expression
caovcand (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧

Proof of Theorem caovcand
StepHypRef Expression
1 id 19 . 2 (𝜑𝜑)
2 caovcand.2 . 2 (𝜑𝐴𝑇)
3 caovcand.3 . 2 (𝜑𝐵𝑆)
4 caovcand.4 . 2 (𝜑𝐶𝑆)
5 caovcang.1 . . 3 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
65caovcang 5864 . 2 ((𝜑 ∧ (𝐴𝑇𝐵𝑆𝐶𝑆)) → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
71, 2, 3, 4, 6syl13anc 1186 1 (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 930   = wceq 1299  wcel 1448  (class class class)co 5706
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-v 2643  df-un 3025  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-br 3876  df-iota 5024  df-fv 5067  df-ov 5709
This theorem is referenced by:  caovcanrd  5866  ecopovtrn  6456  ecopovtrng  6459
  Copyright terms: Public domain W3C validator