Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sb7f | Unicode version |
Description: This version of dfsb7 1979 does not require that and be disjoint. This permits it to be used as a definition for substitution in a formalization that omits the logically redundant axiom ax-17 1514, i.e., that does not have the concept of a variable not occurring in a formula. (Contributed by NM, 26-Jul-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Ref | Expression |
---|---|
sb7f.1 |
Ref | Expression |
---|---|
sb7f |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb5 1875 | . . 3 | |
2 | 1 | sbbii 1753 | . 2 |
3 | sb7f.1 | . . 3 | |
4 | 3 | sbco2vh 1933 | . 2 |
5 | sb5 1875 | . 2 | |
6 | 2, 4, 5 | 3bitr3i 209 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wal 1341 wex 1480 wsb 1750 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-sb 1751 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |