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

Theorem r19.37 2462
Description: Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. In classical logic the converse would hold if  A has at least one element, but that is not sufficient in intuitionistic logic. (Contributed by FL, 13-May-2012.) (Revised by Mario Carneiro, 11-Dec-2016.)
Hypothesis
Ref Expression
r19.37.1  |-  F/ x ph
Assertion
Ref Expression
r19.37  |-  ( E. x  e.  A  (
ph  ->  ps )  -> 
( ph  ->  E. x  e.  A  ps )
)

Proof of Theorem r19.37
StepHypRef Expression
1 r19.37.1 . . 3  |-  F/ x ph
2 ax-1 5 . . 3  |-  ( ph  ->  ( x  e.  A  ->  ph ) )
31, 2ralrimi 2390 . 2  |-  ( ph  ->  A. x  e.  A  ph )
4 r19.35-1 2460 . 2  |-  ( E. x  e.  A  (
ph  ->  ps )  -> 
( A. x  e.  A  ph  ->  E. x  e.  A  ps )
)
53, 4syl5 28 1  |-  ( E. x  e.  A  (
ph  ->  ps )  -> 
( ph  ->  E. x  e.  A  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/wnf 1349    e. wcel 1393   A.wral 2306   E.wrex 2307
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-ial 1427
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-ral 2311  df-rex 2312
This theorem is referenced by:  r19.37av  2463
  Copyright terms: Public domain W3C validator