![]() |
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 2017. (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 1519 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | cbvexd.2 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 3 | nfrd 1520 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
5 | cbvexd.3 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
6 | 2, 4, 5 | cbvexdh 1926 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 |
This theorem depends on definitions: df-bi 117 df-nf 1461 |
This theorem is referenced by: cbvexdva 1929 vtoclgft 2787 bdsepnft 14499 strcollnft 14596 |
Copyright terms: Public domain | W3C validator |