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

Theorem opbrop 4465
Description: Ordered pair membership in a relation. Special case. (Contributed by NM, 5-Aug-1995.)
Hypotheses
Ref Expression
opbrop.1  |-  ( ( ( z  =  A  /\  w  =  B )  /\  ( v  =  C  /\  u  =  D ) )  -> 
( ph  <->  ps ) )
opbrop.2  |-  R  =  { <. x ,  y
>.  |  ( (
x  e.  ( S  X.  S )  /\  y  e.  ( S  X.  S ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )
) }
Assertion
Ref Expression
opbrop  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( <. A ,  B >. R <. C ,  D >.  <->  ps ) )
Distinct variable groups:    x, y, z, w, v, u, A   
x, B, y, z, w, v, u    x, C, y, z, w, v, u    x, D, y, z, w, v, u   
x, S, y, z, w, v, u    ph, x, y    ps, z, w, v, u
Allowed substitution hints:    ph( z, w, v, u)    ps( x, y)    R( x, y, z, w, v, u)

Proof of Theorem opbrop
StepHypRef Expression
1 opbrop.1 . . . 4  |-  ( ( ( z  =  A  /\  w  =  B )  /\  ( v  =  C  /\  u  =  D ) )  -> 
( ph  <->  ps ) )
21copsex4g 4030 . . 3  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\ 
<. C ,  D >.  = 
<. v ,  u >. )  /\  ph )  <->  ps )
)
32anbi2d 452 . 2  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( ( ( <. A ,  B >.  e.  ( S  X.  S
)  /\  <. C ,  D >.  e.  ( S  X.  S ) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\ 
<. C ,  D >.  = 
<. v ,  u >. )  /\  ph ) )  <-> 
( ( <. A ,  B >.  e.  ( S  X.  S )  /\  <. C ,  D >.  e.  ( S  X.  S
) )  /\  ps ) ) )
4 opexg 4011 . . 3  |-  ( ( A  e.  S  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
_V )
5 opexg 4011 . . 3  |-  ( ( C  e.  S  /\  D  e.  S )  -> 
<. C ,  D >.  e. 
_V )
6 eleq1 2145 . . . . . 6  |-  ( x  =  <. A ,  B >.  ->  ( x  e.  ( S  X.  S
)  <->  <. A ,  B >.  e.  ( S  X.  S ) ) )
76anbi1d 453 . . . . 5  |-  ( x  =  <. A ,  B >.  ->  ( ( x  e.  ( S  X.  S )  /\  y  e.  ( S  X.  S
) )  <->  ( <. A ,  B >.  e.  ( S  X.  S )  /\  y  e.  ( S  X.  S ) ) ) )
8 eqeq1 2089 . . . . . . . 8  |-  ( x  =  <. A ,  B >.  ->  ( x  = 
<. z ,  w >.  <->  <. A ,  B >.  =  <. z ,  w >. )
)
98anbi1d 453 . . . . . . 7  |-  ( x  =  <. A ,  B >.  ->  ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  <->  (
<. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. ) ) )
109anbi1d 453 . . . . . 6  |-  ( x  =  <. A ,  B >.  ->  ( ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )  <->  ( ( <. A ,  B >.  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) ) )
11104exbidv 1793 . . . . 5  |-  ( x  =  <. A ,  B >.  ->  ( E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )  <->  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) ) )
127, 11anbi12d 457 . . . 4  |-  ( x  =  <. A ,  B >.  ->  ( ( ( x  e.  ( S  X.  S )  /\  y  e.  ( S  X.  S ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )
)  <->  ( ( <. A ,  B >.  e.  ( S  X.  S
)  /\  y  e.  ( S  X.  S
) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) ) ) )
13 eleq1 2145 . . . . . 6  |-  ( y  =  <. C ,  D >.  ->  ( y  e.  ( S  X.  S
)  <->  <. C ,  D >.  e.  ( S  X.  S ) ) )
1413anbi2d 452 . . . . 5  |-  ( y  =  <. C ,  D >.  ->  ( ( <. A ,  B >.  e.  ( S  X.  S
)  /\  y  e.  ( S  X.  S
) )  <->  ( <. A ,  B >.  e.  ( S  X.  S )  /\  <. C ,  D >.  e.  ( S  X.  S ) ) ) )
15 eqeq1 2089 . . . . . . . 8  |-  ( y  =  <. C ,  D >.  ->  ( y  = 
<. v ,  u >.  <->  <. C ,  D >.  =  <. v ,  u >. )
)
1615anbi2d 452 . . . . . . 7  |-  ( y  =  <. C ,  D >.  ->  ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  <->  ( <. A ,  B >.  =  <. z ,  w >.  /\  <. C ,  D >.  =  <. v ,  u >. )
) )
1716anbi1d 453 . . . . . 6  |-  ( y  =  <. C ,  D >.  ->  ( ( (
<. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) 
<->  ( ( <. A ,  B >.  =  <. z ,  w >.  /\  <. C ,  D >.  =  <. v ,  u >. )  /\  ph ) ) )
18174exbidv 1793 . . . . 5  |-  ( y  =  <. C ,  D >.  ->  ( E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) 
<->  E. z E. w E. v E. u ( ( <. A ,  B >.  =  <. z ,  w >.  /\  <. C ,  D >.  =  <. v ,  u >. )  /\  ph )
) )
1914, 18anbi12d 457 . . . 4  |-  ( y  =  <. C ,  D >.  ->  ( ( (
<. A ,  B >.  e.  ( S  X.  S
)  /\  y  e.  ( S  X.  S
) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) )  <->  ( ( <. A ,  B >.  e.  ( S  X.  S
)  /\  <. C ,  D >.  e.  ( S  X.  S ) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\ 
<. C ,  D >.  = 
<. v ,  u >. )  /\  ph ) ) ) )
20 opbrop.2 . . . 4  |-  R  =  { <. x ,  y
>.  |  ( (
x  e.  ( S  X.  S )  /\  y  e.  ( S  X.  S ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )
) }
2112, 19, 20brabg 4052 . . 3  |-  ( (
<. A ,  B >.  e. 
_V  /\  <. C ,  D >.  e.  _V )  ->  ( <. A ,  B >. R <. C ,  D >.  <-> 
( ( <. A ,  B >.  e.  ( S  X.  S )  /\  <. C ,  D >.  e.  ( S  X.  S
) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\ 
<. C ,  D >.  = 
<. v ,  u >. )  /\  ph ) ) ) )
224, 5, 21syl2an 283 . 2  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( <. A ,  B >. R <. C ,  D >.  <-> 
( ( <. A ,  B >.  e.  ( S  X.  S )  /\  <. C ,  D >.  e.  ( S  X.  S
) )  /\  E. z E. w E. v E. u ( ( <. A ,  B >.  = 
<. z ,  w >.  /\ 
<. C ,  D >.  = 
<. v ,  u >. )  /\  ph ) ) ) )
23 opelxpi 4422 . . . 4  |-  ( ( A  e.  S  /\  B  e.  S )  -> 
<. A ,  B >.  e.  ( S  X.  S
) )
24 opelxpi 4422 . . . 4  |-  ( ( C  e.  S  /\  D  e.  S )  -> 
<. C ,  D >.  e.  ( S  X.  S
) )
2523, 24anim12i 331 . . 3  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( <. A ,  B >.  e.  ( S  X.  S )  /\  <. C ,  D >.  e.  ( S  X.  S ) ) )
2625biantrurd 299 . 2  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( ps  <->  ( ( <. A ,  B >.  e.  ( S  X.  S
)  /\  <. C ,  D >.  e.  ( S  X.  S ) )  /\  ps ) ) )
273, 22, 263bitr4d 218 1  |-  ( ( ( A  e.  S  /\  B  e.  S
)  /\  ( C  e.  S  /\  D  e.  S ) )  -> 
( <. A ,  B >. R <. C ,  D >.  <->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1285   E.wex 1422    e. wcel 1434   _Vcvv 2610   <.cop 3419   class class class wbr 3805   {copab 3858    X. cxp 4389
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-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-pow 3968  ax-pr 3992
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2612  df-un 2986  df-in 2988  df-ss 2995  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-br 3806  df-opab 3860  df-xp 4397
This theorem is referenced by:  ecopoveq  6288  oviec  6299
  Copyright terms: Public domain W3C validator