New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  nfifd Unicode version

Theorem nfifd 3685
 Description: Deduction version of nfif 3686. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 13-Oct-2016.)
Hypotheses
Ref Expression
nfifd.2
nfifd.3
nfifd.4
Assertion
Ref Expression
nfifd

Proof of Theorem nfifd
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 dfif2 3664 . 2
2 nfv 1619 . . 3
3 nfifd.4 . . . . . 6
43nfcrd 2502 . . . . 5
5 nfifd.2 . . . . 5
64, 5nfimd 1808 . . . 4
7 nfifd.3 . . . . . 6
87nfcrd 2502 . . . . 5
98, 5nfand 1822 . . . 4
106, 9nfimd 1808 . . 3
112, 10nfabd 2508 . 2
121, 11nfcxfrd 2487 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wa 358  wnf 1544   wcel 1710  cab 2339  wnfc 2476  cif 3662 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-if 3663 This theorem is referenced by:  nfif  3686
 Copyright terms: Public domain W3C validator