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

Theorem rmobidv 2695
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 16-Jun-2017.)
Hypothesis
Ref Expression
rmobidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
rmobidv  |-  ( ph  ->  ( E* x  e.  A  ps  <->  E* x  e.  A  ch )
)
Distinct variable group:    ph, x
Allowed substitution hints:    ps( x)    ch( x)    A( x)

Proof of Theorem rmobidv
StepHypRef Expression
1 rmobidv.1 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
21adantr 276 . 2  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  ch ) )
32rmobidva 2694 1  |-  ( ph  ->  ( E* x  e.  A  ps  <->  E* x  e.  A  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    e. wcel 2176   E*wrmo 2487
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-5 1470  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-4 1533  ax-17 1549  ax-ial 1557
This theorem depends on definitions:  df-bi 117  df-nf 1484  df-eu 2057  df-mo 2058  df-rmo 2492
This theorem is referenced by:  rmoeqd  2717  disjxp1  6322
  Copyright terms: Public domain W3C validator