Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvexvw | Unicode version |
Description: Change bound variable. See cbvexv 1911 for a version with fewer disjoint variable conditions. (Contributed by NM, 19-Apr-2017.) Avoid ax-7 1441. (Revised by Gino Giotto, 25-Aug-2024.) |
Ref | Expression |
---|---|
cbvalvw.1 |
Ref | Expression |
---|---|
cbvexvw |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvalvw.1 | . . . . . 6 | |
2 | 1 | biimpd 143 | . . . . 5 |
3 | 2 | equcoms 1701 | . . . 4 |
4 | 3 | spimev 1854 | . . 3 |
5 | 4 | exlimiv 1591 | . 2 |
6 | 1 | biimprd 157 | . . . 4 |
7 | 6 | spimev 1854 | . . 3 |
8 | 7 | exlimiv 1591 | . 2 |
9 | 5, 8 | impbii 125 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wex 1485 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1440 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 |
This theorem is referenced by: cbvrexvw 2701 prodmodc 11541 |
Copyright terms: Public domain | W3C validator |