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

Theorem spsbe 2075
Description: A specialization theorem. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
spsbe

Proof of Theorem spsbe
StepHypRef Expression
1 stdpc4 2024 . . . 4
2 sbn 2062 . . . 4
31, 2sylib 188 . . 3
43con2i 112 . 2
5 df-ex 1542 . 2
64, 5sylibr 203 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4  wal 1540  wex 1541  wsb 1648
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-7 1734  ax-11 1746  ax-12 1925
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator