| 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 2045. (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 1542 |
. 2
|
| 3 | cbvexd.2 |
. . 3
| |
| 4 | 3 | nfrd 1543 |
. 2
|
| 5 | cbvexd.3 |
. 2
| |
| 6 | 2, 4, 5 | cbvexdh 1950 |
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 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 |
| This theorem depends on definitions: df-bi 117 df-nf 1484 |
| This theorem is referenced by: cbvexdva 1953 vtoclgft 2823 bdsepnft 15860 strcollnft 15957 |
| Copyright terms: Public domain | W3C validator |