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

Theorem cnvss 4707
Description: Subset theorem for converse. (Contributed by NM, 22-Mar-1998.)
Assertion
Ref Expression
cnvss  |-  ( A 
C_  B  ->  `' A  C_  `' B )

Proof of Theorem cnvss
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3086 . . . 4  |-  ( A 
C_  B  ->  ( <. y ,  x >.  e.  A  ->  <. y ,  x >.  e.  B
) )
2 df-br 3925 . . . 4  |-  ( y A x  <->  <. y ,  x >.  e.  A
)
3 df-br 3925 . . . 4  |-  ( y B x  <->  <. y ,  x >.  e.  B
)
41, 2, 33imtr4g 204 . . 3  |-  ( A 
C_  B  ->  (
y A x  -> 
y B x ) )
54ssopab2dv 4195 . 2  |-  ( A 
C_  B  ->  { <. x ,  y >.  |  y A x }  C_  {
<. x ,  y >.  |  y B x } )
6 df-cnv 4542 . 2  |-  `' A  =  { <. x ,  y
>.  |  y A x }
7 df-cnv 4542 . 2  |-  `' B  =  { <. x ,  y
>.  |  y B x }
85, 6, 73sstr4g 3135 1  |-  ( A 
C_  B  ->  `' A  C_  `' B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1480    C_ wss 3066   <.cop 3525   class class class wbr 3924   {copab 3983   `'ccnv 4533
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-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-in 3072  df-ss 3079  df-br 3925  df-opab 3985  df-cnv 4542
This theorem is referenced by:  cnveq  4708  rnss  4764  relcnvtr  5053  funss  5137  funcnvuni  5187  funres11  5190  funcnvres  5191  foimacnv  5378  tposss  6136  structcnvcnv  11964
  Copyright terms: Public domain W3C validator