Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrex | Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 31-Jul-2003.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
cbvral.1 | |
cbvral.2 | |
cbvral.3 |
Ref | Expression |
---|---|
cbvrex |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2258 | . 2 | |
2 | nfcv 2258 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvrexf 2626 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1421 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: cbvrmo 2630 cbvrexv 2632 cbvrexsv 2643 cbviun 3820 disjiun 3894 rexxpf 4656 isarep1 5179 rexrnmpt 5531 elabrex 5627 |
Copyright terms: Public domain | W3C validator |