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

Theorem hashfzp1 10563
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 9324 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9328 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 zdceq 9119 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  -> DECID  A  =  B )
41, 2, 3syl2anc 408 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  -> DECID  A  =  B
)
5 exmiddc 821 . . 3  |-  (DECID  A  =  B  ->  ( A  =  B  \/  -.  A  =  B )
)
64, 5syl 14 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  =  B  \/  -.  A  =  B )
)
7 hash0 10536 . . . . 5  |-  ( `  (/) )  =  0
8 eluzelre 9329 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  RR )
98ltp1d 8681 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  <  ( B  +  1 ) )
10 peano2z 9083 . . . . . . . . 9  |-  ( B  e.  ZZ  ->  ( B  +  1 )  e.  ZZ )
1110ancri 322 . . . . . . . 8  |-  ( B  e.  ZZ  ->  (
( B  +  1 )  e.  ZZ  /\  B  e.  ZZ )
)
12 fzn 9815 . . . . . . . 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 146 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  +  1 ) ... B )  =  (/) )
1514fveq2d 5418 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( `  (/) ) )
162zcnd 9167 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1716subidd 8054 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  B )  =  0 )
187, 15, 173eqtr4a 2196 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( B  -  B ) )
19 oveq1 5774 . . . . . . 7  |-  ( A  =  B  ->  ( A  +  1 )  =  ( B  + 
1 ) )
2019oveq1d 5782 . . . . . 6  |-  ( A  =  B  ->  (
( A  +  1 ) ... B )  =  ( ( B  +  1 ) ... B ) )
2120fveq2d 5418 . . . . 5  |-  ( A  =  B  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( `  ( ( B  + 
1 ) ... B
) ) )
22 oveq2 5775 . . . . 5  |-  ( A  =  B  ->  ( B  -  A )  =  ( B  -  B ) )
2321, 22eqeq12d 2152 . . . 4  |-  ( A  =  B  ->  (
( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A
)  <->  ( `  ( ( B  +  1 ) ... B ) )  =  ( B  -  B ) ) )
2418, 23syl5ibr 155 . . 3  |-  ( A  =  B  ->  ( B  e.  ( ZZ>= `  A )  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( B  -  A ) ) )
25 uzp1 9352 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  =  A  \/  B  e.  ( ZZ>= `  ( A  +  1 ) ) ) )
26 pm2.24 610 . . . . . . . . . 10  |-  ( A  =  B  ->  ( -.  A  =  B  ->  B  e.  ( ZZ>= `  ( A  +  1
) ) ) )
2726eqcoms 2140 . . . . . . . . 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 705 . . . . . . . 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 124 . . . . . 6  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  B  e.  (
ZZ>= `  ( A  + 
1 ) ) )
32 hashfz 10560 . . . . . 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 9167 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
35 1cnd 7775 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
3616, 34, 35nppcan2d 8092 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( ( B  -  ( A  +  1 ) )  +  1 )  =  ( B  -  A
) )
3736adantl 275 . . . . 5  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  ( ( B  -  ( A  + 
1 ) )  +  1 )  =  ( B  -  A ) )
3833, 37eqtrd 2170 . . . 4  |-  ( ( -.  A  =  B  /\  B  e.  (
ZZ>= `  A ) )  ->  ( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A ) )
3938ex 114 . . 3  |-  ( -.  A  =  B  -> 
( B  e.  (
ZZ>= `  A )  -> 
( `  ( ( A  +  1 ) ... B ) )  =  ( B  -  A
) ) )
4024, 39jaoi 705 . 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 103    <-> wb 104    \/ wo 697  DECID wdc 819    = wceq 1331    e. wcel 1480   (/)c0 3358   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   0cc0 7613   1c1 7614    + caddc 7616    < clt 7793    - cmin 7926   ZZcz 9047   ZZ>=cuz 9319   ...cfz 9783  ♯chash 10514
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-ilim 4286  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-frec 6281  df-1o 6306  df-er 6422  df-en 6628  df-dom 6629  df-fin 6630  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-inn 8714  df-n0 8971  df-z 9048  df-uz 9320  df-fz 9784  df-ihash 10515
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator