| 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 2036. (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 1542 |
. 2
| |
| 2 | cbvald.1 |
. 2
| |
| 3 | cbvald.2 |
. 2
| |
| 4 | nfv 1542 |
. . 3
| |
| 5 | 4 | a1i 9 |
. 2
|
| 6 | cbvald.3 |
. 2
| |
| 7 | 1, 2, 3, 5, 6 | cbv2 1763 |
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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 |
| This theorem is referenced by: cbvaldva 1943 |
| Copyright terms: Public domain | W3C validator |