| 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 7616 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐵𝐹𝐴) |
| 5 | 4 | oveq1i 7428 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐵𝐹𝐴)𝐹𝐶) |
| 6 | caov.3 | . . 3 ⊢ 𝐶 ∈ V | |
| 7 | caov.ass | . . 3 ⊢ ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) | |
| 8 | 1, 2, 6, 7 | caovass 7619 | . 2 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)) |
| 9 | 2, 1, 6, 7 | caovass 7619 | . 2 ⊢ ((𝐵𝐹𝐴)𝐹𝐶) = (𝐵𝐹(𝐴𝐹𝐶)) |
| 10 | 5, 8, 9 | 3eqtr3i 2792 | 1 ⊢ (𝐴𝐹(𝐵𝐹𝐶)) = (𝐵𝐹(𝐴𝐹𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3451 (class class class)co 7418 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6493 df-fv 6545 df-ov 7421 |
| This theorem is used by: caov31 7648 caov4 7650 caovmo 7656 distrnq 11039 ltaddnq 11052 ltexnq 11053 1idpr 11107 prlem934 11111 prlem936 11125 mulcmpblnrlem 11148 ltsosr 11172 0idsr 11175 1idsr 11176 recexsrlem 11181 mulgt0sr 11183 axmulass 11235 |
| Copyright terms: Public domain | W3C validator |