![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nfpr | Unicode version |
Description: Bound-variable hypothesis builder for unordered pairs. (Contributed by NM, 14-Nov-1995.) |
Ref | Expression |
---|---|
nfpr.1 |
![]() ![]() ![]() ![]() |
nfpr.2 |
![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
nfpr |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfpr2 3610 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | nfpr.1 |
. . . . 5
![]() ![]() ![]() ![]() | |
3 | 2 | nfeq2 2331 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfpr.2 |
. . . . 5
![]() ![]() ![]() ![]() | |
5 | 4 | nfeq2 2331 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
6 | 3, 5 | nfor 1574 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | nfab 2324 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 1, 7 | nfcxfr 2316 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-un 3133 df-sn 3597 df-pr 3598 |
This theorem is referenced by: nfsn 3651 nfop 3792 |
Copyright terms: Public domain | W3C validator |