| Quantum Logic Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Lemma for unified disjunction. |
| Ref | Expression |
|---|---|
| ud1lem0c |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-i1 43 |
. . 3
| |
| 2 | df-a 39 |
. . . . . 6
| |
| 3 | df-a 39 |
. . . . . . . . 9
| |
| 4 | 3 | ax-r1 34 |
. . . . . . . 8
|
| 5 | 4 | lor 66 |
. . . . . . 7
|
| 6 | 5 | ax-r4 36 |
. . . . . 6
|
| 7 | 2, 6 | ax-r2 35 |
. . . . 5
|
| 8 | 7 | ax-r1 34 |
. . . 4
|
| 9 | 8 | con3 65 |
. . 3
|
| 10 | 1, 9 | ax-r2 35 |
. 2
|
| 11 | 10 | con2 64 |
1
|
| Colors of variables: term |
| Syntax hints: |
| This theorem is referenced by: ud1lem1 542 ud1lem3 544 u1lemc6 688 u1lem11 762 i1abs 783 sa5 818 elimcons2 851 kb10iii 875 |
| This theorem was proved from axioms: ax-a1 29 ax-a2 30 ax-r1 34 ax-r2 35 ax-r4 36 ax-r5 37 |
| This theorem depends on definitions: df-a 39 df-i1 43 |