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

Theorem ssoprab2i 5853
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 339 . . . 4  |-  ( ( w  =  <. x ,  y >.  /\  ph )  ->  ( w  = 
<. x ,  y >.  /\  ps ) )
322eximi 1580 . . 3  |-  ( E. x E. y ( w  =  <. x ,  y >.  /\  ph )  ->  E. x E. y
( w  =  <. x ,  y >.  /\  ps ) )
43ssopab2i 4194 . 2  |-  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) } 
C_  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
5 dfoprab2 5811 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
6 dfoprab2 5811 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ps }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ps ) }
74, 5, 63sstr4i 3133 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  C_  { <. <. x ,  y >. ,  z
>.  |  ps }
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331   E.wex 1468    C_ wss 3066   <.cop 3525   {copab 3983   {coprab 5768
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985  df-oprab 5771
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator