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 2178 | . 2 | |
2 | nfcv 2178 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvralf 2527 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 98 wnf 1349 wral 2306 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 |
This theorem is referenced by: cbvralv 2533 cbvralsv 2544 cbviin 3695 frind 4089 ralxpf 4482 eqfnfv2f 5269 ralrnmpt 5309 dff13f 5409 ofrfval2 5727 fmpt2x 5826 indstr 8536 bj-bdfindes 10074 bj-findes 10106 |
Copyright terms: Public domain | W3C validator |