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

Theorem fvinim0ffz 10638
Description: The function values for the borders of a finite interval of integers, which is the domain of the function, are not in the image of the interior of the interval iff the intersection of the images of the interior and the borders is empty. (Contributed by Alexander van der Vekens, 31-Oct-2017.) (Revised by AV, 5-Feb-2021.)
Assertion
Ref Expression
fvinim0ffz  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( ( ( F " { 0 ,  K } )  i^i  ( F "
( 1..^ K ) ) )  =  (/)  <->  (
( F `  0
)  e/  ( F " ( 1..^ K ) )  /\  ( F `
 K )  e/  ( F " ( 1..^ K ) ) ) ) )

Proof of Theorem fvinim0ffz
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 ffn 5528 . . . . . 6  |-  ( F : ( 0 ... K ) --> V  ->  F  Fn  ( 0 ... K ) )
21adantr 276 . . . . 5  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  F  Fn  (
0 ... K ) )
3 0nn0 9557 . . . . . . 7  |-  0  e.  NN0
43a1i 9 . . . . . 6  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  0  e.  NN0 )
5 simpr 110 . . . . . 6  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  K  e.  NN0 )
6 nn0ge0 9567 . . . . . . 7  |-  ( K  e.  NN0  ->  0  <_  K )
76adantl 277 . . . . . 6  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  0  <_  K
)
8 elfz2nn0 10497 . . . . . 6  |-  ( 0  e.  ( 0 ... K )  <->  ( 0  e.  NN0  /\  K  e. 
NN0  /\  0  <_  K ) )
94, 5, 7, 8syl3anbrc 1212 . . . . 5  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  0  e.  ( 0 ... K ) )
10 id 19 . . . . . . 7  |-  ( K  e.  NN0  ->  K  e. 
NN0 )
11 nn0re 9551 . . . . . . . 8  |-  ( K  e.  NN0  ->  K  e.  RR )
1211leidd 8832 . . . . . . 7  |-  ( K  e.  NN0  ->  K  <_  K )
13 elfz2nn0 10497 . . . . . . 7  |-  ( K  e.  ( 0 ... K )  <->  ( K  e.  NN0  /\  K  e. 
NN0  /\  K  <_  K ) )
1410, 10, 12, 13syl3anbrc 1212 . . . . . 6  |-  ( K  e.  NN0  ->  K  e.  ( 0 ... K
) )
1514adantl 277 . . . . 5  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  K  e.  ( 0 ... K ) )
16 fnimapr 5757 . . . . 5  |-  ( ( F  Fn  ( 0 ... K )  /\  0  e.  ( 0 ... K )  /\  K  e.  ( 0 ... K ) )  ->  ( F " { 0 ,  K } )  =  {
( F `  0
) ,  ( F `
 K ) } )
172, 9, 15, 16syl3anc 1278 . . . 4  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( F " { 0 ,  K } )  =  {
( F `  0
) ,  ( F `
 K ) } )
1817ineq1d 3431 . . 3  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( ( F
" { 0 ,  K } )  i^i  ( F " (
1..^ K ) ) )  =  ( { ( F `  0
) ,  ( F `
 K ) }  i^i  ( F "
( 1..^ K ) ) ) )
1918eqeq1d 2247 . 2  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( ( ( F " { 0 ,  K } )  i^i  ( F "
( 1..^ K ) ) )  =  (/)  <->  ( { ( F ` 
0 ) ,  ( F `  K ) }  i^i  ( F
" ( 1..^ K ) ) )  =  (/) ) )
20 disj 3572 . . 3  |-  ( ( { ( F ` 
0 ) ,  ( F `  K ) }  i^i  ( F
" ( 1..^ K ) ) )  =  (/) 
<-> 
A. v  e.  {
( F `  0
) ,  ( F `
 K ) }  -.  v  e.  ( F " ( 1..^ K ) ) )
21 simpl 109 . . . . 5  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  F : ( 0 ... K ) --> V )
2221, 9ffvelcdmd 5835 . . . 4  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( F ` 
0 )  e.  V
)
2321, 15ffvelcdmd 5835 . . . 4  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( F `  K )  e.  V
)
24 eleq1 2301 . . . . . . 7  |-  ( v  =  ( F ` 
0 )  ->  (
v  e.  ( F
" ( 1..^ K ) )  <->  ( F `  0 )  e.  ( F " (
1..^ K ) ) ) )
2524notbid 677 . . . . . 6  |-  ( v  =  ( F ` 
0 )  ->  ( -.  v  e.  ( F " ( 1..^ K ) )  <->  -.  ( F `  0 )  e.  ( F " (
1..^ K ) ) ) )
26 df-nel 2516 . . . . . 6  |-  ( ( F `  0 )  e/  ( F "
( 1..^ K ) )  <->  -.  ( F `  0 )  e.  ( F " (
1..^ K ) ) )
2725, 26bitr4di 198 . . . . 5  |-  ( v  =  ( F ` 
0 )  ->  ( -.  v  e.  ( F " ( 1..^ K ) )  <->  ( F `  0 )  e/  ( F " ( 1..^ K ) ) ) )
28 eleq1 2301 . . . . . . 7  |-  ( v  =  ( F `  K )  ->  (
v  e.  ( F
" ( 1..^ K ) )  <->  ( F `  K )  e.  ( F " ( 1..^ K ) ) ) )
2928notbid 677 . . . . . 6  |-  ( v  =  ( F `  K )  ->  ( -.  v  e.  ( F " ( 1..^ K ) )  <->  -.  ( F `  K )  e.  ( F " (
1..^ K ) ) ) )
30 df-nel 2516 . . . . . 6  |-  ( ( F `  K )  e/  ( F "
( 1..^ K ) )  <->  -.  ( F `  K )  e.  ( F " ( 1..^ K ) ) )
3129, 30bitr4di 198 . . . . 5  |-  ( v  =  ( F `  K )  ->  ( -.  v  e.  ( F " ( 1..^ K ) )  <->  ( F `  K )  e/  ( F " ( 1..^ K ) ) ) )
3227, 31ralprg 3756 . . . 4  |-  ( ( ( F `  0
)  e.  V  /\  ( F `  K )  e.  V )  -> 
( A. v  e. 
{ ( F ` 
0 ) ,  ( F `  K ) }  -.  v  e.  ( F " (
1..^ K ) )  <-> 
( ( F ` 
0 )  e/  ( F " ( 1..^ K ) )  /\  ( F `  K )  e/  ( F " (
1..^ K ) ) ) ) )
3322, 23, 32syl2anc 415 . . 3  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( A. v  e.  { ( F ` 
0 ) ,  ( F `  K ) }  -.  v  e.  ( F " (
1..^ K ) )  <-> 
( ( F ` 
0 )  e/  ( F " ( 1..^ K ) )  /\  ( F `  K )  e/  ( F " (
1..^ K ) ) ) ) )
3420, 33bitrid 192 . 2  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( ( { ( F `  0
) ,  ( F `
 K ) }  i^i  ( F "
( 1..^ K ) ) )  =  (/)  <->  (
( F `  0
)  e/  ( F " ( 1..^ K ) )  /\  ( F `
 K )  e/  ( F " ( 1..^ K ) ) ) ) )
3519, 34bitrd 188 1  |-  ( ( F : ( 0 ... K ) --> V  /\  K  e.  NN0 )  ->  ( ( ( F " { 0 ,  K } )  i^i  ( F "
( 1..^ K ) ) )  =  (/)  <->  (
( F `  0
)  e/  ( F " ( 1..^ K ) )  /\  ( F `
 K )  e/  ( F " ( 1..^ K ) ) ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    e/ wnel 2515   A.wral 2528    i^i cin 3219   (/)c0 3520   {cpr 3706   class class class wbr 4125   "cima 4772    Fn wfn 5367   -->wf 5368   ` cfv 5372  (class class class)co 6075   0cc0 8169   1c1 8170    <_ cle 8351   NN0cn0 9542   ...cfz 10390  ..^cfzo 10527
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-fz 10391
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator