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

Theorem hashfzp1 11151
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 9821 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9826 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 zdceq 9616 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  -> DECID  A  =  B )
41, 2, 3syl2anc 411 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  -> DECID  A  =  B
)
5 exmiddc 844 . . 3  |-  (DECID  A  =  B  ->  ( A  =  B  \/  -.  A  =  B )
)
64, 5syl 14 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  =  B  \/  -.  A  =  B )
)
7 hash0 11121 . . . . 5  |-  ( `  (/) )  =  0
8 eluzelre 9827 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  RR )
98ltp1d 9169 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  <  ( B  +  1 ) )
10 peano2z 9576 . . . . . . . . 9  |-  ( B  e.  ZZ  ->  ( B  +  1 )  e.  ZZ )
1110ancri 324 . . . . . . . 8  |-  ( B  e.  ZZ  ->  (
( B  +  1 )  e.  ZZ  /\  B  e.  ZZ )
)
12 fzn 10339 . . . . . . . 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 5652 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( `  (/) ) )
162zcnd 9664 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1716subidd 8537 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  B )  =  0 )
187, 15, 173eqtr4a 2290 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( B  -  B ) )
19 oveq1 6035 . . . . . . 7  |-  ( A  =  B  ->  ( A  +  1 )  =  ( B  + 
1 ) )
2019oveq1d 6043 . . . . . 6  |-  ( A  =  B  ->  (
( A  +  1 ) ... B )  =  ( ( B  +  1 ) ... B ) )
2120fveq2d 5652 . . . . 5  |-  ( A  =  B  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( `  ( ( B  + 
1 ) ... B
) ) )
22 oveq2 6036 . . . . 5  |-  ( A  =  B  ->  ( B  -  A )  =  ( B  -  B ) )
2321, 22eqeq12d 2246 . . . 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 9851 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  =  A  \/  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
26 pm2.24 626 . . . . . . . . . 10  |-  ( A  =  B  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1
) ) ) )
2726eqcoms 2234 . . . . . . . . 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 724 . . . . . . . 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 11148 . . . . . 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 9664 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
35 1cnd 8255 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
3616, 34, 35nppcan2d 8575 . . . . . 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 2264 . . . 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 724 . 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 716  DECID wdc 842    = wceq 1398    e. wcel 2202   (/)c0 3496   class class class wbr 4093   ` cfv 5333  (class class class)co 6028   0cc0 8092   1c1 8093    + caddc 8095    < clt 8273    - cmin 8409   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:  2lgslem1  15910
  Copyright terms: Public domain W3C validator