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

Theorem opabssxpd 4757
Description: An ordered-pair class abstraction is a subset of a Cartesian product. Formerly part of proof for opabex2 6349. (Contributed by AV, 26-Nov-2021.)
Hypotheses
Ref Expression
opabssxpd.x  |-  ( (
ph  /\  ps )  ->  x  e.  A )
opabssxpd.y  |-  ( (
ph  /\  ps )  ->  y  e.  B )
Assertion
Ref Expression
opabssxpd  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  C_  ( A  X.  B
) )
Distinct variable groups:    x, A    y, A    x, B    y, B    ph, x    ph, y
Allowed substitution hints:    ps( x, y)

Proof of Theorem opabssxpd
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 df-opab 4146 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
2 simprl 529 . . . . . 6  |-  ( (
ph  /\  ( z  =  <. x ,  y
>.  /\  ps ) )  ->  z  =  <. x ,  y >. )
3 opabssxpd.x . . . . . . . 8  |-  ( (
ph  /\  ps )  ->  x  e.  A )
4 opabssxpd.y . . . . . . . 8  |-  ( (
ph  /\  ps )  ->  y  e.  B )
53, 4opelxpd 4753 . . . . . . 7  |-  ( (
ph  /\  ps )  -> 
<. x ,  y >.  e.  ( A  X.  B
) )
65adantrl 478 . . . . . 6  |-  ( (
ph  /\  ( z  =  <. x ,  y
>.  /\  ps ) )  ->  <. x ,  y
>.  e.  ( A  X.  B ) )
72, 6eqeltrd 2306 . . . . 5  |-  ( (
ph  /\  ( z  =  <. x ,  y
>.  /\  ps ) )  ->  z  e.  ( A  X.  B ) )
87ex 115 . . . 4  |-  ( ph  ->  ( ( z  = 
<. x ,  y >.  /\  ps )  ->  z  e.  ( A  X.  B
) ) )
98exlimdvv 1944 . . 3  |-  ( ph  ->  ( E. x E. y ( z  = 
<. x ,  y >.  /\  ps )  ->  z  e.  ( A  X.  B
) ) )
109abssdv 3298 . 2  |-  ( ph  ->  { z  |  E. x E. y ( z  =  <. x ,  y
>.  /\  ps ) } 
C_  ( A  X.  B ) )
111, 10eqsstrid 3270 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  C_  ( A  X.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200   {cab 2215    C_ wss 3197   <.cop 3669   {copab 4144    X. cxp 4718
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4259  ax-pr 4294
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-opab 4146  df-xp 4726
This theorem is referenced by:  opabex2  6349
  Copyright terms: Public domain W3C validator