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

Theorem 19.8a 1639
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 1544 . . . 4  |-  ( E. x ph  ->  A. x E. x ph )
3219.23h 1547 . . 3  |-  ( A. x ( ph  ->  E. x ph )  <->  ( E. x ph  ->  E. x ph ) )
41, 3mpbir 146 . 2  |-  A. x
( ph  ->  E. x ph )
54spi 1585 1  |-  ( ph  ->  E. x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1396   E.wex 1541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  19.8ad  1640  19.23bi  1641  exim  1648  19.43  1677  hbex  1685  19.2  1687  19.9t  1691  19.9h  1692  excomim  1711  19.38  1724  nexr  1740  sbequ1  1816  equs5e  1843  exdistrfor  1848  sbcof2  1858  mo2n  2107  euor2  2138  2moex  2166  2euex  2167  2moswapdc  2170  2exeu  2172  rspe  2582  rsp2e  2584  ceqex  2934  vn0m  3508  intab  3962  copsexg  4342  eusv2nf  4559  dmcosseq  5010  dminss  5158  imainss  5159  relssdmrn  5264  oprabid  6060  tfrlemibxssdm  6536  tfr1onlembxssdm  6552  tfrcllembxssdm  6565  snexxph  7192  nqprl  7831  nqpru  7832  ltsopr  7876  ltexprlemm  7880  recexprlemopl  7905  recexprlemopu  7907  suplocexprlemrl  7997  divsfval  13491
  Copyright terms: Public domain W3C validator