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

Theorem ceqsrex2v 2912
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 401 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  ( x  =  A  /\  ( y  =  B  /\  ph ) ) )
21rexbii 2515 . . . . 5  |-  ( E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  E. y  e.  D  ( x  =  A  /\  ( y  =  B  /\  ph ) ) )
3 r19.42v 2665 . . . . 5  |-  ( E. y  e.  D  ( x  =  A  /\  ( y  =  B  /\  ph ) )  <-> 
( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph )
) )
42, 3bitri 184 . . . 4  |-  ( E. y  e.  D  ( ( x  =  A  /\  y  =  B )  /\  ph )  <->  ( x  =  A  /\  E. y  e.  D  ( y  =  B  /\  ph ) ) )
54rexbii 2515 . . 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 464 . . . . 5  |-  ( x  =  A  ->  (
( y  =  B  /\  ph )  <->  ( y  =  B  /\  ps )
) )
87rexbidv 2509 . . . 4  |-  ( x  =  A  ->  ( E. y  e.  D  ( y  =  B  /\  ph )  <->  E. y  e.  D  ( y  =  B  /\  ps )
) )
98ceqsrexv 2910 . . 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, 9bitrid 192 . 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 2910 . 2  |-  ( B  e.  D  ->  ( E. y  e.  D  ( y  =  B  /\  ps )  <->  ch )
)
1310, 12sylan9bb 462 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 set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2178   E.wrex 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-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-rex 2492  df-v 2778
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator