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

Theorem hashfzp1 11006
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 9688 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  ZZ )
2 eluzelz 9692 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  ZZ )
3 zdceq 9483 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  -> DECID  A  =  B )
41, 2, 3syl2anc 411 . . 3  |-  ( B  e.  ( ZZ>= `  A
)  -> DECID  A  =  B
)
5 exmiddc 838 . . 3  |-  (DECID  A  =  B  ->  ( A  =  B  \/  -.  A  =  B )
)
64, 5syl 14 . 2  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( A  =  B  \/  -.  A  =  B )
)
7 hash0 10978 . . . . 5  |-  ( `  (/) )  =  0
8 eluzelre 9693 . . . . . . . 8  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  RR )
98ltp1d 9038 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  <  ( B  +  1 ) )
10 peano2z 9443 . . . . . . . . 9  |-  ( B  e.  ZZ  ->  ( B  +  1 )  e.  ZZ )
1110ancri 324 . . . . . . . 8  |-  ( B  e.  ZZ  ->  (
( B  +  1 )  e.  ZZ  /\  B  e.  ZZ )
)
12 fzn 10199 . . . . . . . 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 5603 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( `  (/) ) )
162zcnd 9531 . . . . . 6  |-  ( B  e.  ( ZZ>= `  A
)  ->  B  e.  CC )
1716subidd 8406 . . . . 5  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( B  -  B )  =  0 )
187, 15, 173eqtr4a 2266 . . . 4  |-  ( B  e.  ( ZZ>= `  A
)  ->  ( `  (
( B  +  1 ) ... B ) )  =  ( B  -  B ) )
19 oveq1 5974 . . . . . . 7  |-  ( A  =  B  ->  ( A  +  1 )  =  ( B  + 
1 ) )
2019oveq1d 5982 . . . . . 6  |-  ( A  =  B  ->  (
( A  +  1 ) ... B )  =  ( ( B  +  1 ) ... B ) )
2120fveq2d 5603 . . . . 5  |-  ( A  =  B  ->  ( `  ( ( A  + 
1 ) ... B
) )  =  ( `  ( ( B  + 
1 ) ... B
) ) )
22 oveq2 5975 . . . . 5  |-  ( A  =  B  ->  ( B  -  A )  =  ( B  -  B ) )
2321, 22eqeq12d 2222 . . . 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 9717 . . . . . . . 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 2210 . . . . . . . . 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 718 . . . . . . . 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 11003 . . . . . 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 9531 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  A  e.  CC )
35 1cnd 8123 . . . . . . 7  |-  ( B  e.  ( ZZ>= `  A
)  ->  1  e.  CC )
3616, 34, 35nppcan2d 8444 . . . . . 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 2240 . . . 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 718 . 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 710  DECID wdc 836    = wceq 1373    e. wcel 2178   (/)c0 3468   class class class wbr 4059   ` cfv 5290  (class class class)co 5967   0cc0 7960   1c1 7961    + caddc 7963    < clt 8142    - cmin 8278   ZZcz 9407   ZZ>=cuz 9683   ...cfz 10165  ♯chash 10957
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-frec 6500  df-1o 6525  df-er 6643  df-en 6851  df-dom 6852  df-fin 6853  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-inn 9072  df-n0 9331  df-z 9408  df-uz 9684  df-fz 10166  df-ihash 10958
This theorem is referenced by:  2lgslem1  15683
  Copyright terms: Public domain W3C validator