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 1521 | . . 3 | |
2 | nfs1v 1932 | . . 3 | |
3 | sbequ12 1764 | . . 3 | |
4 | 1, 2, 3 | cbvrex 2693 | . 2 |
5 | nfv 1521 | . . . 4 | |
6 | 5 | nfsb 1939 | . . 3 |
7 | nfv 1521 | . . 3 | |
8 | sbequ 1833 | . . 3 | |
9 | 6, 7, 8 | cbvrex 2693 | . 2 |
10 | 4, 9 | bitri 183 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 104 wsb 1755 wrex 2449 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-sb 1756 df-cleq 2163 df-clel 2166 df-nfc 2301 df-rex 2454 |
This theorem is referenced by: rspesbca 3039 rexxpf 4758 |
Copyright terms: Public domain | W3C validator |