MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ceqsrexv Unicode version

Theorem ceqsrexv 2901
Description: Elimination of a restricted existential quantifier, using implicit substitution. (Contributed by NM, 30-Apr-2004.)
Hypothesis
Ref Expression
ceqsrexv.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
ceqsrexv  |-  ( A  e.  B  ->  ( E. x  e.  B  ( x  =  A  /\  ph )  <->  ps )
)
Distinct variable groups:    x, A    x, B    ps, x
Allowed substitution hint:    ph( x)

Proof of Theorem ceqsrexv
StepHypRef Expression
1 df-rex 2549 . . 3  |-  ( E. x  e.  B  ( x  =  A  /\  ph )  <->  E. x ( x  e.  B  /\  (
x  =  A  /\  ph ) ) )
2 an12 772 . . . 4  |-  ( ( x  =  A  /\  ( x  e.  B  /\  ph ) )  <->  ( x  e.  B  /\  (
x  =  A  /\  ph ) ) )
32exbii 1569 . . 3  |-  ( E. x ( x  =  A  /\  ( x  e.  B  /\  ph ) )  <->  E. x
( x  e.  B  /\  ( x  =  A  /\  ph ) ) )
41, 3bitr4i 243 . 2  |-  ( E. x  e.  B  ( x  =  A  /\  ph )  <->  E. x ( x  =  A  /\  (
x  e.  B  /\  ph ) ) )
5 eleq1 2343 . . . . 5  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
6 ceqsrexv.1 . . . . 5  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
75, 6anbi12d 691 . . . 4  |-  ( x  =  A  ->  (
( x  e.  B  /\  ph )  <->  ( A  e.  B  /\  ps )
) )
87ceqsexgv 2900 . . 3  |-  ( A  e.  B  ->  ( E. x ( x  =  A  /\  ( x  e.  B  /\  ph ) )  <->  ( A  e.  B  /\  ps )
) )
98bianabs 850 . 2  |-  ( A  e.  B  ->  ( E. x ( x  =  A  /\  ( x  e.  B  /\  ph ) )  <->  ps )
)
104, 9syl5bb 248 1  |-  ( A  e.  B  ->  ( E. x  e.  B  ( x  =  A  /\  ph )  <->  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   E.wex 1528    = wceq 1623    e. wcel 1684   E.wrex 2544
This theorem is referenced by:  ceqsrexbv  2902  ceqsrex2v  2903  reuxfr2d  4557  f1oiso  5848  creur  9740  creui  9741  deg1ldg  19478  ulm2  19764  reuxfr3d  23138  ceqsrexv2  24078  rmxdiophlem  27108  expdiophlem1  27114  expdiophlem2  27115  eqlkr3  29291  diclspsn  31384
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-rex 2549  df-v 2790
  Copyright terms: Public domain W3C validator