![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfpr | Structured version Visualization version 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 4195 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | nfpr.1 |
. . . . 5
![]() ![]() ![]() ![]() | |
3 | 2 | nfeq2 2780 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
4 | nfpr.2 |
. . . . 5
![]() ![]() ![]() ![]() | |
5 | 4 | nfeq2 2780 |
. . . 4
![]() ![]() ![]() ![]() ![]() ![]() |
6 | 3, 5 | nfor 1834 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
7 | 6 | nfab 2769 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 1, 7 | nfcxfr 2762 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff setvar class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 df-un 3579 df-sn 4178 df-pr 4180 |
This theorem is referenced by: nfsn 4242 nfop 4418 nfaltop 32087 |
Copyright terms: Public domain | W3C validator |