| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvalvw | Unicode version | ||
| Description: Change bound variable. See cbvalv 1966 for a version with fewer disjoint variable conditions. (Contributed by NM, 9-Apr-2017.) Avoid ax-7 1497. (Revised by GG, 25-Aug-2024.) |
| Ref | Expression |
|---|---|
| cbvalvw.1 |
|
| Ref | Expression |
|---|---|
| cbvalvw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvalvw.1 |
. . . 4
| |
| 2 | 1 | spv 1908 |
. . 3
|
| 3 | 2 | alrimiv 1922 |
. 2
|
| 4 | 1 | equcoms 1756 |
. . . . 5
|
| 5 | 4 | biimprd 158 |
. . . 4
|
| 6 | 5 | spimv 1859 |
. . 3
|
| 7 | 6 | alrimiv 1922 |
. 2
|
| 8 | 3, 7 | impbii 126 |
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 1496 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 |
| This theorem is referenced by: cbvaldvaw 1979 cbval2vw 1981 cbvralvw 2772 cbvreuvw 2774 |
| Copyright terms: Public domain | W3C validator |