![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > caov12 | Structured version Visualization version GIF version |
Description: Rearrange arguments in a commutative, associative operation. (Contributed by NM, 26-Aug-1995.) |
Ref | Expression |
---|---|
caov.1 | ⊢ 𝐴 ∈ V |
caov.2 | ⊢ 𝐵 ∈ V |
caov.3 | ⊢ 𝐶 ∈ V |
caov.com | ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥) |
caov.ass | ⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) |
Ref | Expression |
---|---|
caov12 | ⊢ (𝐴𝐹(𝐵𝐹𝐶)) = (𝐵𝐹(𝐴𝐹𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caov.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | caov.2 | . . . 4 ⊢ 𝐵 ∈ V | |
3 | caov.com | . . . 4 ⊢ (𝑥𝐹𝑦) = (𝑦𝐹𝑥) | |
4 | 1, 2, 3 | caovcom 6873 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴) |
5 | 4 | oveq1i 6700 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐵𝐹𝐴)𝐹𝐶) |
6 | caov.3 | . . 3 ⊢ 𝐶 ∈ V | |
7 | caov.ass | . . 3 ⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) | |
8 | 1, 2, 6, 7 | caovass 6876 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) |
9 | 2, 1, 6, 7 | caovass 6876 | . 2 ⊢ ((𝐵𝐹𝐴)𝐹𝐶) = (𝐵𝐹(𝐴𝐹𝐶)) |
10 | 5, 8, 9 | 3eqtr3i 2681 | 1 ⊢ (𝐴𝐹(𝐵𝐹𝐶)) = (𝐵𝐹(𝐴𝐹𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1523 ∈ wcel 2030 Vcvv 3231 (class class class)co 6690 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-br 4686 df-iota 5889 df-fv 5934 df-ov 6693 |
This theorem is referenced by: caov31 6905 caov4 6907 caovmo 6913 distrnq 9821 ltaddnq 9834 ltexnq 9835 1idpr 9889 prlem934 9893 prlem936 9907 mulcmpblnrlem 9929 ltsosr 9953 0idsr 9956 1idsr 9957 recexsrlem 9962 mulgt0sr 9964 axmulass 10016 |
Copyright terms: Public domain | W3C validator |