| 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 2546 for a version with |
| Ref | Expression |
|---|---|
| nfralw.1 |
|
| nfralw.2 |
|
| Ref | Expression |
|---|---|
| nfralw |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nftru 1489 |
. . 3
| |
| 2 | nfralw.1 |
. . . 4
| |
| 3 | 2 | a1i 9 |
. . 3
|
| 4 | nfralw.2 |
. . . 4
| |
| 5 | 4 | a1i 9 |
. . 3
|
| 6 | 1, 3, 5 | nfraldw 2538 |
. 2
|
| 7 | 6 | mptru 1382 |
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 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-4 1533 ax-17 1549 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1484 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ral 2489 |
| This theorem is referenced by: rspc2vd 3162 opabfi 7037 fprod2dlemstep 11966 fprodcom2fi 11970 nnwofdc 12392 |
| Copyright terms: Public domain | W3C validator |