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

Theorem ceqsex3v 2650
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 393 . . . . . 6  |-  ( ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph )  <->  ( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
2 3anass 924 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B  /\  z  =  C )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C ) ) )
32anbi1i 446 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C ) )  /\  ph ) )
4 df-3an 922 . . . . . . 7  |-  ( ( y  =  B  /\  z  =  C  /\  ph )  <->  ( ( y  =  B  /\  z  =  C )  /\  ph ) )
54anbi2i 445 . . . . . 6  |-  ( ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) )  <-> 
( x  =  A  /\  ( ( y  =  B  /\  z  =  C )  /\  ph ) ) )
61, 3, 53bitr4i 210 . . . . 5  |-  ( ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  ( y  =  B  /\  z  =  C  /\  ph ) ) )
762exbii 1538 . . . 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 1831 . . . 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 182 . . 3  |-  ( E. y E. z ( ( x  =  A  /\  y  =  B  /\  z  =  C )  /\  ph )  <->  ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph ) ) )
109exbii 1537 . 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 1250 . . . . 5  |-  ( x  =  A  ->  (
( y  =  B  /\  z  =  C  /\  ph )  <->  ( y  =  B  /\  z  =  C  /\  ps )
) )
14132exbidv 1791 . . . 4  |-  ( x  =  A  ->  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ph )  <->  E. y E. z
( y  =  B  /\  z  =  C  /\  ps ) ) )
1511, 14ceqsexv 2647 . . 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 2649 . . 3  |-  ( E. y E. z ( y  =  B  /\  z  =  C  /\  ps )  <->  th )
2115, 20bitri 182 . 2  |-  ( E. x ( x  =  A  /\  E. y E. z ( y  =  B  /\  z  =  C  /\  ph )
)  <->  th )
2210, 21bitri 182 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    /\ wa 102    <-> wb 103    /\ w3a 920    = wceq 1285   E.wex 1422    e. wcel 1434   _Vcvv 2610
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-ext 2065
This theorem depends on definitions:  df-bi 115  df-3an 922  df-nf 1391  df-sb 1688  df-clab 2070  df-cleq 2076  df-clel 2079  df-v 2612
This theorem is referenced by:  ceqsex6v  2652
  Copyright terms: Public domain W3C validator