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

Theorem copsex4g 4446
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 2439 . . . . . . 7  |-  ( <. A ,  B >.  = 
<. x ,  y >.  <->  <.
x ,  y >.  =  <. A ,  B >. )
2 vex 2960 . . . . . . . 8  |-  x  e. 
_V
3 vex 2960 . . . . . . . 8  |-  y  e. 
_V
42, 3opth 4436 . . . . . . 7  |-  ( <.
x ,  y >.  =  <. A ,  B >.  <-> 
( x  =  A  /\  y  =  B ) )
51, 4bitri 242 . . . . . 6  |-  ( <. A ,  B >.  = 
<. x ,  y >.  <->  ( x  =  A  /\  y  =  B )
)
6 eqcom 2439 . . . . . . 7  |-  ( <. C ,  D >.  = 
<. z ,  w >.  <->  <. z ,  w >.  =  <. C ,  D >. )
7 vex 2960 . . . . . . . 8  |-  z  e. 
_V
8 vex 2960 . . . . . . . 8  |-  w  e. 
_V
97, 8opth 4436 . . . . . . 7  |-  ( <.
z ,  w >.  = 
<. C ,  D >.  <->  (
z  =  C  /\  w  =  D )
)
106, 9bitri 242 . . . . . 6  |-  ( <. C ,  D >.  = 
<. z ,  w >.  <->  (
z  =  C  /\  w  =  D )
)
115, 10anbi12i 680 . . . . 5  |-  ( (
<. A ,  B >.  = 
<. x ,  y >.  /\  <. C ,  D >.  =  <. z ,  w >. )  <->  ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
) )
1211anbi1i 678 . . . 4  |-  ( ( ( <. A ,  B >.  =  <. x ,  y
>.  /\  <. C ,  D >.  =  <. z ,  w >. )  /\  ph )  <->  ( ( ( x  =  A  /\  y  =  B )  /\  (
z  =  C  /\  w  =  D )
)  /\  ph ) )
1312a1i 11 . . 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 1641 . 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 21 . . 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 2990 . 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 246 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    <-> wb 178    /\ wa 360   E.wex 1551    = wceq 1653    e. wcel 1726   <.cop 3818
This theorem is referenced by:  opbrop  4956  ov3  6211
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2418  ax-sep 4331  ax-nul 4339  ax-pr 4404
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2424  df-cleq 2430  df-clel 2433  df-nfc 2562  df-ne 2602  df-rab 2715  df-v 2959  df-dif 3324  df-un 3326  df-in 3328  df-ss 3335  df-nul 3630  df-if 3741  df-sn 3821  df-pr 3822  df-op 3824
  Copyright terms: Public domain W3C validator