Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvald | Unicode version |
Description: Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1934. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Revised by Wolf Lammen, 13-May-2018.) |
Ref | Expression |
---|---|
cbvald.1 | |
cbvald.2 | |
cbvald.3 |
Ref | Expression |
---|---|
cbvald |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1461 | . 2 | |
2 | cbvald.1 | . 2 | |
3 | cbvald.2 | . 2 | |
4 | nfv 1461 | . . 3 | |
5 | 4 | a1i 9 | . 2 |
6 | cbvald.3 | . 2 | |
7 | 1, 2, 3, 5, 6 | cbv2 1675 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 103 wal 1282 wnf 1389 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
This theorem depends on definitions: df-bi 115 df-nf 1390 |
This theorem is referenced by: cbvaldva 1844 |
Copyright terms: Public domain | W3C validator |