Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrexcsf | Unicode version |
Description: A more general version of cbvrexf 2683 that has no distinct variable restrictions. Changes bound variables using implicit substitution. (Contributed by Andrew Salmon, 13-Jul-2011.) (Proof shortened by Mario Carneiro, 7-Dec-2014.) |
Ref | Expression |
---|---|
cbvralcsf.1 | |
cbvralcsf.2 | |
cbvralcsf.3 | |
cbvralcsf.4 | |
cbvralcsf.5 | |
cbvralcsf.6 |
Ref | Expression |
---|---|
cbvrexcsf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1515 | . . . 4 | |
2 | nfcsb1v 3073 | . . . . . 6 | |
3 | 2 | nfcri 2300 | . . . . 5 |
4 | nfsbc1v 2964 | . . . . 5 | |
5 | 3, 4 | nfan 1552 | . . . 4 |
6 | id 19 | . . . . . 6 | |
7 | csbeq1a 3049 | . . . . . 6 | |
8 | 6, 7 | eleq12d 2235 | . . . . 5 |
9 | sbceq1a 2955 | . . . . 5 | |
10 | 8, 9 | anbi12d 465 | . . . 4 |
11 | 1, 5, 10 | cbvex 1743 | . . 3 |
12 | nfcv 2306 | . . . . . . 7 | |
13 | cbvralcsf.1 | . . . . . . 7 | |
14 | 12, 13 | nfcsb 3077 | . . . . . 6 |
15 | 14 | nfcri 2300 | . . . . 5 |
16 | cbvralcsf.3 | . . . . . 6 | |
17 | 12, 16 | nfsbc 2966 | . . . . 5 |
18 | 15, 17 | nfan 1552 | . . . 4 |
19 | nfv 1515 | . . . 4 | |
20 | id 19 | . . . . . 6 | |
21 | csbeq1 3043 | . . . . . . 7 | |
22 | df-csb 3041 | . . . . . . . 8 | |
23 | cbvralcsf.2 | . . . . . . . . . . . 12 | |
24 | 23 | nfcri 2300 | . . . . . . . . . . 11 |
25 | cbvralcsf.5 | . . . . . . . . . . . 12 | |
26 | 25 | eleq2d 2234 | . . . . . . . . . . 11 |
27 | 24, 26 | sbie 1778 | . . . . . . . . . 10 |
28 | sbsbc 2950 | . . . . . . . . . 10 | |
29 | 27, 28 | bitr3i 185 | . . . . . . . . 9 |
30 | 29 | abbi2i 2279 | . . . . . . . 8 |
31 | 22, 30 | eqtr4i 2188 | . . . . . . 7 |
32 | 21, 31 | eqtrdi 2213 | . . . . . 6 |
33 | 20, 32 | eleq12d 2235 | . . . . 5 |
34 | dfsbcq 2948 | . . . . . 6 | |
35 | sbsbc 2950 | . . . . . . 7 | |
36 | cbvralcsf.4 | . . . . . . . 8 | |
37 | cbvralcsf.6 | . . . . . . . 8 | |
38 | 36, 37 | sbie 1778 | . . . . . . 7 |
39 | 35, 38 | bitr3i 185 | . . . . . 6 |
40 | 34, 39 | bitrdi 195 | . . . . 5 |
41 | 33, 40 | anbi12d 465 | . . . 4 |
42 | 18, 19, 41 | cbvex 1743 | . . 3 |
43 | 11, 42 | bitri 183 | . 2 |
44 | df-rex 2448 | . 2 | |
45 | df-rex 2448 | . 2 | |
46 | 43, 44, 45 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1342 wnf 1447 wex 1479 wsb 1749 wcel 2135 cab 2150 wnfc 2293 wrex 2443 wsbc 2946 csb 3040 |
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 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-rex 2448 df-sbc 2947 df-csb 3041 |
This theorem is referenced by: cbvrexv2 3107 |
Copyright terms: Public domain | W3C validator |