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

Theorem hashfz 11148
Description: Value of the numeric cardinality of a nonempty integer range. (Contributed by Stefan O'Rear, 12-Sep-2014.) (Proof shortened by Mario Carneiro, 15-Apr-2015.)
Assertion
Ref Expression
hashfz  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( ( B  -  A )  +  1 ) )

Proof of Theorem hashfz
StepHypRef Expression
1 eluzel2 9821 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9826 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 1z 9566 . . . . . 6  |-  1  e.  ZZ
4 zsubcl 9581 . . . . . 6  |-  ( ( 1  e.  ZZ  /\  A  e.  ZZ )  ->  ( 1  -  A
)  e.  ZZ )
53, 1, 4sylancr 414 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1  -  A )  e.  ZZ )
6 fzen 10340 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  (
1  -  A )  e.  ZZ )  -> 
( A ... B
)  ~~  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) ) )
71, 2, 5, 6syl3anc 1274 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A ) ) ) )
81zcnd 9664 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
9 ax-1cn 8185 . . . . . 6  |-  1  e.  CC
10 pncan3 8446 . . . . . 6  |-  ( ( A  e.  CC  /\  1  e.  CC )  ->  ( A  +  ( 1  -  A ) )  =  1 )
118, 9, 10sylancl 413 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  +  ( 1  -  A ) )  =  1 )
12 1cnd 8255 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
132zcnd 9664 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1413, 8subcld 8549 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  CC )
1513, 12, 8addsub12d 8572 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( 1  +  ( B  -  A ) ) )
1612, 14, 15comraddd 8395 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( ( B  -  A )  +  1 ) )
1711, 16oveq12d 6046 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) )  =  ( 1 ... (
( B  -  A
)  +  1 ) ) )
187, 17breqtrd 4119 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
1 ... ( ( B  -  A )  +  1 ) ) )
191, 2fzfigd 10756 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  e.  Fin )
20 1zzd 9567 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  ZZ )
212, 1zsubcld 9668 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  ZZ )
2221peano2zd 9666 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  A )  +  1 )  e.  ZZ )
2320, 22fzfigd 10756 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1 ... ( ( B  -  A )  +  1 ) )  e. 
Fin )
24 hashen 11109 . . . 4  |-  ( ( ( A ... B
)  e.  Fin  /\  ( 1 ... (
( B  -  A
)  +  1 ) )  e.  Fin )  ->  ( ( `  ( A ... B ) )  =  ( `  (
1 ... ( ( B  -  A )  +  1 ) ) )  <-> 
( A ... B
)  ~~  ( 1 ... ( ( B  -  A )  +  1 ) ) ) )
2519, 23, 24syl2anc 411 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( `  ( A ... B
) )  =  ( `  ( 1 ... (
( B  -  A
)  +  1 ) ) )  <->  ( A ... B )  ~~  (
1 ... ( ( B  -  A )  +  1 ) ) ) )
2618, 25mpbird 167 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( `  (
1 ... ( ( B  -  A )  +  1 ) ) ) )
27 uznn0sub 9849 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  NN0 )
28 peano2nn0 9501 . . 3  |-  ( ( B  -  A )  e.  NN0  ->  ( ( B  -  A )  +  1 )  e. 
NN0 )
29 hashfz1 11108 . . 3  |-  ( ( ( B  -  A
)  +  1 )  e.  NN0  ->  ( `  (
1 ... ( ( B  -  A )  +  1 ) ) )  =  ( ( B  -  A )  +  1 ) )
3027, 28, 293syl 17 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
1 ... ( ( B  -  A )  +  1 ) ) )  =  ( ( B  -  A )  +  1 ) )
3126, 30eqtrd 2264 1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( ( B  -  A )  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    e. wcel 2202   class class class wbr 4093   ` cfv 5333  (class class class)co 6028    ~~ cen 6950   Fincfn 6952   CCcc 8090   1c1 8093    + caddc 8095    - cmin 8409   NN0cn0 9461   ZZcz 9540   ZZ>=cuz 9816   ...cfz 10305  ♯chash 11100
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 619  ax-in2 620  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-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-1o 6625  df-er 6745  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817  df-fz 10306  df-ihash 11101
This theorem is referenced by:  hashfzo  11149  hashfzp1  11151  hashfz0  11152  0sgmppw  15807  gausslemma2dlem5  15885  gsumgfsum  16813
  Copyright terms: Public domain W3C validator