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

Theorem hashfzp1 10916
Description: Value of the numeric cardinality of a (possibly empty) integer range. (Contributed by AV, 19-Jun-2021.)
Assertion
Ref Expression
hashfzp1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( A  +  1 ) ... B ) )  =  ( B  -  A ) )

Proof of Theorem hashfzp1
StepHypRef Expression
1 eluzel2 9606 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9610 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 zdceq 9401 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  -> DECID  A  =  B )
41, 2, 3syl2anc 411 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  -> DECID  A  =  B
)
5 exmiddc 837 . . 3  |-  (DECID  A  =  B  ->  ( A  =  B  \/  -.  A  =  B )
)
64, 5syl 14 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  =  B  \/  -.  A  =  B )
)
7 hash0 10888 . . . . 5  |-  ( `  (/) )  =  0
8 eluzelre 9611 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  RR )
98ltp1d 8957 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  <  ( B  +  1 ) )
10 peano2z 9362 . . . . . . . . 9  |-  ( B  e.  ZZ  ->  ( B  +  1 )  e.  ZZ )
1110ancri 324 . . . . . . . 8  |-  ( B  e.  ZZ  ->  (
( B  +  1 )  e.  ZZ  /\  B  e.  ZZ )
)
12 fzn 10117 . . . . . . . 8  |-  ( ( ( B  +  1 )  e.  ZZ  /\  B  e.  ZZ )  ->  ( B  <  ( B  +  1 )  <-> 
( ( B  + 
1 ) ... B
)  =  (/) ) )
132, 11, 123syl 17 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  <  ( B  +  1 )  <->  ( ( B  +  1 ) ... B )  =  (/) ) )
149, 13mpbid 147 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  +  1 ) ... B )  =  (/) )
1514fveq2d 5562 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( `  (/) ) )
162zcnd 9449 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1716subidd 8325 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  B )  =  0 )
187, 15, 173eqtr4a 2255 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( B  -  B ) )
19 oveq1 5929 . . . . . . 7  |-  ( A  =  B  ->  ( A  +  1 )  =  ( B  + 
1 ) )
2019oveq1d 5937 . . . . . 6  |-  ( A  =  B  ->  (
( A  +  1 ) ... B )  =  ( ( B  +  1 ) ... B ) )
2120fveq2d 5562 . . . . 5  |-  ( A  =  B  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( `  ( ( B  + 
1 ) ... B
) ) )
22 oveq2 5930 . . . . 5  |-  ( A  =  B  ->  ( B  -  A )  =  ( B  -  B ) )
2321, 22eqeq12d 2211 . . . 4  |-  ( A  =  B  ->  (
( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A
)  <->  ( `  ( ( B  +  1 ) ... B ) )  =  ( B  -  B ) ) )
2418, 23imbitrrid 156 . . 3  |-  ( A  =  B  ->  ( B  e.  ( ZZ>= `  A )  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( B  -  A ) ) )
25 uzp1 9635 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  =  A  \/  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
26 pm2.24 622 . . . . . . . . . 10  |-  ( A  =  B  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1
) ) ) )
2726eqcoms 2199 . . . . . . . . 9  |-  ( B  =  A  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1
) ) ) )
28 ax-1 6 . . . . . . . . 9  |-  ( B  e.  ( ZZ>= `  ( A  +  1 ) )  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
2927, 28jaoi 717 . . . . . . . 8  |-  ( ( B  =  A  \/  B  e.  ( ZZ>= `  ( A  +  1
) ) )  -> 
( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
3025, 29syl 14 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
3130impcom 125 . . . . . 6  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  B  e.  (
ZZ>= `  ( A  + 
1 ) ) )
32 hashfz 10913 . . . . . 6  |-  ( B  e.  ( ZZ>= `  ( A  +  1 ) )  ->  ( `  (
( A  +  1 ) ... B ) )  =  ( ( B  -  ( A  +  1 ) )  +  1 ) )
3331, 32syl 14 . . . . 5  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  ( `  ( ( A  +  1 ) ... B ) )  =  ( ( B  -  ( A  + 
1 ) )  +  1 ) )
341zcnd 9449 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
35 1cnd 8042 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
3616, 34, 35nppcan2d 8363 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  ( A  +  1 ) )  +  1 )  =  ( B  -  A
) )
3736adantl 277 . . . . 5  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  ( ( B  -  ( A  + 
1 ) )  +  1 )  =  ( B  -  A ) )
3833, 37eqtrd 2229 . . . 4  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  ( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A ) )
3938ex 115 . . 3  |-  ( -.  A  =  B  -> 
( B  e.  (
ZZ>= `  A )  -> 
( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A
) ) )
4024, 39jaoi 717 . 2  |-  ( ( A  =  B  \/  -.  A  =  B
)  ->  ( B  e.  ( ZZ>= `  A )  ->  ( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A ) ) )
416, 40mpcom 36 1  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( A  +  1 ) ... B ) )  =  ( B  -  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709  DECID wdc 835    = wceq 1364    e. wcel 2167   (/)c0 3450   class class class wbr 4033   ` cfv 5258  (class class class)co 5922   0cc0 7879   1c1 7880    + caddc 7882    < clt 8061    - cmin 8197   ZZcz 9326   ZZ>=cuz 9601   ...cfz 10083  ♯chash 10867
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 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995
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 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-1o 6474  df-er 6592  df-en 6800  df-dom 6801  df-fin 6802  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-fz 10084  df-ihash 10868
This theorem is referenced by:  2lgslem1  15332
  Copyright terms: Public domain W3C validator