| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Distributive law for disjunction. Theorem *4.41 of [WhiteheadRussell] p. 119. |
| Ref | Expression |
|---|---|
| ordi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm3.26 256 |
. . . 4
| |
| 2 | 1 | orim2i 273 |
. . 3
|
| 3 | pm3.27 260 |
. . . 4
| |
| 4 | 3 | orim2i 273 |
. . 3
|
| 5 | 2, 4 | jca 236 |
. 2
|
| 6 | df-or 197 |
. . . 4
| |
| 7 | pm3.43i 235 |
. . . . 5
| |
| 8 | df-or 197 |
. . . . 5
| |
| 9 | df-or 197 |
. . . . 5
| |
| 10 | 7, 8, 9 | 3imtr4g 426 |
. . . 4
|
| 11 | 6, 10 | sylbi 174 |
. . 3
|
| 12 | 11 | imp 277 |
. 2
|
| 13 | 5, 12 | impbi 139 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ordir 453 jcab 454 andi 456 orddi 458 orbidi 510 undi 1677 undif4 1744 |
| 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 |