| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvralfw | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. Version of cbvralf 2756 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 1553 and ax-bndl 1555 in the proof. (Contributed by NM, 7-Mar-2004.) (Revised by GG, 23-May-2024.) |
| Ref | Expression |
|---|---|
| cbvralfw.1 |
|
| cbvralfw.2 |
|
| cbvralfw.3 |
|
| cbvralfw.4 |
|
| cbvralfw.5 |
|
| Ref | Expression |
|---|---|
| cbvralfw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvralfw.2 |
. . . . 5
| |
| 2 | 1 | nfcri 2366 |
. . . 4
|
| 3 | cbvralfw.3 |
. . . 4
| |
| 4 | 2, 3 | nfim 1618 |
. . 3
|
| 5 | cbvralfw.1 |
. . . . 5
| |
| 6 | 5 | nfcri 2366 |
. . . 4
|
| 7 | cbvralfw.4 |
. . . 4
| |
| 8 | 6, 7 | nfim 1618 |
. . 3
|
| 9 | eleq1w 2290 |
. . . 4
| |
| 10 | cbvralfw.5 |
. . . 4
| |
| 11 | 9, 10 | imbi12d 234 |
. . 3
|
| 12 | 4, 8, 11 | cbvalv1 1797 |
. 2
|
| 13 | df-ral 2513 |
. 2
| |
| 14 | df-ral 2513 |
. 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-sb 1809 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 |
| This theorem is referenced by: cbvralw 2758 nnwofdc 12559 |
| Copyright terms: Public domain | W3C validator |