| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Double distributive law for disjunction. |
| Ref | Expression |
|---|---|
| orddi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordir 453 |
. 2
| |
| 2 | ordi 452 |
. . 3
| |
| 3 | ordi 452 |
. . 3
| |
| 4 | 2, 3 | anbi12i 369 |
. 2
|
| 5 | 1, 4 | bitr 151 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-or 197 df-an 198 |