Theorem caovcanrd 7637

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

Step	Hyp	Ref	Expression
1		caovcanrd.6	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
2		caovcanrd.5	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
3		caovcand.3	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
4	1, 2, 3	caovcomd 7630	. . 3 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐵𝐹𝐴))
5		caovcand.4	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑆)
6	1, 2, 5	caovcomd 7630	. . 3 ⊢ (𝜑 → (𝐴𝐹𝐶) = (𝐶𝐹𝐴))
7	4, 6	eqeq12d 2752	. 2 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ (𝐵𝐹𝐴) = (𝐶𝐹𝐴)))
8		caovcang.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦) = (𝑥𝐹𝑧) ↔ 𝑦 = 𝑧))
9		caovcand.2	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑇)
10	8, 9, 3, 5	caovcand 7636	. 2 ⊢ (𝜑 → ((𝐴𝐹𝐵) = (𝐴𝐹𝐶) ↔ 𝐵 = 𝐶))
11	7, 10	bitr3d 281	1 ⊢ (𝜑 → ((𝐵𝐹𝐴) = (𝐶𝐹𝐴) ↔ 𝐵 = 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107  (class class class)co 7432

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ral 3061  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-iota 6513  df-fv 6568  df-ov 7435

This theorem is referenced by: (None)