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

Theorem pm2.65d 166
Description: Deduction rule for proof by contradiction. (Contributed by NM, 26-Jun-1994.) (Proof shortened by Wolf Lammen, 26-May-2013.)
Hypotheses
Ref Expression
pm2.65d.1  |-  ( ph  ->  ( ps  ->  ch ) )
pm2.65d.2  |-  ( ph  ->  ( ps  ->  -.  ch ) )
Assertion
Ref Expression
pm2.65d  |-  ( ph  ->  -.  ps )

Proof of Theorem pm2.65d
StepHypRef Expression
1 pm2.65d.2 . . 3  |-  ( ph  ->  ( ps  ->  -.  ch ) )
2 pm2.65d.1 . . 3  |-  ( ph  ->  ( ps  ->  ch ) )
31, 2nsyld 132 . 2  |-  ( ph  ->  ( ps  ->  -.  ps ) )
43pm2.01d 161 1  |-  ( ph  ->  -.  ps )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4
This theorem is referenced by:  mtod  168  pm2.65da  559  unxpdomlem2  7156  cardlim  7695  winainflem  8405  winalim2  8408  discr  11331  sqrmo  11833  vdwnnlem3  13141  nmlno0lem  21485  nmlnop0iALT  22689
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
  Copyright terms: Public domain W3C validator