| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Commutation law for triple conjunction. |
| Ref | Expression |
|---|---|
| 3ancoma |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 333 |
. . 3
| |
| 2 | 1 | anbi1i 368 |
. 2
|
| 3 | df-3an 583 |
. 2
| |
| 4 | df-3an 583 |
. 2
| |
| 5 | 2, 3, 4 | 3bitr4 158 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: 3ancomb 589 3anrev 590 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-3an 583 |