ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  hashfzp1 Unicode version
Theorem hashfzp1 11265
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 9926 . . . 4 |- ( B e. ( ZZ>= ` A ) -> A e. ZZ )
2 eluzelz 9931 . . . 4 |- ( B e. ( ZZ>= ` A ) -> B e. ZZ )
3 zdceq 9720 . . . 4 |- ( ( A e. ZZ /\ B e. ZZ ) -> DECID A = B )
41, 2, 3syl2anc 415 . . 3 |- ( B e. ( ZZ>= ` A ) -> DECID A = B )
5 exmiddc 848 . . 3 |- (DECID A = B -> ( A = B \/ -. A = B ) )
64, 5syl 14 . 2 |- ( B e. ( ZZ>= ` A ) -> ( A = B \/ -. A = B ) )
7 hash0 11235 . . . . 5 |- (♯ ` (/) ) = 0
8 eluzelre 9932 . . . . . . . 8 |- ( B e. ( ZZ>= ` A ) -> B e. RR )
98ltp1d 9260 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> B < ( B + 1 ) )
10 peano2z 9680 . . . . . . . . 9 |- ( B e. ZZ -> ( B + 1 ) e. ZZ )
1110ancri 324 . . . . . . . 8 |- ( B e. ZZ -> ( ( B + 1 ) e. ZZ /\ B e. ZZ ) )
12 fzn 10446 . . . . . . . 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 5699 . . . . 5 |- ( B e. ( ZZ>= ` A ) -> (♯ ` ( ( B + 1 ) ... B ) ) = (♯ ` (/) ) )
162zcnd 9769 . . . . . 6 |- ( B e. ( ZZ>= ` A ) -> B e. CC )
1716subidd 8625 . . . . 5 |- ( B e. ( ZZ>= ` A ) -> ( B - B ) = 0 )
187, 15, 173eqtr4a 2297 . . . 4 |- ( B e. ( ZZ>= ` A ) -> (♯ ` ( ( B + 1 ) ... B ) ) = ( B - B ) )
19 oveq1 6092 . . . . . . 7 |- ( A = B -> ( A + 1 ) = ( B + 1 ) )
2019oveq1d 6100 . . . . . 6 |- ( A = B -> ( ( A + 1 ) ... B ) = ( ( B + 1 ) ... B ) )
2120fveq2d 5699 . . . . 5 |- ( A = B -> (♯ ` ( ( A + 1 ) ... B ) ) = (♯ ` ( ( B + 1 ) ... B ) ) )
22 oveq2 6093 . . . . 5 |- ( A = B -> ( B - A ) = ( B - B ) )
2321, 22eqeq12d 2253 . . . 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 9956 . . . . . . . 8 |- ( B e. ( ZZ>= ` A ) -> ( B = A \/ B e. ( ZZ>= ` ( A + 1 ) ) ) )
26 pm2.24 630 . . . . . . . . . 10 |- ( A = B -> ( -. A = B -> B e. ( ZZ>= ` ( A + 1 ) ) ) )
2726eqcoms 2241 . . . . . . . . 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 728 . . . . . . . 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 11262 . . . . . 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 9769 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> A e. CC )
35 1cnd 8342 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> 1 e. CC )
3616, 34, 35nppcan2d 8663 . . . . . 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 2271 . . . 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 728 . 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
This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   (/)c0 3520   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   0cc0 8179   1c1 8180   + caddc 8182   < clt 8360   - cmin 8497   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411  ♯chash 11214
This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295
This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-ihash 11215
This theorem is used by:  2lgslem1  16210
  Copyright terms: Public domain W3C validator