Theorem caov411d 7585

Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.)

Hypotheses

Ref	Expression
caovd.1	⊢ (𝜑 → 𝐴 ∈ 𝑆)
caovd.2	⊢ (𝜑 → 𝐵 ∈ 𝑆)
caovd.3	⊢ (𝜑 → 𝐶 ∈ 𝑆)
caovd.com	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
caovd.ass	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
caovd.4	⊢ (𝜑 → 𝐷 ∈ 𝑆)
caovd.cl	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)

Assertion

Ref	Expression
caov411d	⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐷,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caov411d

Step	Hyp	Ref	Expression
1		caovd.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
2		caovd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
3		caovd.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑆)
4		caovd.com	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥))
5		caovd.ass	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)))
6		caovd.4	. . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑆)
7		caovd.cl	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
8	1, 2, 3, 4, 5, 6, 7	caov4d 7584	. 2 ⊢ (𝜑 → ((𝐵𝐹𝐴)𝐹(𝐶𝐹𝐷)) = ((𝐵𝐹𝐶)𝐹(𝐴𝐹𝐷)))
9	4, 1, 2	caovcomd 7556	. . 3 ⊢ (𝜑 → (𝐵𝐹𝐴) = (𝐴𝐹𝐵))
10	9	oveq1d 7375	. 2 ⊢ (𝜑 → ((𝐵𝐹𝐴)𝐹(𝐶𝐹𝐷)) = ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)))
11	4, 1, 3	caovcomd 7556	. . 3 ⊢ (𝜑 → (𝐵𝐹𝐶) = (𝐶𝐹𝐵))
12	11	oveq1d 7375	. 2 ⊢ (𝜑 → ((𝐵𝐹𝐶)𝐹(𝐴𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))
13	8, 10, 12	3eqtr3d 2784	1 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹(𝐶𝐹𝐷)) = ((𝐶𝐹𝐵)𝐹(𝐴𝐹𝐷)))

Syntax hints:   → wi 4   ∧ wa 397   ∧ w3a 1093   = wceq 1548   ∈ wcel 2121  (class class class)co 7360

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-iota 6445  df-fv 6497  df-ov 7363

This theorem is referenced by: (None)