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

Theorem ceqsex3v 2839
Description: Elimination of three existential quantifiers, using implicit substitution. (Contributed by NM, 16-Aug-2011.)
Hypotheses
Ref Expression
ceqsex3v.1  |-  A  e. 
_V
ceqsex3v.2  |-  B  e. 
_V
ceqsex3v.3  |-  C  e. 
_V
ceqsex3v.4  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ceqsex3v.5  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
ceqsex3v.6  |-  ( z  =  C  ->  ( ch 
<->  th ) )
Assertion
Ref Expression
ceqsex3v  |-  ( E. x E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph ) 
<->  th )
Distinct variable groups:    x, y,
z, A    x, B, y, z    x, C, y, z    ps, x    ch, y    th, z
Allowed substitution hints:    ph( x, y, z)    ps( y, z)    ch( x, z)    th( x, y)

Proof of Theorem ceqsex3v
StepHypRef Expression
1 anass 630 . . . . . 6  |-  ( ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph )  <->  ( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
2 3anass 938 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B  /\  z  =  C )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C ) ) )
32anbi1i 676 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph ) )
4 df-3an 936 . . . . . . 7  |-  ( ( y  =  B  /\  z  =  C  /\  ph )  <->  ( ( y  =  B  /\  z  =  C )  /\  ph ) )
54anbi2i 675 . . . . . 6  |-  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) )  <-> 
( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
61, 3, 53bitr4i 268 . . . . 5  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) ) )
762exbii 1573 . . . 4  |-  ( E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  E. y E. z ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) ) )
8 19.42vv 1860 . . . 4  |-  ( E. y E. z ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) )  <-> 
( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
) )
97, 8bitri 240 . . 3  |-  ( E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph ) ) )
109exbii 1572 . 2  |-  ( E. x E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph ) 
<->  E. x ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
) )
11 ceqsex3v.1 . . . 4  |-  A  e. 
_V
12 ceqsex3v.4 . . . . . 6  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
13123anbi3d 1258 . . . . 5  |-  ( x  =  A  ->  (
( y  =  B  /\  z  =  C  /\  ph )  <->  ( y  =  B  /\  z  =  C  /\  ps )
) )
14132exbidv 1618 . . . 4  |-  ( x  =  A  ->  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ph )  <->  E. y E. z
( y  =  B  /\  z  =  C  /\  ps ) ) )
1511, 14ceqsexv 2836 . . 3  |-  ( E. x ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
)  <->  E. y E. z
( y  =  B  /\  z  =  C  /\  ps ) )
16 ceqsex3v.2 . . . 4  |-  B  e. 
_V
17 ceqsex3v.3 . . . 4  |-  C  e. 
_V
18 ceqsex3v.5 . . . 4  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
19 ceqsex3v.6 . . . 4  |-  ( z  =  C  ->  ( ch 
<->  th ) )
2016, 17, 18, 19ceqsex2v 2838 . . 3  |-  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ps )  <->  th )
2115, 20bitri 240 . 2  |-  ( E. x ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
)  <->  th )
2210, 21bitri 240 1  |-  ( E. x E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph ) 
<->  th )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934   E.wex 1531    = wceq 1632    e. wcel 1696   _Vcvv 2801
This theorem is referenced by:  ceqsex6v  2841
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-v 2803
  Copyright terms: Public domain W3C validator