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

Theorem ssoprab2i 6057
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 1625 . . 3  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph )  ->  E. x E. y
( w  =  <. x ,  y >.  /\  ps ) )
43ssopab2i 4342 . 2  |-  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) } 
C_  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
5 dfoprab2 6015 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
6 dfoprab2 6015 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ps }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
74, 5, 63sstr4i 3242 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  C_  { <. <. x ,  y >. ,  z
>.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373   E.wex 1516    C_ wss 3174   <.cop 3646   {copab 4120   {coprab 5968
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-opab 4122  df-oprab 5971
This theorem is referenced by:  mpomulf  8097
  Copyright terms: Public domain W3C validator