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

Theorem ssoprab2i 5967
Description: Inference of operation class abstraction subclass from implication. (Contributed by NM, 11-Nov-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Hypothesis
Ref Expression
ssoprab2i.1  |-  ( ph  ->  ps )
Assertion
Ref Expression
ssoprab2i  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  C_  { <. <. x ,  y >. ,  z
>.  |  ps }
Distinct variable groups:    x, z    y,
z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, z)

Proof of Theorem ssoprab2i
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 ssoprab2i.1 . . . . 5  |-  ( ph  ->  ps )
21anim2i 342 . . . 4  |-  ( ( w  =  <. x ,  y >.  /\  ph )  ->  ( w  = 
<. x ,  y >.  /\  ps ) )
322eximi 1601 . . 3  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph )  ->  E. x E. y
( w  =  <. x ,  y >.  /\  ps ) )
43ssopab2i 4279 . 2  |-  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) } 
C_  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
5 dfoprab2 5925 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
6 dfoprab2 5925 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ps }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
74, 5, 63sstr4i 3198 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  C_  { <. <. x ,  y >. ,  z
>.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353   E.wex 1492    C_ wss 3131   <.cop 3597   {copab 4065   {coprab 5879
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-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-opab 4067  df-oprab 5882
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator