| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfralw | Unicode version | ||
| Description: Bound-variable hypothesis
builder for restricted quantification. See
nfralya 2537 for a version with |
| Ref | Expression |
|---|---|
| nfralw.1 |
|
| nfralw.2 |
|
| Ref | Expression |
|---|---|
| nfralw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nftru 1480 |
. . 3
| |
| 2 | nfralw.1 |
. . . 4
| |
| 3 | 2 | a1i 9 |
. . 3
|
| 4 | nfralw.2 |
. . . 4
| |
| 5 | 4 | a1i 9 |
. . 3
|
| 6 | 1, 3, 5 | nfraldw 2529 |
. 2
|
| 7 | 6 | mptru 1373 |
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-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-17 1540 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 |
| This theorem is referenced by: rspc2vd 3153 opabfi 6999 fprod2dlemstep 11787 fprodcom2fi 11791 nnwofdc 12205 |
| Copyright terms: Public domain | W3C validator |