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

Theorem nforOLD 2244
Description: Obsolete proof of nfor 1834 as of 6-Oct-2021. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 11-Aug-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfOLD.1  |-  F/ x ph
nfOLD.2  |-  F/ x ps
Assertion
Ref Expression
nforOLD  |-  F/ x
( ph  \/  ps )

Proof of Theorem nforOLD
StepHypRef Expression
1 df-or 385 . 2  |-  ( (
ph  \/  ps )  <->  ( -.  ph  ->  ps )
)
2 nfOLD.1 . . . 4  |-  F/ x ph
32nfnOLD 2210 . . 3  |-  F/ x  -.  ph
4 nfOLD.2 . . 3  |-  F/ x ps
53, 4nfimOLD 2229 . 2  |-  F/ x
( -.  ph  ->  ps )
61, 5nfxfrOLD 1837 1  |-  F/ x
( ph  \/  ps )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 383   F/wnfOLD 1709
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-10 2019  ax-12 2047
This theorem depends on definitions:  df-bi 197  df-or 385  df-ex 1705  df-nf 1710  df-nfOLD 1721
This theorem is referenced by:  nf3orOLD  2245
  Copyright terms: Public domain W3C validator