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

Theorem ssopab2 4763
Description: Equivalence of ordered pair abstraction subclass and implication. (Contributed by NM, 27-Dec-1996.) (Revised by Mario Carneiro, 19-May-2013.)
Assertion
Ref Expression
ssopab2  |-  ( A. x A. y ( ph  ->  ps )  ->  { <. x ,  y >.  |  ph }  C_  { <. x ,  y >.  |  ps } )

Proof of Theorem ssopab2
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 id 22 . . . . . 6  |-  ( (
ph  ->  ps )  -> 
( ph  ->  ps )
)
21anim2d 565 . . . . 5  |-  ( (
ph  ->  ps )  -> 
( ( z  = 
<. x ,  y >.  /\  ph )  ->  (
z  =  <. x ,  y >.  /\  ps ) ) )
32aleximi 1640 . . . 4  |-  ( A. y ( ph  ->  ps )  ->  ( E. y ( z  = 
<. x ,  y >.  /\  ph )  ->  E. y
( z  =  <. x ,  y >.  /\  ps ) ) )
43aleximi 1640 . . 3  |-  ( A. x A. y ( ph  ->  ps )  ->  ( E. x E. y ( z  =  <. x ,  y >.  /\  ph )  ->  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) ) )
54ss2abdv 3558 . 2  |-  ( A. x A. y ( ph  ->  ps )  ->  { z  |  E. x E. y ( z  = 
<. x ,  y >.  /\  ph ) }  C_  { z  |  E. x E. y ( z  = 
<. x ,  y >.  /\  ps ) } )
6 df-opab 4496 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
7 df-opab 4496 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
85, 6, 73sstr4g 3530 1  |-  ( A. x A. y ( ph  ->  ps )  ->  { <. x ,  y >.  |  ph }  C_  { <. x ,  y >.  |  ps } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369   A.wal 1381    = wceq 1383   E.wex 1599   {cab 2428    C_ wss 3461   <.cop 4020   {copab 4494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-in 3468  df-ss 3475  df-opab 4496
This theorem is referenced by:  ssopab2b  4764  ssopab2i  4765  ssopab2dv  4766  opabbrex  6324
  Copyright terms: Public domain W3C validator