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

Theorem hashfz 10930
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 9623 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9627 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 1z 9369 . . . . . 6  |-  1  e.  ZZ
4 zsubcl 9384 . . . . . 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 10135 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  (
1  -  A )  e.  ZZ )  -> 
( A ... B
)  ~~  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) ) )
71, 2, 5, 6syl3anc 1249 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A ) ) ) )
81zcnd 9466 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
9 ax-1cn 7989 . . . . . 6  |-  1  e.  CC
10 pncan3 8251 . . . . . 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 8059 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
132zcnd 9466 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1413, 8subcld 8354 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  CC )
1513, 12, 8addsub12d 8377 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( 1  +  ( B  -  A ) ) )
1612, 14, 15comraddd 8200 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( ( B  -  A )  +  1 ) )
1711, 16oveq12d 5943 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) )  =  ( 1 ... (
( B  -  A
)  +  1 ) ) )
187, 17breqtrd 4060 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
1 ... ( ( B  -  A )  +  1 ) ) )
191, 2fzfigd 10540 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  e.  Fin )
20 1zzd 9370 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  ZZ )
212, 1zsubcld 9470 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  ZZ )
2221peano2zd 9468 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  A )  +  1 )  e.  ZZ )
2320, 22fzfigd 10540 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1 ... ( ( B  -  A )  +  1 ) )  e. 
Fin )
24 hashen 10893 . . . 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 9650 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  NN0 )
28 peano2nn0 9306 . . 3  |-  ( ( B  -  A )  e.  NN0  ->  ( ( B  -  A )  +  1 )  e. 
NN0 )
29 hashfz1 10892 . . 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 2229 1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( ( B  -  A )  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1364    e. wcel 2167   class class class wbr 4034   ` cfv 5259  (class class class)co 5925    ~~ cen 6806   Fincfn 6808   CCcc 7894   1c1 7897    + caddc 7899    - cmin 8214   NN0cn0 9266   ZZcz 9343   ZZ>=cuz 9618   ...cfz 10100  ♯chash 10884
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-1o 6483  df-er 6601  df-en 6809  df-dom 6810  df-fin 6811  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-ihash 10885
This theorem is referenced by:  hashfzo  10931  hashfzp1  10933  hashfz0  10934  0sgmppw  15313  gausslemma2dlem5  15391
  Copyright terms: Public domain W3C validator