Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbcom2v2 | Unicode version |
Description: Lemma for proving sbcom2 1962. It is the same as sbcom2v 1960 but removes the distinct variable constraint on and . (Contributed by Jim Kingdon, 19-Feb-2018.) |
Ref | Expression |
---|---|
sbcom2v2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcom2v 1960 | . . 3 | |
2 | sbcom2v 1960 | . . . 4 | |
3 | 2 | sbbii 1738 | . . 3 |
4 | 1, 3 | bitri 183 | . 2 |
5 | ax-17 1506 | . . . 4 | |
6 | 5 | sbco2vh 1918 | . . 3 |
7 | 6 | sbbii 1738 | . 2 |
8 | ax-17 1506 | . . 3 | |
9 | 8 | sbco2vh 1918 | . 2 |
10 | 4, 7, 9 | 3bitr3i 209 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wsb 1735 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 |
This theorem is referenced by: sbcom2 1962 |
Copyright terms: Public domain | W3C validator |