Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbv2w | Unicode version |
Description: Rule used to change bound variables, using implicit substitution. Version of cbv2 1742 with a disjoint variable condition. (Contributed by NM, 5-Aug-1993.) (Revised by Gino Giotto, 10-Jan-2024.) |
Ref | Expression |
---|---|
cbv2w.1 | |
cbv2w.2 | |
cbv2w.3 | |
cbv2w.4 | |
cbv2w.5 |
Ref | Expression |
---|---|
cbv2w |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbv2w.1 | . . 3 | |
2 | cbv2w.2 | . . 3 | |
3 | cbv2w.3 | . . 3 | |
4 | cbv2w.4 | . . 3 | |
5 | cbv2w.5 | . . . 4 | |
6 | biimp 117 | . . . 4 | |
7 | 5, 6 | syl6 33 | . . 3 |
8 | 1, 2, 3, 4, 7 | cbv1v 1740 | . 2 |
9 | equcomi 1697 | . . . 4 | |
10 | biimpr 129 | . . . 4 | |
11 | 9, 5, 10 | syl56 34 | . . 3 |
12 | 2, 1, 4, 3, 11 | cbv1v 1740 | . 2 |
13 | 8, 12 | impbid 128 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wal 1346 wnf 1453 |
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-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 |
This theorem depends on definitions: df-bi 116 df-nf 1454 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |