Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfrexd | Structured version Visualization version Unicode version |
Description: Deduction version of nfrex 3007. (Contributed by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
nfrexd.1 | |
nfrexd.2 | |
nfrexd.3 |
Ref | Expression |
---|---|
nfrexd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfrex2 2996 | . 2 | |
2 | nfrexd.1 | . . . 4 | |
3 | nfrexd.2 | . . . 4 | |
4 | nfrexd.3 | . . . . 5 | |
5 | 4 | nfnd 1785 | . . . 4 |
6 | 2, 3, 5 | nfrald 2944 | . . 3 |
7 | 6 | nfnd 1785 | . 2 |
8 | 1, 7 | nfxfrd 1780 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wnf 1708 wnfc 2751 wral 2912 wrex 2913 |
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-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 |
This theorem is referenced by: nfrex 3007 nfunid 4443 nfiund 42421 |
Copyright terms: Public domain | W3C validator |