| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvrexfw | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. Version of cbvrexf 2731 with a disjoint variable condition. Although we don't do so yet, we expect this disjoint variable condition will allow us to remove reliance on ax-i12 1530 and ax-bndl 1532 in the proof. (Contributed by FL, 27-Apr-2008.) (Revised by GG, 10-Jan-2024.) |
| Ref | Expression |
|---|---|
| cbvrexfw.1 |
|
| cbvrexfw.2 |
|
| cbvrexfw.3 |
|
| cbvrexfw.4 |
|
| cbvrexfw.5 |
|
| Ref | Expression |
|---|---|
| cbvrexfw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvrexfw.2 |
. . . . 5
| |
| 2 | 1 | nfcri 2342 |
. . . 4
|
| 3 | cbvrexfw.3 |
. . . 4
| |
| 4 | 2, 3 | nfan 1588 |
. . 3
|
| 5 | cbvrexfw.1 |
. . . . 5
| |
| 6 | 5 | nfcri 2342 |
. . . 4
|
| 7 | cbvrexfw.4 |
. . . 4
| |
| 8 | 6, 7 | nfan 1588 |
. . 3
|
| 9 | eleq1w 2266 |
. . . 4
| |
| 10 | cbvrexfw.5 |
. . . 4
| |
| 11 | 9, 10 | anbi12d 473 |
. . 3
|
| 12 | 4, 8, 11 | cbvexv1 1775 |
. 2
|
| 13 | df-rex 2490 |
. 2
| |
| 14 | df-rex 2490 |
. 2
| |
| 15 | 12, 13, 14 | 3bitr4i 212 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-nf 1484 df-sb 1786 df-cleq 2198 df-clel 2201 df-nfc 2337 df-rex 2490 |
| This theorem is referenced by: cbvrexw 2733 nnwofdc 12392 |
| Copyright terms: Public domain | W3C validator |