Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbcom2v2 | Unicode version |
Description: Lemma for proving sbcom2 1904. It is the same as sbcom2v 1902 but removes the distinct variable constraint on and . (Contributed by Jim Kingdon, 19-Feb-2018.) |
Ref | Expression |
---|---|
sbcom2v2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcom2v 1902 | . . 3 | |
2 | sbcom2v 1902 | . . . 4 | |
3 | 2 | sbbii 1688 | . . 3 |
4 | 1, 3 | bitri 182 | . 2 |
5 | ax-17 1459 | . . . 4 | |
6 | 5 | sbco2v 1862 | . . 3 |
7 | 6 | sbbii 1688 | . 2 |
8 | ax-17 1459 | . . 3 | |
9 | 8 | sbco2v 1862 | . 2 |
10 | 4, 7, 9 | 3bitr3i 208 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 103 wsb 1685 |
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-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-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: sbcom2 1904 |
Copyright terms: Public domain | W3C validator |