Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caov32d | Structured version Visualization version GIF version |
Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
caovd.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
caovd.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑆) |
caovd.com | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) |
caovd.ass | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) |
Ref | Expression |
---|---|
caov32d | ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caovd.com | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) | |
2 | caovd.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
3 | caovd.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
4 | 1, 2, 3 | caovcomd 6728 | . . 3 ⊢ (𝜑 → (𝐵𝐹𝐶) = (𝐶𝐹𝐵)) |
5 | 4 | oveq2d 6565 | . 2 ⊢ (𝜑 → (𝐴𝐹(𝐵𝐹𝐶)) = (𝐴𝐹(𝐶𝐹𝐵))) |
6 | caovd.ass | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) | |
7 | caovd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
8 | 6, 7, 2, 3 | caovassd 6731 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))) |
9 | 6, 7, 3, 2 | caovassd 6731 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐶)𝐹𝐵) = (𝐴𝐹(𝐶𝐹𝐵))) |
10 | 5, 8, 9 | 3eqtr4d 2654 | 1 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐴𝐹𝐶)𝐹𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 (class class class)co 6549 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-iota 5768 df-fv 5812 df-ov 6552 |
This theorem is referenced by: caov31d 6754 |
Copyright terms: Public domain | W3C validator |