ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  hashfzp1 Unicode version
Theorem hashfzp1 10933
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 9623 . . . 4 |- ( B e. ( ZZ>= ` A ) -> A e. ZZ )
2 eluzelz 9627 . . . 4 |- ( B e. ( ZZ>= ` A ) -> B e. ZZ )
3 zdceq 9418 . . . 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 10905 . . . . 5 |- (♯ ` (/) ) = 0
8 eluzelre 9628 . . . . . . . 8 |- ( B e. ( ZZ>= ` A ) -> B e. RR )
98ltp1d 8974 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> B < ( B + 1 ) )
10 peano2z 9379 . . . . . . . . 9 |- ( B e. ZZ -> ( B + 1 ) e. ZZ )
1110ancri 324 . . . . . . . 8 |- ( B e. ZZ -> ( ( B + 1 ) e. ZZ /\ B e. ZZ ) )
12 fzn 10134 . . . . . . . 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 5565 . . . . 5 |- ( B e. ( ZZ>= ` A ) -> (♯ ` ( ( B + 1 ) ... B ) ) = (♯ ` (/) ) )
162zcnd 9466 . . . . . 6 |- ( B e. ( ZZ>= ` A ) -> B e. CC )
1716subidd 8342 . . . . 5 |- ( B e. ( ZZ>= ` A ) -> ( B - B ) = 0 )
187, 15, 173eqtr4a 2255 . . . 4 |- ( B e. ( ZZ>= ` A ) -> (♯ ` ( ( B + 1 ) ... B ) ) = ( B - B ) )
19 oveq1 5932 . . . . . . 7 |- ( A = B -> ( A + 1 ) = ( B + 1 ) )
2019oveq1d 5940 . . . . . 6 |- ( A = B -> ( ( A + 1 ) ... B ) = ( ( B + 1 ) ... B ) )
2120fveq2d 5565 . . . . 5 |- ( A = B -> (♯ ` ( ( A + 1 ) ... B ) ) = (♯ ` ( ( B + 1 ) ... B ) ) )
22 oveq2 5933 . . . . 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 9652 . . . . . . . 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 10930 . . . . . 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 9466 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> A e. CC )
35 1cnd 8059 . . . . . . 7 |- ( B e. ( ZZ>= ` A ) -> 1 e. CC )
3616, 34, 35nppcan2d 8380 . . . . . 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 3451   class class class wbr 4034   ` cfv 5259  (class class class)co 5925   0cc0 7896   1c1 7897   + caddc 7899   < clt 8078   - cmin 8214   ZZcz 9343   ZZ>=cuz 9618   ...cfz 10100  ♯chash 10884
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 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012
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 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-1o 6483  df-er 6601  df-en 6809  df-dom 6810  df-fin 6811  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-ihash 10885
This theorem is referenced by:  2lgslem1  15416
  Copyright terms: Public domain W3C validator