ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  19.8a Unicode version

Theorem 19.8a 1583
Description: If a wff is true, then it is true for at least one instance. Special case of Theorem 19.8 of [Margaris] p. 89. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
19.8a  |-  ( ph  ->  E. x ph )

Proof of Theorem 19.8a
StepHypRef Expression
1 id 19 . . 3  |-  ( E. x ph  ->  E. x ph )
2 hbe1 1488 . . . 4  |-  ( E. x ph  ->  A. x E. x ph )
3219.23h 1491 . . 3  |-  ( A. x ( ph  ->  E. x ph )  <->  ( E. x ph  ->  E. x ph ) )
41, 3mpbir 145 . 2  |-  A. x
( ph  ->  E. x ph )
54spi 1529 1  |-  ( ph  ->  E. x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1346   E.wex 1485
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  19.8ad  1584  19.23bi  1585  exim  1592  19.43  1621  hbex  1629  19.2  1631  19.9t  1635  19.9h  1636  excomim  1656  19.38  1669  nexr  1685  sbequ1  1761  equs5e  1788  exdistrfor  1793  sbcof2  1803  mo2n  2047  euor2  2077  2moex  2105  2euex  2106  2moswapdc  2109  2exeu  2111  rspe  2519  rsp2e  2521  ceqex  2857  vn0m  3426  intab  3860  copsexg  4229  eusv2nf  4441  dmcosseq  4882  dminss  5025  imainss  5026  relssdmrn  5131  oprabid  5885  tfrlemibxssdm  6306  tfr1onlembxssdm  6322  tfrcllembxssdm  6335  snexxph  6927  nqprl  7513  nqpru  7514  ltsopr  7558  ltexprlemm  7562  recexprlemopl  7587  recexprlemopu  7589  suplocexprlemrl  7679
  Copyright terms: Public domain W3C validator