Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvexd | Unicode version |
Description: Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1997. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.) |
Ref | Expression |
---|---|
cbvexd.1 | |
cbvexd.2 | |
cbvexd.3 |
Ref | Expression |
---|---|
cbvexd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvexd.1 | . . 3 | |
2 | 1 | nfri 1499 | . 2 |
3 | cbvexd.2 | . . 3 | |
4 | 3 | nfrd 1500 | . 2 |
5 | cbvexd.3 | . 2 | |
6 | 2, 4, 5 | cbvexdh 1906 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1440 wex 1472 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 |
This theorem depends on definitions: df-bi 116 df-nf 1441 |
This theorem is referenced by: cbvexdva 1909 vtoclgft 2762 bdsepnft 13449 strcollnft 13546 |
Copyright terms: Public domain | W3C validator |