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

Theorem ssrnres 5205
Description: Subset of the range of a restriction. (Contributed by NM, 16-Jan-2006.)
Assertion
Ref Expression
ssrnres  |-  ( B 
C_  ran  ( C  |`  A )  <->  ran  ( C  i^i  ( A  X.  B ) )  =  B )

Proof of Theorem ssrnres
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inss2 3442 . . . . 5  |-  ( C  i^i  ( A  X.  B ) )  C_  ( A  X.  B
)
2 rnss 4987 . . . . 5  |-  ( ( C  i^i  ( A  X.  B ) ) 
C_  ( A  X.  B )  ->  ran  ( C  i^i  ( A  X.  B ) ) 
C_  ran  ( A  X.  B ) )
31, 2ax-mp 5 . . . 4  |-  ran  ( C  i^i  ( A  X.  B ) )  C_  ran  ( A  X.  B
)
4 rnxpss 5194 . . . 4  |-  ran  ( A  X.  B )  C_  B
53, 4sstri 3247 . . 3  |-  ran  ( C  i^i  ( A  X.  B ) )  C_  B
6 eqss 3253 . . 3  |-  ( ran  ( C  i^i  ( A  X.  B ) )  =  B  <->  ( ran  ( C  i^i  ( A  X.  B ) ) 
C_  B  /\  B  C_ 
ran  ( C  i^i  ( A  X.  B
) ) ) )
75, 6mpbiran 949 . 2  |-  ( ran  ( C  i^i  ( A  X.  B ) )  =  B  <->  B  C_  ran  ( C  i^i  ( A  X.  B ) ) )
8 ssid 3258 . . . . . . . 8  |-  A  C_  A
9 ssv 3260 . . . . . . . 8  |-  B  C_  _V
10 xpss12 4857 . . . . . . . 8  |-  ( ( A  C_  A  /\  B  C_  _V )  -> 
( A  X.  B
)  C_  ( A  X.  _V ) )
118, 9, 10mp2an 426 . . . . . . 7  |-  ( A  X.  B )  C_  ( A  X.  _V )
12 sslin 3447 . . . . . . 7  |-  ( ( A  X.  B ) 
C_  ( A  X.  _V )  ->  ( C  i^i  ( A  X.  B ) )  C_  ( C  i^i  ( A  X.  _V ) ) )
1311, 12ax-mp 5 . . . . . 6  |-  ( C  i^i  ( A  X.  B ) )  C_  ( C  i^i  ( A  X.  _V ) )
14 df-res 4761 . . . . . 6  |-  ( C  |`  A )  =  ( C  i^i  ( A  X.  _V ) )
1513, 14sseqtrri 3273 . . . . 5  |-  ( C  i^i  ( A  X.  B ) )  C_  ( C  |`  A )
16 rnss 4987 . . . . 5  |-  ( ( C  i^i  ( A  X.  B ) ) 
C_  ( C  |`  A )  ->  ran  ( C  i^i  ( A  X.  B ) ) 
C_  ran  ( C  |`  A ) )
1715, 16ax-mp 5 . . . 4  |-  ran  ( C  i^i  ( A  X.  B ) )  C_  ran  ( C  |`  A )
18 sstr 3246 . . . 4  |-  ( ( B  C_  ran  ( C  i^i  ( A  X.  B ) )  /\  ran  ( C  i^i  ( A  X.  B ) ) 
C_  ran  ( C  |`  A ) )  ->  B  C_  ran  ( C  |`  A ) )
1917, 18mpan2 425 . . 3  |-  ( B 
C_  ran  ( C  i^i  ( A  X.  B
) )  ->  B  C_ 
ran  ( C  |`  A ) )
20 ssel 3232 . . . . . . 7  |-  ( B 
C_  ran  ( C  |`  A )  ->  (
y  e.  B  -> 
y  e.  ran  ( C  |`  A ) ) )
21 vex 2816 . . . . . . . 8  |-  y  e. 
_V
2221elrn2 4999 . . . . . . 7  |-  ( y  e.  ran  ( C  |`  A )  <->  E. x <. x ,  y >.  e.  ( C  |`  A ) )
2320, 22imbitrdi 161 . . . . . 6  |-  ( B 
C_  ran  ( C  |`  A )  ->  (
y  e.  B  ->  E. x <. x ,  y
>.  e.  ( C  |`  A ) ) )
2423ancrd 326 . . . . 5  |-  ( B 
C_  ran  ( C  |`  A )  ->  (
y  e.  B  -> 
( E. x <. x ,  y >.  e.  ( C  |`  A )  /\  y  e.  B
) ) )
2521elrn2 4999 . . . . . 6  |-  ( y  e.  ran  ( C  i^i  ( A  X.  B ) )  <->  E. x <. x ,  y >.  e.  ( C  i^i  ( A  X.  B ) ) )
26 elin 3402 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  ( C  i^i  ( A  X.  B ) )  <-> 
( <. x ,  y
>.  e.  C  /\  <. x ,  y >.  e.  ( A  X.  B ) ) )
27 opelxp 4779 . . . . . . . . 9  |-  ( <.
x ,  y >.  e.  ( A  X.  B
)  <->  ( x  e.  A  /\  y  e.  B ) )
2827anbi2i 457 . . . . . . . 8  |-  ( (
<. x ,  y >.  e.  C  /\  <. x ,  y >.  e.  ( A  X.  B ) )  <->  ( <. x ,  y >.  e.  C  /\  ( x  e.  A  /\  y  e.  B
) ) )
2921opelres 5043 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  ( C  |`  A )  <-> 
( <. x ,  y
>.  e.  C  /\  x  e.  A ) )
3029anbi1i 458 . . . . . . . . 9  |-  ( (
<. x ,  y >.  e.  ( C  |`  A )  /\  y  e.  B
)  <->  ( ( <.
x ,  y >.  e.  C  /\  x  e.  A )  /\  y  e.  B ) )
31 anass 401 . . . . . . . . 9  |-  ( ( ( <. x ,  y
>.  e.  C  /\  x  e.  A )  /\  y  e.  B )  <->  ( <. x ,  y >.  e.  C  /\  ( x  e.  A  /\  y  e.  B
) ) )
3230, 31bitr2i 185 . . . . . . . 8  |-  ( (
<. x ,  y >.  e.  C  /\  (
x  e.  A  /\  y  e.  B )
)  <->  ( <. x ,  y >.  e.  ( C  |`  A )  /\  y  e.  B
) )
3326, 28, 323bitri 206 . . . . . . 7  |-  ( <.
x ,  y >.  e.  ( C  i^i  ( A  X.  B ) )  <-> 
( <. x ,  y
>.  e.  ( C  |`  A )  /\  y  e.  B ) )
3433exbii 1654 . . . . . 6  |-  ( E. x <. x ,  y
>.  e.  ( C  i^i  ( A  X.  B
) )  <->  E. x
( <. x ,  y
>.  e.  ( C  |`  A )  /\  y  e.  B ) )
35 19.41v 1952 . . . . . 6  |-  ( E. x ( <. x ,  y >.  e.  ( C  |`  A )  /\  y  e.  B
)  <->  ( E. x <. x ,  y >.  e.  ( C  |`  A )  /\  y  e.  B
) )
3625, 34, 353bitri 206 . . . . 5  |-  ( y  e.  ran  ( C  i^i  ( A  X.  B ) )  <->  ( E. x <. x ,  y
>.  e.  ( C  |`  A )  /\  y  e.  B ) )
3724, 36imbitrrdi 162 . . . 4  |-  ( B 
C_  ran  ( C  |`  A )  ->  (
y  e.  B  -> 
y  e.  ran  ( C  i^i  ( A  X.  B ) ) ) )
3837ssrdv 3244 . . 3  |-  ( B 
C_  ran  ( C  |`  A )  ->  B  C_ 
ran  ( C  i^i  ( A  X.  B
) ) )
3919, 38impbii 126 . 2  |-  ( B 
C_  ran  ( C  i^i  ( A  X.  B
) )  <->  B  C_  ran  ( C  |`  A ) )
407, 39bitr2i 185 1  |-  ( B 
C_  ran  ( C  |`  A )  <->  ran  ( C  i^i  ( A  X.  B ) )  =  B )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2203   _Vcvv 2813    i^i cin 3210    C_ wss 3211   <.cop 3692    X. cxp 4747   ran crn 4750    |` cres 4751
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-xp 4755  df-rel 4756  df-cnv 4757  df-dm 4759  df-rn 4760  df-res 4761
This theorem is referenced by:  rninxp  5206
  Copyright terms: Public domain W3C validator