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

Theorem nfbidOLD 1833
Description: Obsolete proof of nfbid 1832 as of 29-Dec-2017. (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfbid.1  F/
nfbid.2  F/
Assertion
Ref Expression
nfbidOLD  F/

Proof of Theorem nfbidOLD
StepHypRef Expression
1 dfbi1 184 . 2
2 nfbid.1 . . . . 5  F/
3 nfbid.2 . . . . 5  F/
42, 3nfimd 1808 . . . 4  F/
53, 2nfimd 1808 . . . . 5  F/
65nfnd 1791 . . . 4  F/
74, 6nfimd 1808 . . 3  F/
87nfnd 1791 . 2  F/
91, 8nfxfrd 1571 1  F/
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wb 176   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