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

Theorem spime 1976
 Description: Existential introduction, using implicit substitution. Compare Lemma 14 of [Tarski] p. 70. (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 3-Oct-2016.)
Hypotheses
Ref Expression
spime.1
spime.2
Assertion
Ref Expression
spime

Proof of Theorem spime
StepHypRef Expression
1 spime.1 . . . . 5
21nfn 1793 . . . 4
3 spime.2 . . . . 5
43con3d 125 . . . 4
52, 4spim 1975 . . 3
65con2i 112 . 2
7 df-ex 1542 . 2
86, 7sylibr 203 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4  wal 1540  wex 1541  wnf 1544 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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 This theorem is referenced by:  spimed  1977  spimev  1999
 Copyright terms: Public domain W3C validator