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

Theorem ceqsex3v 3056
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 659 . . . . . 6  |-  ( ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph )  <->  ( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
2 3anass 990 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B  /\  z  =  C )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C ) ) )
32anbi1i 706 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph ) )
4 df-3an 988 . . . . . . 7  |-  ( ( y  =  B  /\  z  =  C  /\  ph )  <->  ( ( y  =  B  /\  z  =  C )  /\  ph ) )
54anbi2i 705 . . . . . 6  |-  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) )  <-> 
( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
61, 3, 53bitr4i 285 . . . . 5  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) ) )
762exbii 1723 . . . 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 1840 . . . 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 257 . . 3  |-  ( E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph ) ) )
109exbii 1722 . 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 1349 . . . . 5  |-  ( x  =  A  ->  (
( y  =  B  /\  z  =  C  /\  ph )  <->  ( y  =  B  /\  z  =  C  /\  ps )
) )
14132exbidv 1774 . . . 4  |-  ( x  =  A  ->  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ph )  <->  E. y E. z
( y  =  B  /\  z  =  C  /\  ps ) ) )
1511, 14ceqsexv 3052 . . 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 3055 . . 3  |-  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ps )  <->  th )
2115, 20bitri 257 . 2  |-  ( E. x ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
)  <->  th )
2210, 21bitri 257 1  |-  ( E. x E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph ) 
<->  th )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 189    /\ wa 375    /\ w3a 986    = wceq 1448   E.wex 1667    e. wcel 1891   _Vcvv 3013
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1673  ax-4 1686  ax-5 1762  ax-6 1809  ax-7 1855  ax-10 1919  ax-11 1924  ax-12 1937  ax-ext 2432
This theorem depends on definitions:  df-bi 190  df-an 377  df-3an 988  df-tru 1451  df-ex 1668  df-nf 1672  df-sb 1802  df-clab 2439  df-cleq 2445  df-clel 2448  df-v 3015
This theorem is referenced by:  ceqsex6v  3058
  Copyright terms: Public domain W3C validator