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

Theorem r19.40 2514
Description: Restricted quantifier version of Theorem 19.40 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)
Assertion
Ref Expression
r19.40  |-  ( E. x  e.  A  (
ph  /\  ps )  ->  ( E. x  e.  A  ph  /\  E. x  e.  A  ps ) )

Proof of Theorem r19.40
StepHypRef Expression
1 simpl 107 . . 3  |-  ( (
ph  /\  ps )  ->  ph )
21reximi 2464 . 2  |-  ( E. x  e.  A  (
ph  /\  ps )  ->  E. x  e.  A  ph )
3 simpr 108 . . 3  |-  ( (
ph  /\  ps )  ->  ps )
43reximi 2464 . 2  |-  ( E. x  e.  A  (
ph  /\  ps )  ->  E. x  e.  A  ps )
52, 4jca 300 1  |-  ( E. x  e.  A  (
ph  /\  ps )  ->  ( E. x  e.  A  ph  /\  E. x  e.  A  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102   E.wrex 2354
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 1377  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-4 1441  ax-ial 1468
This theorem depends on definitions:  df-bi 115  df-ral 2358  df-rex 2359
This theorem is referenced by:  rexanuz  10248
  Copyright terms: Public domain W3C validator