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 3589 | . 2 | |
2 | nfpr.1 | . . . . 5 | |
3 | 2 | nfeq2 2318 | . . . 4 |
4 | nfpr.2 | . . . . 5 | |
5 | 4 | nfeq2 2318 | . . . 4 |
6 | 3, 5 | nfor 1561 | . . 3 |
7 | 6 | nfab 2311 | . 2 |
8 | 1, 7 | nfcxfr 2303 | 1 |
Colors of variables: wff set class |
Syntax hints: wo 698 wceq 1342 cab 2150 wnfc 2293 cpr 3571 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-v 2723 df-un 3115 df-sn 3576 df-pr 3577 |
This theorem is referenced by: nfsn 3630 nfop 3768 |
Copyright terms: Public domain | W3C validator |