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

Theorem hashfz 10966
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 9653 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9657 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 1z 9398 . . . . . 6  |-  1  e.  ZZ
4 zsubcl 9413 . . . . . 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 10165 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  (
1  -  A )  e.  ZZ )  -> 
( A ... B
)  ~~  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) ) )
71, 2, 5, 6syl3anc 1250 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A ) ) ) )
81zcnd 9496 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
9 ax-1cn 8018 . . . . . 6  |-  1  e.  CC
10 pncan3 8280 . . . . . 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 8088 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
132zcnd 9496 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1413, 8subcld 8383 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  CC )
1513, 12, 8addsub12d 8406 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( 1  +  ( B  -  A ) ) )
1612, 14, 15comraddd 8229 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( ( B  -  A )  +  1 ) )
1711, 16oveq12d 5962 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) )  =  ( 1 ... (
( B  -  A
)  +  1 ) ) )
187, 17breqtrd 4070 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
1 ... ( ( B  -  A )  +  1 ) ) )
191, 2fzfigd 10576 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  e.  Fin )
20 1zzd 9399 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  ZZ )
212, 1zsubcld 9500 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  ZZ )
2221peano2zd 9498 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  A )  +  1 )  e.  ZZ )
2320, 22fzfigd 10576 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1 ... ( ( B  -  A )  +  1 ) )  e. 
Fin )
24 hashen 10929 . . . 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 9680 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  NN0 )
28 peano2nn0 9335 . . 3  |-  ( ( B  -  A )  e.  NN0  ->  ( ( B  -  A )  +  1 )  e. 
NN0 )
29 hashfz1 10928 . . 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 2238 1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( ( B  -  A )  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1373    e. wcel 2176   class class class wbr 4044   ` cfv 5271  (class class class)co 5944    ~~ cen 6825   Fincfn 6827   CCcc 7923   1c1 7926    + caddc 7928    - cmin 8243   NN0cn0 9295   ZZcz 9372   ZZ>=cuz 9648   ...cfz 10130  ♯chash 10920
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-addass 8027  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-0id 8033  ax-rnegex 8034  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-apti 8040  ax-pre-ltadd 8041
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-id 4340  df-iord 4413  df-on 4415  df-ilim 4416  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-frec 6477  df-1o 6502  df-er 6620  df-en 6828  df-dom 6829  df-fin 6830  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-inn 9037  df-n0 9296  df-z 9373  df-uz 9649  df-fz 10131  df-ihash 10921
This theorem is referenced by:  hashfzo  10967  hashfzp1  10969  hashfz0  10970  0sgmppw  15465  gausslemma2dlem5  15543
  Copyright terms: Public domain W3C validator