Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvex4v | Unicode version |
Description: Rule used to change bound variables, using implicit substitition. (Contributed by NM, 26-Jul-1995.) |
Ref | Expression |
---|---|
cbvex4v.1 | |
cbvex4v.2 |
Ref | Expression |
---|---|
cbvex4v |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvex4v.1 | . . . 4 | |
2 | 1 | 2exbidv 1861 | . . 3 |
3 | 2 | cbvex2v 1917 | . 2 |
4 | cbvex4v.2 | . . . 4 | |
5 | 4 | cbvex2v 1917 | . . 3 |
6 | 5 | 2exbii 1599 | . 2 |
7 | 3, 6 | bitri 183 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 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-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 |
This theorem depends on definitions: df-bi 116 df-nf 1454 |
This theorem is referenced by: enq0sym 7381 addnq0mo 7396 mulnq0mo 7397 addsrmo 7692 mulsrmo 7693 |
Copyright terms: Public domain | W3C validator |