Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvexv1 | Unicode version |
Description: Rule used to change bound variables, using implicit substitution. Version of cbvex 1744 with a disjoint variable condition. See cbvexvw 1908 for a version with two disjoint variable conditions, and cbvexv 1906 for another variant. (Contributed by NM, 21-Jun-1993.) (Revised by BJ, 31-May-2019.) |
Ref | Expression |
---|---|
cbvalv1.nf1 | |
cbvalv1.nf2 | |
cbvalv1.1 |
Ref | Expression |
---|---|
cbvexv1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvalv1.nf2 | . . . 4 | |
2 | 1 | nfex 1625 | . . 3 |
3 | cbvalv1.nf1 | . . . . . 6 | |
4 | 3 | nfri 1507 | . . . . 5 |
5 | cbvalv1.1 | . . . . . . 7 | |
6 | 5 | bicomd 140 | . . . . . 6 |
7 | 6 | equcoms 1696 | . . . . 5 |
8 | 4, 7 | equsex 1716 | . . . 4 |
9 | exsimpr 1606 | . . . 4 | |
10 | 8, 9 | sylbir 134 | . . 3 |
11 | 2, 10 | exlimi 1582 | . 2 |
12 | 3 | nfex 1625 | . . 3 |
13 | 1 | nfri 1507 | . . . . 5 |
14 | 13, 5 | equsex 1716 | . . . 4 |
15 | exsimpr 1606 | . . . 4 | |
16 | 14, 15 | sylbir 134 | . . 3 |
17 | 12, 16 | exlimi 1582 | . 2 |
18 | 11, 17 | impbii 125 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wnf 1448 wex 1480 |
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 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 |
This theorem depends on definitions: df-bi 116 df-nf 1449 |
This theorem is referenced by: cbvrexfw 2684 fprod2dlemstep 11563 |
Copyright terms: Public domain | W3C validator |