| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbal1 | Unicode version | ||
| Description: A theorem used in
elimination of disjoint variable restriction on |
| Ref | Expression |
|---|---|
| sbal1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbal 1917 |
. . . 4
| |
| 2 | 1 | sbbii 1688 |
. . 3
|
| 3 | sbal1yz 1918 |
. . 3
| |
| 4 | 2, 3 | syl5bb 190 |
. 2
|
| 5 | ax-17 1459 |
. . 3
| |
| 6 | 5 | sbco2v 1862 |
. 2
|
| 7 | ax-17 1459 |
. . . 4
| |
| 8 | 7 | sbco2v 1862 |
. . 3
|
| 9 | 8 | albii 1399 |
. 2
|
| 10 | 4, 6, 9 | 3bitr3g 220 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
| This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |