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

Theorem opbrop 4690
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 4232 . . 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 461 . 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 4213 . . 3  |-  ( ( A  e.  S  /\  B  e.  S )  -> 
<. A ,  B >.  e. 
_V )
5 opexg 4213 . . 3  |-  ( ( C  e.  S  /\  D  e.  S )  -> 
<. C ,  D >.  e. 
_V )
6 eleq1 2233 . . . . . 6  |-  ( x  =  <. A ,  B >.  ->  ( x  e.  ( S  X.  S
)  <->  <. A ,  B >.  e.  ( S  X.  S ) ) )
76anbi1d 462 . . . . 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 2177 . . . . . . . 8  |-  ( x  =  <. A ,  B >.  ->  ( x  = 
<. z ,  w >.  <->  <. A ,  B >.  =  <. z ,  w >. )
)
98anbi1d 462 . . . . . . 7  |-  ( x  =  <. A ,  B >.  ->  ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  <->  (
<. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. ) ) )
109anbi1d 462 . . . . . 6  |-  ( x  =  <. A ,  B >.  ->  ( ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph )  <->  ( ( <. A ,  B >.  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) ) )
11104exbidv 1863 . . . . 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 470 . . . 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 2233 . . . . . 6  |-  ( y  =  <. C ,  D >.  ->  ( y  e.  ( S  X.  S
)  <->  <. C ,  D >.  e.  ( S  X.  S ) ) )
1413anbi2d 461 . . . . 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 2177 . . . . . . . 8  |-  ( y  =  <. C ,  D >.  ->  ( y  = 
<. v ,  u >.  <->  <. C ,  D >.  =  <. v ,  u >. )
)
1615anbi2d 461 . . . . . . 7  |-  ( y  =  <. C ,  D >.  ->  ( ( <. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  <->  ( <. A ,  B >.  =  <. z ,  w >.  /\  <. C ,  D >.  =  <. v ,  u >. )
) )
1716anbi1d 462 . . . . . 6  |-  ( y  =  <. C ,  D >.  ->  ( ( (
<. A ,  B >.  = 
<. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ph ) 
<->  ( ( <. A ,  B >.  =  <. z ,  w >.  /\  <. C ,  D >.  =  <. v ,  u >. )  /\  ph ) ) )
18174exbidv 1863 . . . . 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 470 . . . 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 4254 . . 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 287 . 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 4643 . . . 4  |-  ( ( A  e.  S  /\  B  e.  S )  -> 
<. A ,  B >.  e.  ( S  X.  S
) )
24 opelxpi 4643 . . . 4  |-  ( ( C  e.  S  /\  D  e.  S )  -> 
<. C ,  D >.  e.  ( S  X.  S
) )
2523, 24anim12i 336 . . 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 303 . 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 219 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 103    <-> wb 104    = wceq 1348   E.wex 1485    e. wcel 2141   _Vcvv 2730   <.cop 3586   class class class wbr 3989   {copab 4049    X. cxp 4609
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617
This theorem is referenced by:  ecopoveq  6608  oviec  6619
  Copyright terms: Public domain W3C validator