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

Theorem ssrnres 5179
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 3428 . . . . 5  |-  ( C  i^i  ( A  X.  B ) )  C_  ( A  X.  B
)
2 rnss 4962 . . . . 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 5168 . . . 4  |-  ran  ( A  X.  B )  C_  B
53, 4sstri 3236 . . 3  |-  ran  ( C  i^i  ( A  X.  B ) )  C_  B
6 eqss 3242 . . 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 948 . 2  |-  ( ran  ( C  i^i  ( A  X.  B ) )  =  B  <->  B  C_  ran  ( C  i^i  ( A  X.  B ) ) )
8 ssid 3247 . . . . . . . 8  |-  A  C_  A
9 ssv 3249 . . . . . . . 8  |-  B  C_  _V
10 xpss12 4833 . . . . . . . 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 3433 . . . . . . 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 4737 . . . . . 6  |-  ( C  |`  A )  =  ( C  i^i  ( A  X.  _V ) )
1513, 14sseqtrri 3262 . . . . 5  |-  ( C  i^i  ( A  X.  B ) )  C_  ( C  |`  A )
16 rnss 4962 . . . . 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 3235 . . . 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 3221 . . . . . . 7  |-  ( B 
C_  ran  ( C  |`  A )  ->  (
y  e.  B  -> 
y  e.  ran  ( C  |`  A ) ) )
21 vex 2805 . . . . . . . 8  |-  y  e. 
_V
2221elrn2 4974 . . . . . . 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 4974 . . . . . 6  |-  ( y  e.  ran  ( C  i^i  ( A  X.  B ) )  <->  E. x <. x ,  y >.  e.  ( C  i^i  ( A  X.  B ) ) )
26 elin 3390 . . . . . . . 8  |-  ( <.
x ,  y >.  e.  ( C  i^i  ( A  X.  B ) )  <-> 
( <. x ,  y
>.  e.  C  /\  <. x ,  y >.  e.  ( A  X.  B ) ) )
27 opelxp 4755 . . . . . . . . 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 5018 . . . . . . . . . 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 1653 . . . . . 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 1951 . . . . . 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 3233 . . 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 1397   E.wex 1540    e. wcel 2202   _Vcvv 2802    i^i cin 3199    C_ wss 3200   <.cop 3672    X. cxp 4723   ran crn 4726    |` cres 4727
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-dm 4735  df-rn 4736  df-res 4737
This theorem is referenced by:  rninxp  5180
  Copyright terms: Public domain W3C validator