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

Theorem nfndOLD 1792
Description: Obsolete proof of nfnd 1791 as of 28-Dec-2017. (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
nfnd.1  F/
Assertion
Ref Expression
nfndOLD  F/

Proof of Theorem nfndOLD
StepHypRef Expression
1 nfnd.1 . 2  F/
2 nfnf1 1790 . . 3  F/ F/
3 ax6o 1750 . . . . 5
43con1i 121 . . . 4
5 df-nf 1545 . . . . 5  F/
6 con3 126 . . . . . 6
76al2imi 1561 . . . . 5
85, 7sylbi 187 . . . 4  F/
94, 8syl5 28 . . 3  F/
102, 9nfd 1766 . 2  F/  F/
111, 10syl 15 1  F/
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4  wal 1540   F/wnf 1544
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-11 1746
This theorem depends on definitions:  df-bi 177  df-ex 1542  df-nf 1545
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator