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

Theorem ceqsex4v 2597
Description: Elimination of four existential quantifiers, using implicit substitution. (Contributed by NM, 23-Sep-2011.)
Hypotheses
Ref Expression
ceqsex4v.1  |-  A  e. 
_V
ceqsex4v.2  |-  B  e. 
_V
ceqsex4v.3  |-  C  e. 
_V
ceqsex4v.4  |-  D  e. 
_V
ceqsex4v.7  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ceqsex4v.8  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
ceqsex4v.9  |-  ( z  =  C  ->  ( ch 
<->  th ) )
ceqsex4v.10  |-  ( w  =  D  ->  ( th 
<->  ta ) )
Assertion
Ref Expression
ceqsex4v  |-  ( E. x E. y E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  ta )
Distinct variable groups:    x, y, z, w, A    x, B, y, z, w    x, C, y, z, w    x, D, y, z, w    ps, x    ch, y    th, z    ta, w
Allowed substitution hints:    ph( x, y, z, w)    ps( y, z, w)    ch( x, z, w)    th( x, y, w)    ta( x, y, z)

Proof of Theorem ceqsex4v
StepHypRef Expression
1 19.42vv 1788 . . . 4  |-  ( E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D  /\  ph )
)  <->  ( ( x  =  A  /\  y  =  B )  /\  E. z E. w ( z  =  C  /\  w  =  D  /\  ph )
) )
2 3anass 889 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  ( ( x  =  A  /\  y  =  B )  /\  (
( z  =  C  /\  w  =  D )  /\  ph )
) )
3 df-3an 887 . . . . . . 7  |-  ( ( z  =  C  /\  w  =  D  /\  ph )  <->  ( ( z  =  C  /\  w  =  D )  /\  ph ) )
43anbi2i 430 . . . . . 6  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D  /\  ph )
)  <->  ( ( x  =  A  /\  y  =  B )  /\  (
( z  =  C  /\  w  =  D )  /\  ph )
) )
52, 4bitr4i 176 . . . . 5  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D  /\  ph ) ) )
652exbii 1497 . . . 4  |-  ( E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  E. z E. w
( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D  /\  ph ) ) )
7 df-3an 887 . . . 4  |-  ( ( x  =  A  /\  y  =  B  /\  E. z E. w ( z  =  C  /\  w  =  D  /\  ph ) )  <->  ( (
x  =  A  /\  y  =  B )  /\  E. z E. w
( z  =  C  /\  w  =  D  /\  ph ) ) )
81, 6, 73bitr4i 201 . . 3  |-  ( E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  ( x  =  A  /\  y  =  B  /\  E. z E. w ( z  =  C  /\  w  =  D  /\  ph )
) )
982exbii 1497 . 2  |-  ( E. x E. y E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  E. x E. y
( x  =  A  /\  y  =  B  /\  E. z E. w ( z  =  C  /\  w  =  D  /\  ph )
) )
10 ceqsex4v.1 . . 3  |-  A  e. 
_V
11 ceqsex4v.2 . . 3  |-  B  e. 
_V
12 ceqsex4v.7 . . . . 5  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
13123anbi3d 1213 . . . 4  |-  ( x  =  A  ->  (
( z  =  C  /\  w  =  D  /\  ph )  <->  ( z  =  C  /\  w  =  D  /\  ps )
) )
14132exbidv 1748 . . 3  |-  ( x  =  A  ->  ( E. z E. w ( z  =  C  /\  w  =  D  /\  ph )  <->  E. z E. w
( z  =  C  /\  w  =  D  /\  ps ) ) )
15 ceqsex4v.8 . . . . 5  |-  ( y  =  B  ->  ( ps 
<->  ch ) )
16153anbi3d 1213 . . . 4  |-  ( y  =  B  ->  (
( z  =  C  /\  w  =  D  /\  ps )  <->  ( z  =  C  /\  w  =  D  /\  ch )
) )
17162exbidv 1748 . . 3  |-  ( y  =  B  ->  ( E. z E. w ( z  =  C  /\  w  =  D  /\  ps )  <->  E. z E. w
( z  =  C  /\  w  =  D  /\  ch ) ) )
1810, 11, 14, 17ceqsex2v 2595 . 2  |-  ( E. x E. y ( x  =  A  /\  y  =  B  /\  E. z E. w ( z  =  C  /\  w  =  D  /\  ph ) )  <->  E. z E. w ( z  =  C  /\  w  =  D  /\  ch )
)
19 ceqsex4v.3 . . 3  |-  C  e. 
_V
20 ceqsex4v.4 . . 3  |-  D  e. 
_V
21 ceqsex4v.9 . . 3  |-  ( z  =  C  ->  ( ch 
<->  th ) )
22 ceqsex4v.10 . . 3  |-  ( w  =  D  ->  ( th 
<->  ta ) )
2319, 20, 21, 22ceqsex2v 2595 . 2  |-  ( E. z E. w ( z  =  C  /\  w  =  D  /\  ch )  <->  ta )
249, 18, 233bitri 195 1  |-  ( E. x E. y E. z E. w ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D )  /\  ph ) 
<->  ta )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    /\ w3a 885    = wceq 1243   E.wex 1381    e. wcel 1393   _Vcvv 2557
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-v 2559
This theorem is referenced by:  ceqsex8v  2599
  Copyright terms: Public domain W3C validator