![]() |
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 3512 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | nfpr.1 |
. . . . 5
![]() ![]() ![]() ![]() | |
3 | 2 | nfeq2 2267 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfpr.2 |
. . . . 5
![]() ![]() ![]() ![]() | |
5 | 4 | nfeq2 2267 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
6 | 3, 5 | nfor 1536 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | nfab 2260 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 1, 7 | nfcxfr 2252 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 |
This theorem depends on definitions: df-bi 116 df-tru 1317 df-nf 1420 df-sb 1719 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-v 2659 df-un 3041 df-sn 3499 df-pr 3500 |
This theorem is referenced by: nfsn 3549 nfop 3687 |
Copyright terms: Public domain | W3C validator |