MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssopab2dv Structured version   Unicode version

Theorem ssopab2dv 4769
Description: Inference of ordered pair abstraction subclass from implication. (Contributed by NM, 19-Jan-2014.) (Revised by Mario Carneiro, 24-Jun-2014.)
Hypothesis
Ref Expression
ssopab2dv.1  |-  ( ph  ->  ( ps  ->  ch ) )
Assertion
Ref Expression
ssopab2dv  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  C_  {
<. x ,  y >.  |  ch } )
Distinct variable groups:    ph, x    ph, y
Allowed substitution hints:    ps( x, y)    ch( x, y)

Proof of Theorem ssopab2dv
StepHypRef Expression
1 ssopab2dv.1 . . 3  |-  ( ph  ->  ( ps  ->  ch ) )
21alrimivv 1691 . 2  |-  ( ph  ->  A. x A. y
( ps  ->  ch ) )
3 ssopab2 4766 . 2  |-  ( A. x A. y ( ps 
->  ch )  ->  { <. x ,  y >.  |  ps }  C_  { <. x ,  y >.  |  ch } )
42, 3syl 16 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  C_  {
<. x ,  y >.  |  ch } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1372    C_ wss 3469   {copab 4497
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-in 3476  df-ss 3483  df-opab 4499
This theorem is referenced by:  xpss12  5099  coss1  5149  coss2  5150  cnvss  5166  aceq3lem  8490  shftfval  12853  sslm  19559  ulmval  22502  clwlkswlks  24420  iseupa  24627  fpwrelmap  27214  dicssdvh  35858  coss12d  36654
  Copyright terms: Public domain W3C validator