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

Theorem frecfzen2 10864
Description: The cardinality of a finite set of sequential integers with arbitrary endpoints. (Contributed by Jim Kingdon, 18-May-2020.)
Hypothesis
Ref Expression
frecfzennn.1  |-  G  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 )
Assertion
Ref Expression
frecfzen2  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M ... N )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )

Proof of Theorem frecfzen2
StepHypRef Expression
1 eluzel2 9926 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
2 eluzelz 9931 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
3 1z 9670 . . . . 5  |-  1  e.  ZZ
4 zsubcl 9685 . . . . 5  |-  ( ( 1  e.  ZZ  /\  M  e.  ZZ )  ->  ( 1  -  M
)  e.  ZZ )
53, 1, 4sylancr 418 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( 1  -  M )  e.  ZZ )
6 fzen 10447 . . . 4  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ  /\  (
1  -  M )  e.  ZZ )  -> 
( M ... N
)  ~~  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M
) ) ) )
71, 2, 5, 6syl3anc 1278 . . 3  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M ... N )  ~~  (
( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M ) ) ) )
81zcnd 9769 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  CC )
9 ax-1cn 8272 . . . . 5  |-  1  e.  CC
10 pncan3 8534 . . . . 5  |-  ( ( M  e.  CC  /\  1  e.  CC )  ->  ( M  +  ( 1  -  M ) )  =  1 )
118, 9, 10sylancl 417 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M  +  ( 1  -  M ) )  =  1 )
12 zcn 9649 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  CC )
13 zcn 9649 . . . . . . 7  |-  ( M  e.  ZZ  ->  M  e.  CC )
14 addsubass 8536 . . . . . . . 8  |-  ( ( N  e.  CC  /\  1  e.  CC  /\  M  e.  CC )  ->  (
( N  +  1 )  -  M )  =  ( N  +  ( 1  -  M
) ) )
159, 14mp3an2 1366 . . . . . . 7  |-  ( ( N  e.  CC  /\  M  e.  CC )  ->  ( ( N  + 
1 )  -  M
)  =  ( N  +  ( 1  -  M ) ) )
1612, 13, 15syl2an 289 . . . . . 6  |-  ( ( N  e.  ZZ  /\  M  e.  ZZ )  ->  ( ( N  + 
1 )  -  M
)  =  ( N  +  ( 1  -  M ) ) )
172, 1, 16syl2anc 415 . . . . 5  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( ( N  +  1 )  -  M )  =  ( N  +  ( 1  -  M ) ) )
1817eqcomd 2244 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  +  ( 1  -  M ) )  =  ( ( N  + 
1 )  -  M
) )
1911, 18oveq12d 6103 . . 3  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( ( M  +  ( 1  -  M ) ) ... ( N  +  ( 1  -  M
) ) )  =  ( 1 ... (
( N  +  1 )  -  M ) ) )
207, 19breqtrd 4156 . 2  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M ... N )  ~~  (
1 ... ( ( N  +  1 )  -  M ) ) )
21 peano2uz 9983 . . 3  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  +  1 )  e.  ( ZZ>= `  M )
)
22 uznn0sub 9954 . . 3  |-  ( ( N  +  1 )  e.  ( ZZ>= `  M
)  ->  ( ( N  +  1 )  -  M )  e. 
NN0 )
23 frecfzennn.1 . . . 4  |-  G  = frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 )
2423frecfzennn 10863 . . 3  |-  ( ( ( N  +  1 )  -  M )  e.  NN0  ->  ( 1 ... ( ( N  +  1 )  -  M ) )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )
2521, 22, 243syl 17 . 2  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( 1 ... ( ( N  +  1 )  -  M ) )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )
26 entr 7071 . 2  |-  ( ( ( M ... N
)  ~~  ( 1 ... ( ( N  +  1 )  -  M ) )  /\  ( 1 ... (
( N  +  1 )  -  M ) )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )  ->  ( M ... N )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )
2720, 25, 26syl2anc 415 1  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( M ... N )  ~~  ( `' G `  ( ( N  +  1 )  -  M ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   class class class wbr 4130    |-> cmpt 4192   `'ccnv 4773   ` cfv 5377  (class class class)co 6085  freccfrec 6661    ~~ cen 7020   CCcc 8177   0cc0 8179   1c1 8180    + caddc 8182    - cmin 8497   NN0cn0 9563   ZZcz 9644   ZZ>=cuz 9921   ...cfz 10411
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-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-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
This theorem is used by:  fzfig  10867
  Copyright terms: Public domain W3C validator