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

Theorem rexbida 2461
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 6-Oct-2003.)
Hypotheses
Ref Expression
ralbida.1  |-  F/ x ph
ralbida.2  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
rexbida  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  A  ch )
)

Proof of Theorem rexbida
StepHypRef Expression
1 ralbida.1 . . 3  |-  F/ x ph
2 ralbida.2 . . . 4  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  ch ) )
32pm5.32da 448 . . 3  |-  ( ph  ->  ( ( x  e.  A  /\  ps )  <->  ( x  e.  A  /\  ch ) ) )
41, 3exbid 1604 . 2  |-  ( ph  ->  ( E. x ( x  e.  A  /\  ps )  <->  E. x ( x  e.  A  /\  ch ) ) )
5 df-rex 2450 . 2  |-  ( E. x  e.  A  ps  <->  E. x ( x  e.  A  /\  ps )
)
6 df-rex 2450 . 2  |-  ( E. x  e.  A  ch  <->  E. x ( x  e.  A  /\  ch )
)
74, 5, 63bitr4g 222 1  |-  ( ph  ->  ( E. x  e.  A  ps  <->  E. x  e.  A  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   F/wnf 1448   E.wex 1480    e. wcel 2136   E.wrex 2445
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-4 1498  ax-ial 1522
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-rex 2450
This theorem is referenced by:  rexbidva  2463  rexbid  2465  rexbi  2599  dfiun2g  3898  fun11iun  5453  ismkvnex  7119  mkvprop  7122
  Copyright terms: Public domain W3C validator