Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvralf | Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 7-Mar-2004.) (Revised by Mario Carneiro, 9-Oct-2016.) |
Ref | Expression |
---|---|
cbvralf.1 | |
cbvralf.2 | |
cbvralf.3 | |
cbvralf.4 | |
cbvralf.5 |
Ref | Expression |
---|---|
cbvralf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1421 | . . . 4 | |
2 | cbvralf.1 | . . . . . 6 | |
3 | 2 | nfcri 2172 | . . . . 5 |
4 | nfs1v 1815 | . . . . 5 | |
5 | 3, 4 | nfim 1464 | . . . 4 |
6 | eleq1 2100 | . . . . 5 | |
7 | sbequ12 1654 | . . . . 5 | |
8 | 6, 7 | imbi12d 223 | . . . 4 |
9 | 1, 5, 8 | cbval 1637 | . . 3 |
10 | cbvralf.2 | . . . . . 6 | |
11 | 10 | nfcri 2172 | . . . . 5 |
12 | cbvralf.3 | . . . . . 6 | |
13 | 12 | nfsb 1822 | . . . . 5 |
14 | 11, 13 | nfim 1464 | . . . 4 |
15 | nfv 1421 | . . . 4 | |
16 | eleq1 2100 | . . . . 5 | |
17 | sbequ 1721 | . . . . . 6 | |
18 | cbvralf.4 | . . . . . . 7 | |
19 | cbvralf.5 | . . . . . . 7 | |
20 | 18, 19 | sbie 1674 | . . . . . 6 |
21 | 17, 20 | syl6bb 185 | . . . . 5 |
22 | 16, 21 | imbi12d 223 | . . . 4 |
23 | 14, 15, 22 | cbval 1637 | . . 3 |
24 | 9, 23 | bitri 173 | . 2 |
25 | df-ral 2311 | . 2 | |
26 | df-ral 2311 | . 2 | |
27 | 24, 25, 26 | 3bitr4i 201 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 98 wal 1241 wnf 1349 wcel 1393 wsb 1645 wnfc 2165 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: cbvral 2529 ffnfvf 5324 |
Copyright terms: Public domain | W3C validator |