| 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 1916 |
. . 3
|
| 3 | 2 | cbvex2v 1973 |
. 2
|
| 4 | cbvex4v.2 |
. . . 4
| |
| 5 | 4 | cbvex2v 1973 |
. . 3
|
| 6 | 5 | 2exbii 1655 |
. 2
|
| 7 | 3, 6 | bitri 184 |
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-7 1497 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: enq0sym 7712 addnq0mo 7727 mulnq0mo 7728 addsrmo 8023 mulsrmo 8024 |
| Copyright terms: Public domain | W3C validator |