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

Theorem resixp 6699
Description: Restriction of an element of an infinite Cartesian product. (Contributed by FL, 7-Nov-2011.) (Proof shortened by Mario Carneiro, 31-May-2014.)
Assertion
Ref Expression
resixp  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  -> 
( F  |`  B )  e.  X_ x  e.  B  C )
Distinct variable groups:    x, A    x, B    x, F
Allowed substitution hint:    C( x)

Proof of Theorem resixp
StepHypRef Expression
1 resexg 4924 . . 3  |-  ( F  e.  X_ x  e.  A  C  ->  ( F  |`  B )  e.  _V )
21adantl 275 . 2  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  -> 
( F  |`  B )  e.  _V )
3 simpr 109 . . . . 5  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  F  e.  X_ x  e.  A  C )
4 elixp2 6668 . . . . 5  |-  ( F  e.  X_ x  e.  A  C 
<->  ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  C ) )
53, 4sylib 121 . . . 4  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  -> 
( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  C ) )
65simp2d 1000 . . 3  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  F  Fn  A )
7 simpl 108 . . 3  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  B  C_  A )
8 fnssres 5301 . . 3  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F  |`  B )  Fn  B )
96, 7, 8syl2anc 409 . 2  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  -> 
( F  |`  B )  Fn  B )
105simp3d 1001 . . . 4  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  A. x  e.  A  ( F `  x )  e.  C )
11 ssralv 3206 . . . 4  |-  ( B 
C_  A  ->  ( A. x  e.  A  ( F `  x )  e.  C  ->  A. x  e.  B  ( F `  x )  e.  C
) )
127, 10, 11sylc 62 . . 3  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  A. x  e.  B  ( F `  x )  e.  C )
13 fvres 5510 . . . . 5  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
1413eleq1d 2235 . . . 4  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  e.  C  <->  ( F `  x )  e.  C
) )
1514ralbiia 2480 . . 3  |-  ( A. x  e.  B  (
( F  |`  B ) `
 x )  e.  C  <->  A. x  e.  B  ( F `  x )  e.  C )
1612, 15sylibr 133 . 2  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  ->  A. x  e.  B  ( ( F  |`  B ) `  x
)  e.  C )
17 elixp2 6668 . 2  |-  ( ( F  |`  B )  e.  X_ x  e.  B  C 
<->  ( ( F  |`  B )  e.  _V  /\  ( F  |`  B )  Fn  B  /\  A. x  e.  B  (
( F  |`  B ) `
 x )  e.  C ) )
182, 9, 16, 17syl3anbrc 1171 1  |-  ( ( B  C_  A  /\  F  e.  X_ x  e.  A  C )  -> 
( F  |`  B )  e.  X_ x  e.  B  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 968    e. wcel 2136   A.wral 2444   _Vcvv 2726    C_ wss 3116    |` cres 4606    Fn wfn 5183   ` cfv 5188   X_cixp 6664
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-res 4616  df-iota 5153  df-fun 5190  df-fn 5191  df-fv 5196  df-ixp 6665
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator