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

Theorem hashfz 11240
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 9905 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9910 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 1z 9649 . . . . . 6  |-  1  e.  ZZ
4 zsubcl 9664 . . . . . 6  |-  ( ( 1  e.  ZZ  /\  A  e.  ZZ )  ->  ( 1  -  A
)  e.  ZZ )
53, 1, 4sylancr 418 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1  -  A )  e.  ZZ )
6 fzen 10426 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ  /\  (
1  -  A )  e.  ZZ )  -> 
( A ... B
)  ~~  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) ) )
71, 2, 5, 6syl3anc 1278 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A ) ) ) )
81zcnd 9748 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
9 ax-1cn 8262 . . . . . 6  |-  1  e.  CC
10 pncan3 8524 . . . . . 6  |-  ( ( A  e.  CC  /\  1  e.  CC )  ->  ( A  +  ( 1  -  A ) )  =  1 )
118, 9, 10sylancl 417 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  +  ( 1  -  A ) )  =  1 )
12 1cnd 8332 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
132zcnd 9748 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1413, 8subcld 8627 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  CC )
1513, 12, 8addsub12d 8650 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( 1  +  ( B  -  A ) ) )
1612, 14, 15comraddd 8473 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  +  ( 1  -  A ) )  =  ( ( B  -  A )  +  1 ) )
1711, 16oveq12d 6093 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( A  +  ( 1  -  A ) ) ... ( B  +  ( 1  -  A
) ) )  =  ( 1 ... (
( B  -  A
)  +  1 ) ) )
187, 17breqtrd 4151 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  ~~  (
1 ... ( ( B  -  A )  +  1 ) ) )
191, 2fzfigd 10846 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A ... B )  e.  Fin )
20 1zzd 9650 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  ZZ )
212, 1zsubcld 9752 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  ZZ )
2221peano2zd 9750 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  A )  +  1 )  e.  ZZ )
2320, 22fzfigd 10846 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( 1 ... ( ( B  -  A )  +  1 ) )  e. 
Fin )
24 hashen 11201 . . . 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 415 . . 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 9933 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  A )  e.  NN0 )
28 peano2nn0 9582 . . 3  |-  ( ( B  -  A )  e.  NN0  ->  ( ( B  -  A )  +  1 )  e. 
NN0 )
29 hashfz1 11200 . . 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 2271 1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  ( A ... B ) )  =  ( ( B  -  A )  +  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4125   ` cfv 5372  (class class class)co 6075    ~~ cen 7010   Fincfn 7012   CCcc 8167   1c1 8170    + caddc 8172    - cmin 8487   NN0cn0 9542   ZZcz 9623   ZZ>=cuz 9900   ...cfz 10390  ♯chash 11192
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-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  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-apti 8284  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-dc 847  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-csb 3148  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-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  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-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-er 6797  df-en 7013  df-dom 7014  df-fin 7015  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  df-ihash 11193
This theorem is referenced by:  hashfzo  11241  hashfzp1  11243  hashfz0  11244  ballotfilem2  13206  gzsumgsum  14132  0sgmppw  16021  gausslemma2dlem5  16099  lgseisenlem4  16106
  Copyright terms: Public domain W3C validator