| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvex2v | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.) |
| Ref | Expression |
|---|---|
| cbval2v.1 |
|
| Ref | Expression |
|---|---|
| cbvex2v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1542 |
. 2
| |
| 2 | nfv 1542 |
. 2
| |
| 3 | nfv 1542 |
. 2
| |
| 4 | nfv 1542 |
. 2
| |
| 5 | cbval2v.1 |
. 2
| |
| 6 | 1, 2, 3, 4, 5 | cbvex2 1937 |
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 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 |
| This theorem is referenced by: cbvex4v 1949 th3qlem1 6697 |
| Copyright terms: Public domain | W3C validator |