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

Theorem inopab 4794
Description: Intersection of two ordered pair class abstractions. (Contributed by NM, 30-Sep-2002.)
Assertion
Ref Expression
inopab  |-  ( {
<. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  ps } )  =  { <. x ,  y
>.  |  ( ph  /\ 
ps ) }
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)    ps( x, y)

Proof of Theorem inopab
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relopab 4788 . . 3  |-  Rel  { <. x ,  y >.  |  ph }
2 relin1 4777 . . 3  |-  ( Rel 
{ <. x ,  y
>.  |  ph }  ->  Rel  ( { <. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  ps } ) )
31, 2ax-mp 5 . 2  |-  Rel  ( { <. x ,  y
>.  |  ph }  i^i  {
<. x ,  y >.  |  ps } )
4 relopab 4788 . 2  |-  Rel  { <. x ,  y >.  |  ( ph  /\  ps ) }
5 sban 1971 . . . 4  |-  ( [ w  /  y ] ( [ z  /  x ] ph  /\  [
z  /  x ] ps )  <->  ( [ w  /  y ] [
z  /  x ] ph  /\  [ w  / 
y ] [ z  /  x ] ps ) )
6 sban 1971 . . . . 5  |-  ( [ z  /  x ]
( ph  /\  ps )  <->  ( [ z  /  x ] ph  /\  [ z  /  x ] ps ) )
76sbbii 1776 . . . 4  |-  ( [ w  /  y ] [ z  /  x ] ( ph  /\  ps )  <->  [ w  /  y ] ( [ z  /  x ] ph  /\ 
[ z  /  x ] ps ) )
8 opelopabsbALT 4289 . . . . 5  |-  ( <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ph }  <->  [ w  /  y ] [
z  /  x ] ph )
9 opelopabsbALT 4289 . . . . 5  |-  ( <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ps }  <->  [ w  /  y ] [
z  /  x ] ps )
108, 9anbi12i 460 . . . 4  |-  ( (
<. z ,  w >.  e. 
{ <. x ,  y
>.  |  ph }  /\  <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ps } )  <-> 
( [ w  / 
y ] [ z  /  x ] ph  /\ 
[ w  /  y ] [ z  /  x ] ps ) )
115, 7, 103bitr4ri 213 . . 3  |-  ( (
<. z ,  w >.  e. 
{ <. x ,  y
>.  |  ph }  /\  <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ps } )  <->  [ w  /  y ] [ z  /  x ] ( ph  /\  ps ) )
12 elin 3342 . . 3  |-  ( <.
z ,  w >.  e.  ( { <. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  ps } )  <->  ( <. z ,  w >.  e.  { <. x ,  y >.  |  ph }  /\  <. z ,  w >.  e.  { <. x ,  y >.  |  ps } ) )
13 opelopabsbALT 4289 . . 3  |-  ( <.
z ,  w >.  e. 
{ <. x ,  y
>.  |  ( ph  /\ 
ps ) }  <->  [ w  /  y ] [
z  /  x ]
( ph  /\  ps )
)
1411, 12, 133bitr4i 212 . 2  |-  ( <.
z ,  w >.  e.  ( { <. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  ps } )  <->  <. z ,  w >.  e.  { <. x ,  y >.  |  (
ph  /\  ps ) } )
153, 4, 14eqrelriiv 4753 1  |-  ( {
<. x ,  y >.  |  ph }  i^i  { <. x ,  y >.  |  ps } )  =  { <. x ,  y
>.  |  ( ph  /\ 
ps ) }
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364   [wsb 1773    e. wcel 2164    i^i cin 3152   <.cop 3621   {copab 4089   Rel wrel 4664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-opab 4091  df-xp 4665  df-rel 4666
This theorem is referenced by:  inxp  4796  resopab  4986  cnvin  5073  fndmin  5665  enq0enq  7491
  Copyright terms: Public domain W3C validator