![]() |
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 7604 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴) |
5 | 4 | oveq1i 7419 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐵𝐹𝐴)𝐹𝐶) |
6 | caov.3 | . . 3 ⊢ 𝐶 ∈ V | |
7 | caov.ass | . . 3 ⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) | |
8 | 1, 2, 6, 7 | caovass 7607 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) |
9 | 2, 1, 6, 7 | caovass 7607 | . 2 ⊢ ((𝐵𝐹𝐴)𝐹𝐶) = (𝐵𝐹(𝐴𝐹𝐶)) |
10 | 5, 8, 9 | 3eqtr3i 2769 | 1 ⊢ (𝐴𝐹(𝐵𝐹𝐶)) = (𝐵𝐹(𝐴𝐹𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1542 ∈ wcel 2107 Vcvv 3475 (class class class)co 7409 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-rab 3434 df-v 3477 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-iota 6496 df-fv 6552 df-ov 7412 |
This theorem is referenced by: caov31 7636 caov4 7638 caovmo 7644 distrnq 10956 ltaddnq 10969 ltexnq 10970 1idpr 11024 prlem934 11028 prlem936 11042 mulcmpblnrlem 11065 ltsosr 11089 0idsr 11092 1idsr 11093 recexsrlem 11098 mulgt0sr 11100 axmulass 11152 |
Copyright terms: Public domain | W3C validator |