![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > caov13d | 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 |
---|---|
caov13d | ⊢ (𝜑 → (𝐴𝐹(𝐵𝐹𝐶)) = (𝐶𝐹(𝐵𝐹𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caovd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
2 | caovd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
3 | caovd.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
4 | caovd.com | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐹𝑦) = (𝑦𝐹𝑥)) | |
5 | caovd.ass | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) | |
6 | 1, 2, 3, 4, 5 | caov31d 6050 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = ((𝐶𝐹𝐵)𝐹𝐴)) |
7 | 5, 1, 2, 3 | caovassd 6027 | . 2 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))) |
8 | 5, 3, 2, 1 | caovassd 6027 | . 2 ⊢ (𝜑 → ((𝐶𝐹𝐵)𝐹𝐴) = (𝐶𝐹(𝐵𝐹𝐴))) |
9 | 6, 7, 8 | 3eqtr3d 2218 | 1 ⊢ (𝜑 → (𝐴𝐹(𝐵𝐹𝐶)) = (𝐶𝐹(𝐵𝐹𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 (class class class)co 5868 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2739 df-un 3133 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-iota 5173 df-fv 5219 df-ov 5871 |
This theorem is referenced by: enq0tr 7411 mullocprlem 7547 mulcmpblnrlemg 7717 |
Copyright terms: Public domain | W3C validator |