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

Theorem ceqsrex2v 3092
Description: Elimination of a restricted existential quantifier, using implicit substitution. (Contributed by NM, 29-Oct-2005.)
Hypotheses
Ref Expression
ceqsrex2v.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ceqsrex2v.2  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
ceqsrex2v  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( E. x  e.  C  E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph ) 
<->  ch ) )
Distinct variable groups:    x, y, A    x, B, y    x, C    x, D, y    ps, x    ch, y
Allowed substitution hints:    ph( x, y)    ps( y)    ch( x)    C( y)

Proof of Theorem ceqsrex2v
StepHypRef Expression
1 anass 644 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  ( x  =  A  /\  ( y  =  B  /\  ph ) ) )
21rexbii 2738 . . . . 5  |-  ( E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  E. y  e.  D  ( x  =  A  /\  ( y  =  B  /\  ph ) ) )
3 r19.42v 2873 . . . . 5  |-  ( E. y  e.  D  ( x  =  A  /\  ( y  =  B  /\  ph ) )  <-> 
( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph )
) )
42, 3bitri 249 . . . 4  |-  ( E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  ( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph ) ) )
54rexbii 2738 . . 3  |-  ( E. x  e.  C  E. y  e.  D  (
( x  =  A  /\  y  =  B )  /\  ph )  <->  E. x  e.  C  ( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph ) ) )
6 ceqsrex2v.1 . . . . . 6  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
76anbi2d 698 . . . . 5  |-  ( x  =  A  ->  (
( y  =  B  /\  ph )  <->  ( y  =  B  /\  ps )
) )
87rexbidv 2734 . . . 4  |-  ( x  =  A  ->  ( E. y  e.  D  ( y  =  B  /\  ph )  <->  E. y  e.  D  ( y  =  B  /\  ps )
) )
98ceqsrexv 3090 . . 3  |-  ( A  e.  C  ->  ( E. x  e.  C  ( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph ) )  <->  E. y  e.  D  ( y  =  B  /\  ps ) ) )
105, 9syl5bb 257 . 2  |-  ( A  e.  C  ->  ( E. x  e.  C  E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph ) 
<->  E. y  e.  D  ( y  =  B  /\  ps ) ) )
11 ceqsrex2v.2 . . 3  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
1211ceqsrexv 3090 . 2  |-  ( B  e.  D  ->  ( E. y  e.  D  ( y  =  B  /\  ps )  <->  ch )
)
1310, 12sylan9bb 694 1  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( E. x  e.  C  E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph ) 
<->  ch ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1364    e. wcel 1761   E.wrex 2714
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-10 1780  ax-12 1797  ax-13 1948  ax-ext 2422
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-clab 2428  df-cleq 2434  df-clel 2437  df-rex 2719  df-v 2972
This theorem is referenced by:  opiota  6632  brdom7disj  8694  brdom6disj  8695  lsmspsn  17143
  Copyright terms: Public domain W3C validator