| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvral | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 31-Jul-2003.) |
| Ref | Expression |
|---|---|
| cbvral.1 |
|
| cbvral.2 |
|
| cbvral.3 |
|
| Ref | Expression |
|---|---|
| cbvral |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2392 |
. 2
| |
| 2 | nfcv 2392 |
. 2
| |
| 3 | cbvral.1 |
. 2
| |
| 4 | cbvral.2 |
. 2
| |
| 5 | cbvral.3 |
. 2
| |
| 6 | 1, 2, 3, 4, 5 | cbvralf 2777 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 |
| This theorem is used by: cbvralv 2786 cbvralsv 2802 cbviin 4050 frind 4497 ralxpf 4926 eqfnfv2f 5810 ralrnmpt 5850 dff13f 5976 ofrfval2 6319 uchoice 6371 fmpox 6436 cbvixp 6997 mptelixpg 7016 xpf1o 7144 indstr 9993 fsum3 12154 fsum00 12229 mertenslem2 12303 fprodcl2lem 12372 fprodle 12407 ctiunctal 13332 cnmpt11 15384 cnmpt21 15392 bj-bdfindes 16975 bj-findes 17007 |
| Copyright terms: Public domain | W3C validator |