Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrexsv | Unicode version |
Description: Change bound variable by using a substitution. (Contributed by NM, 2-Mar-2008.) (Revised by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
cbvrexsv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1493 | . . 3 | |
2 | nfs1v 1892 | . . 3 | |
3 | sbequ12 1729 | . . 3 | |
4 | 1, 2, 3 | cbvrex 2628 | . 2 |
5 | nfv 1493 | . . . 4 | |
6 | 5 | nfsb 1899 | . . 3 |
7 | nfv 1493 | . . 3 | |
8 | sbequ 1796 | . . 3 | |
9 | 6, 7, 8 | cbvrex 2628 | . 2 |
10 | 4, 9 | bitri 183 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wsb 1720 wrex 2394 |
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-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-sb 1721 df-cleq 2110 df-clel 2113 df-nfc 2247 df-rex 2399 |
This theorem is referenced by: rspesbca 2965 rexxpf 4656 |
Copyright terms: Public domain | W3C validator |