| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ecase2d | Unicode version | ||
| Description: Deduction for elimination by cases. (Contributed by NM, 21-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Sep-2024.) |
| Ref | Expression |
|---|---|
| ecase2d.1 |
|
| ecase2d.2 |
|
| ecase2d.3 |
|
| ecase2d.4 |
|
| Ref | Expression |
|---|---|
| ecase2d |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecase2d.1 |
. . . 4
| |
| 2 | ecase2d.2 |
. . . 4
| |
| 3 | 1, 2 | mpnanrd 697 |
. . 3
|
| 4 | ecase2d.3 |
. . . 4
| |
| 5 | 1, 4 | mpnanrd 697 |
. . 3
|
| 6 | ioran 757 |
. . 3
| |
| 7 | 3, 5, 6 | sylanbrc 417 |
. 2
|
| 8 | ecase2d.4 |
. 2
| |
| 9 | 7, 8 | ecased 1383 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-in1 617 ax-in2 618 ax-io 714 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |