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

Theorem r19.35-1 2504
Description: Restricted quantifier version of 19.35-1 1555. (Contributed by Jim Kingdon, 4-Jun-2018.)
Assertion
Ref Expression
r19.35-1  |-  ( E. x  e.  A  (
ph  ->  ps )  -> 
( A. x  e.  A  ph  ->  E. x  e.  A  ps )
)

Proof of Theorem r19.35-1
StepHypRef Expression
1 r19.29 2494 . . 3  |-  ( ( A. x  e.  A  ph 
/\  E. x  e.  A  ( ph  ->  ps )
)  ->  E. x  e.  A  ( ph  /\  ( ph  ->  ps ) ) )
2 pm3.35 339 . . . 4  |-  ( (
ph  /\  ( ph  ->  ps ) )  ->  ps )
32reximi 2458 . . 3  |-  ( E. x  e.  A  (
ph  /\  ( ph  ->  ps ) )  ->  E. x  e.  A  ps )
41, 3syl 14 . 2  |-  ( ( A. x  e.  A  ph 
/\  E. x  e.  A  ( ph  ->  ps )
)  ->  E. x  e.  A  ps )
54expcom 114 1  |-  ( E. x  e.  A  (
ph  ->  ps )  -> 
( A. x  e.  A  ph  ->  E. x  e.  A  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102   A.wral 2348   E.wrex 2349
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-ial 1467
This theorem depends on definitions:  df-bi 115  df-ral 2353  df-rex 2354
This theorem is referenced by:  r19.36av  2505  r19.37  2506  iinexgm  3929  bndndx  8287
  Copyright terms: Public domain W3C validator