Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfunid Unicode version

Theorem nfunid 3850
 Description: Deduction version of nfuni 3849. (Contributed by NM, 18-Feb-2013.)
Hypothesis
Ref Expression
nfunid.3
Assertion
Ref Expression
nfunid

Proof of Theorem nfunid
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfuni2 3845 . 2
2 nfv 1609 . . 3
3 nfv 1609 . . . 4
4 nfunid.3 . . . 4
5 nfvd 1610 . . . 4
63, 4, 5nfrexd 2608 . . 3
72, 6nfabd 2451 . 2
81, 7nfcxfrd 2430 1
 Colors of variables: wff set class Syntax hints:   wi 4   wcel 1696  cab 2282  wnfc 2419  wrex 2557  cuni 3843 This theorem is referenced by:  dfnfc2  3861  nfiotad  5238 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277 This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ral 2561  df-rex 2562  df-uni 3844
 Copyright terms: Public domain W3C validator