Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfsbv | Unicode version |
Description: If is not free in , it is not free in when is distinct from and . Version of nfsb 1934 requiring more disjoint variables. (Contributed by Wolf Lammen, 7-Feb-2023.) Remove disjoint variable condition on . (Revised by Steven Nguyen, 13-Aug-2023.) Reduce axiom usage. (Revised by Gino Giotto, 25-Aug-2024.) |
Ref | Expression |
---|---|
nfsbv.nf |
Ref | Expression |
---|---|
nfsbv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sb 1751 | . 2 | |
2 | nfv 1516 | . . . 4 | |
3 | nfsbv.nf | . . . 4 | |
4 | 2, 3 | nfim 1560 | . . 3 |
5 | 2, 3 | nfan 1553 | . . . 4 |
6 | 5 | nfex 1625 | . . 3 |
7 | 4, 6 | nfan 1553 | . 2 |
8 | 1, 7 | nfxfr 1462 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wnf 1448 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-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-4 1498 ax-17 1514 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: sbco2v 1936 cbvabw 2289 |
Copyright terms: Public domain | W3C validator |