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

Theorem ssopab2 4277
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 nfa1 1541 . . . 4  |-  F/ x A. x A. y (
ph  ->  ps )
2 nfa1 1541 . . . . . 6  |-  F/ y A. y ( ph  ->  ps )
3 sp 1511 . . . . . . 7  |-  ( A. y ( ph  ->  ps )  ->  ( ph  ->  ps ) )
43anim2d 337 . . . . . 6  |-  ( A. y ( ph  ->  ps )  ->  ( (
z  =  <. x ,  y >.  /\  ph )  ->  ( z  = 
<. x ,  y >.  /\  ps ) ) )
52, 4eximd 1612 . . . . 5  |-  ( A. y ( ph  ->  ps )  ->  ( E. y ( z  = 
<. x ,  y >.  /\  ph )  ->  E. y
( z  =  <. x ,  y >.  /\  ps ) ) )
65sps 1537 . . . 4  |-  ( A. x A. y ( ph  ->  ps )  ->  ( E. y ( z  = 
<. x ,  y >.  /\  ph )  ->  E. y
( z  =  <. x ,  y >.  /\  ps ) ) )
71, 6eximd 1612 . . 3  |-  ( A. x A. y ( ph  ->  ps )  ->  ( E. x E. y ( z  =  <. x ,  y >.  /\  ph )  ->  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) ) )
87ss2abdv 3230 . 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 ) } )
9 df-opab 4067 . 2  |-  { <. x ,  y >.  |  ph }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ph ) }
10 df-opab 4067 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
118, 9, 103sstr4g 3200 1  |-  ( A. x A. y ( ph  ->  ps )  ->  { <. x ,  y >.  |  ph }  C_  { <. x ,  y >.  |  ps } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1351    = wceq 1353   E.wex 1492   {cab 2163    C_ wss 3131   <.cop 3597   {copab 4065
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-in 3137  df-ss 3144  df-opab 4067
This theorem is referenced by:  ssopab2b  4278  ssopab2i  4279  ssopab2dv  4280
  Copyright terms: Public domain W3C validator