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

Theorem pm2.61d 150
Description: Deduction eliminating an antecedent. (Contributed by NM, 27-Apr-1994.) (Proof shortened by Wolf Lammen, 12-Sep-2013.)
Hypotheses
Ref Expression
pm2.61d.1
pm2.61d.2
Assertion
Ref Expression
pm2.61d

Proof of Theorem pm2.61d
StepHypRef Expression
1 pm2.61d.2 . . . 4
21con1d 116 . . 3
3 pm2.61d.1 . . 3
42, 3syld 40 . 2
54pm2.18d 103 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem is referenced by:  pm2.61d1  151  pm2.61d2  152  pm5.21ndd  343  bija  344  pm2.61dan  766  ecase3d  909  nfsb4t  2080  pm2.61dne  2593
  Copyright terms: Public domain W3C validator