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

Theorem caovcanrd 7342
 Description: Commute the arguments of an operation cancellation law. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovcang.1 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
caovcand.2 (𝜑𝐴𝑇)
caovcand.3 (𝜑𝐵𝑆)
caovcand.4 (𝜑𝐶𝑆)
caovcanrd.5 (𝜑𝐴𝑆)
caovcanrd.6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
Assertion
Ref Expression
caovcanrd (𝜑 → ((𝐵𝐹𝐴) = (𝐶𝐹𝐴) ↔ 𝐵 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧

Proof of Theorem caovcanrd
StepHypRef Expression
1 caovcanrd.6 . . . 4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
2 caovcanrd.5 . . . 4 (𝜑𝐴𝑆)
3 caovcand.3 . . . 4 (𝜑𝐵𝑆)
41, 2, 3caovcomd 7335 . . 3 (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
5 caovcand.4 . . . 4 (𝜑𝐶𝑆)
61, 2, 5caovcomd 7335 . . 3 (𝜑 → (𝐴𝐹𝐶) = (𝐶𝐹𝐴))
74, 6eqeq12d 2814 . 2 (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ (𝐵𝐹𝐴) = (𝐶𝐹𝐴)))
8 caovcang.1 . . 3 ((𝜑 ∧ (𝑥𝑇𝑦𝑆𝑧𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
9 caovcand.2 . . 3 (𝜑𝐴𝑇)
108, 9, 3, 5caovcand 7341 . 2 (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
117, 10bitr3d 284 1 (𝜑 → ((𝐵𝐹𝐴) = (𝐶𝐹𝐴) ↔ 𝐵 = 𝐶))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  (class class class)co 7145 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-v 3444  df-un 3888  df-in 3890  df-ss 3900  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4805  df-br 5035  df-iota 6291  df-fv 6340  df-ov 7148 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator