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

Theorem copsex2g 4147
Description: Implicit substitution inference for ordered pairs. (Contributed by NM, 28-May-1995.)
Hypothesis
Ref Expression
copsex2g.1  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
copsex2g  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps ) )
Distinct variable groups:    x, y, ps    x, A, y    x, B, y
Allowed substitution hints:    ph( x, y)    V( x, y)    W( x, y)

Proof of Theorem copsex2g
StepHypRef Expression
1 elisset 2737 . 2  |-  ( A  e.  V  ->  E. x  x  =  A )
2 elisset 2737 . 2  |-  ( B  e.  W  ->  E. y 
y  =  B )
3 eeanv 2055 . . 3  |-  ( E. x E. y ( x  =  A  /\  y  =  B )  <->  ( E. x  x  =  A  /\  E. y 
y  =  B ) )
4 nfe1 1566 . . . . 5  |-  F/ x E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  ph )
5 nfv 1629 . . . . 5  |-  F/ x ps
64, 5nfbi 1738 . . . 4  |-  F/ x
( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps )
7 nfe1 1566 . . . . . . 7  |-  F/ y E. y ( <. A ,  B >.  = 
<. x ,  y >.  /\  ph )
87nfex 1733 . . . . . 6  |-  F/ y E. x E. y
( <. A ,  B >.  =  <. x ,  y
>.  /\  ph )
9 nfv 1629 . . . . . 6  |-  F/ y ps
108, 9nfbi 1738 . . . . 5  |-  F/ y ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps )
11 opeq12 3698 . . . . . . 7  |-  ( ( x  =  A  /\  y  =  B )  -> 
<. x ,  y >.  =  <. A ,  B >. )
12 copsexg 4145 . . . . . . . 8  |-  ( <. A ,  B >.  = 
<. x ,  y >.  ->  ( ph  <->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) ) )
1312eqcoms 2256 . . . . . . 7  |-  ( <.
x ,  y >.  =  <. A ,  B >.  ->  ( ph  <->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) ) )
1411, 13syl 17 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) ) )
15 copsex2g.1 . . . . . 6  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  ps )
)
1614, 15bitr3d 248 . . . . 5  |-  ( ( x  =  A  /\  y  =  B )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps ) )
1710, 16exlimi 1781 . . . 4  |-  ( E. y ( x  =  A  /\  y  =  B )  ->  ( E. x E. y (
<. A ,  B >.  = 
<. x ,  y >.  /\  ph )  <->  ps )
)
186, 17exlimi 1781 . . 3  |-  ( E. x E. y ( x  =  A  /\  y  =  B )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps ) )
193, 18sylbir 206 . 2  |-  ( ( E. x  x  =  A  /\  E. y 
y  =  B )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps ) )
201, 2, 19syl2an 465 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. x E. y ( <. A ,  B >.  =  <. x ,  y >.  /\  ph ) 
<->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    /\ wa 360   E.wex 1537    = wceq 1619    e. wcel 1621   <.cop 3547
This theorem is referenced by:  opelopabga  4171  ov6g  5837  ltresr  8642
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234  ax-sep 4038  ax-nul 4046  ax-pr 4108
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-eu 2118  df-mo 2119  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-rab 2516  df-v 2729  df-dif 3081  df-un 3083  df-in 3085  df-ss 3089  df-nul 3363  df-if 3471  df-sn 3550  df-pr 3551  df-op 3553
  Copyright terms: Public domain W3C validator