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

Theorem opabssxpd 4785
Description: An ordered-pair class abstraction is a subset of a Cartesian product. Formerly part of proof for opabex2 6387. (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 4171 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
2 simprl 531 . . . . . 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 4781 . . . . . . 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 2309 . . . . 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 1947 . . 3  |-  ( ph  ->  ( E. x E. y ( z  = 
<. x ,  y >.  /\  ps )  ->  z  e.  ( A  X.  B
) ) )
109abssdv 3311 . 2  |-  ( ph  ->  { z  |  E. x E. y ( z  =  <. x ,  y
>.  /\  ps ) } 
C_  ( A  X.  B ) )
111, 10eqsstrid 3283 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  C_  ( A  X.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2203   {cab 2218    C_ wss 3210   <.cop 3691   {copab 4169    X. cxp 4746
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-opab 4171  df-xp 4754
This theorem is referenced by:  opabex2  6387
  Copyright terms: Public domain W3C validator