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

Theorem copsex4g 4219
Description: An implicit substitution inference for 2 ordered pairs. (Contributed by NM, 5-Aug-1995.)
Hypothesis
Ref Expression
copsex4g.1  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D ) )  -> 
( ph  <->  ps ) )
Assertion
Ref Expression
copsex4g  |-  ( ( ( A  e.  R  /\  B  e.  S
)  /\  ( C  e.  R  /\  D  e.  S ) )  -> 
( E. x E. y E. z E. w
( ( <. A ,  B >.  =  <. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  ps )
)
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, y, z, w    x, R, y, z, w    x, S, y, z, w
Allowed substitution hints:    ph( x, y, z, w)

Proof of Theorem copsex4g
StepHypRef Expression
1 eqcom 2166 . . . . . . 7  |-  ( <. A ,  B >.  = 
<. x ,  y >.  <->  <.
x ,  y >.  =  <. A ,  B >. )
2 vex 2724 . . . . . . . 8  |-  x  e. 
_V
3 vex 2724 . . . . . . . 8  |-  y  e. 
_V
42, 3opth 4209 . . . . . . 7  |-  ( <.
x ,  y >.  =  <. A ,  B >.  <-> 
( x  =  A  /\  y  =  B ) )
51, 4bitri 183 . . . . . 6  |-  ( <. A ,  B >.  = 
<. x ,  y >.  <->  ( x  =  A  /\  y  =  B )
)
6 eqcom 2166 . . . . . . 7  |-  ( <. C ,  D >.  = 
<. z ,  w >.  <->  <. z ,  w >.  =  <. C ,  D >. )
7 vex 2724 . . . . . . . 8  |-  z  e. 
_V
8 vex 2724 . . . . . . . 8  |-  w  e. 
_V
97, 8opth 4209 . . . . . . 7  |-  ( <.
z ,  w >.  = 
<. C ,  D >.  <->  (
z  =  C  /\  w  =  D )
)
106, 9bitri 183 . . . . . 6  |-  ( <. C ,  D >.  = 
<. z ,  w >.  <->  (
z  =  C  /\  w  =  D )
)
115, 10anbi12i 456 . . . . 5  |-  ( (
<. A ,  B >.  = 
<. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  <->  ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
) )
1211anbi1i 454 . . . 4  |-  ( ( ( <. A ,  B >.  =  <. x ,  y
>.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  ( ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
)  /\  ph ) )
1312a1i 9 . . 3  |-  ( ( ( A  e.  R  /\  B  e.  S
)  /\  ( C  e.  R  /\  D  e.  S ) )  -> 
( ( ( <. A ,  B >.  = 
<. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  ( ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
)  /\  ph ) ) )
14134exbidv 1857 . 2  |-  ( ( ( A  e.  R  /\  B  e.  S
)  /\  ( C  e.  R  /\  D  e.  S ) )  -> 
( E. x E. y E. z E. w
( ( <. A ,  B >.  =  <. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  E. x E. y E. z E. w ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D ) )  /\  ph ) ) )
15 id 19 . . 3  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D ) )  -> 
( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
) )
16 copsex4g.1 . . 3  |-  ( ( ( x  =  A  /\  y  =  B )  /\  ( z  =  C  /\  w  =  D ) )  -> 
( ph  <->  ps ) )
1715, 16cgsex4g 2758 . 2  |-  ( ( ( A  e.  R  /\  B  e.  S
)  /\  ( C  e.  R  /\  D  e.  S ) )  -> 
( E. x E. y E. z E. w
( ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
)  /\  ph )  <->  ps )
)
1814, 17bitrd 187 1  |-  ( ( ( A  e.  R  /\  B  e.  S
)  /\  ( C  e.  R  /\  D  e.  S ) )  -> 
( E. x E. y E. z E. w
( ( <. A ,  B >.  =  <. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1342   E.wex 1479    e. wcel 2135   <.cop 3573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-v 2723  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579
This theorem is referenced by:  opbrop  4677  ovi3  5969  dfplpq2  7286  dfmpq2  7287  enq0breq  7368
  Copyright terms: Public domain W3C validator