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

Theorem fzm1 10507
Description: Choices for an element of a finite interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
fzm1  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( K  e.  ( M ... N
)  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )

Proof of Theorem fzm1
StepHypRef Expression
1 oveq1 6092 . . . . . . 7  |-  ( N  =  M  ->  ( N ... N )  =  ( M ... N
) )
21eleq2d 2308 . . . . . 6  |-  ( N  =  M  ->  ( K  e.  ( N ... N )  <->  K  e.  ( M ... N ) ) )
3 elfz1eq 10439 . . . . . 6  |-  ( K  e.  ( N ... N )  ->  K  =  N )
42, 3biimtrrdi 164 . . . . 5  |-  ( N  =  M  ->  ( K  e.  ( M ... N )  ->  K  =  N ) )
5 olc 723 . . . . 5  |-  ( K  =  N  ->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) )
64, 5syl6 33 . . . 4  |-  ( N  =  M  ->  ( K  e.  ( M ... N )  ->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
76adantl 277 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( K  e.  ( M ... N )  ->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
8 noel 3525 . . . . . 6  |-  -.  K  e.  (/)
9 eluzelz 9931 . . . . . . . . . . . 12  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ZZ )
109adantr 276 . . . . . . . . . . 11  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  N  e.  ZZ )
1110zred 9768 . . . . . . . . . 10  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  N  e.  RR )
1211ltm1d 9262 . . . . . . . . 9  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( N  -  1 )  <  N )
13 breq2 4134 . . . . . . . . . 10  |-  ( N  =  M  ->  (
( N  -  1 )  <  N  <->  ( N  -  1 )  < 
M ) )
1413adantl 277 . . . . . . . . 9  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  (
( N  -  1 )  <  N  <->  ( N  -  1 )  < 
M ) )
1512, 14mpbid 147 . . . . . . . 8  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( N  -  1 )  <  M )
16 eluzel2 9926 . . . . . . . . . 10  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
1716adantr 276 . . . . . . . . 9  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  M  e.  ZZ )
18 1zzd 9671 . . . . . . . . . 10  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  1  e.  ZZ )
1910, 18zsubcld 9773 . . . . . . . . 9  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( N  -  1 )  e.  ZZ )
20 fzn 10446 . . . . . . . . 9  |-  ( ( M  e.  ZZ  /\  ( N  -  1
)  e.  ZZ )  ->  ( ( N  -  1 )  < 
M  <->  ( M ... ( N  -  1
) )  =  (/) ) )
2117, 19, 20syl2anc 415 . . . . . . . 8  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  (
( N  -  1 )  <  M  <->  ( M ... ( N  -  1 ) )  =  (/) ) )
2215, 21mpbid 147 . . . . . . 7  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( M ... ( N  - 
1 ) )  =  (/) )
2322eleq2d 2308 . . . . . 6  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( K  e.  ( M ... ( N  -  1 ) )  <->  K  e.  (/) ) )
248, 23mtbiri 686 . . . . 5  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  -.  K  e.  ( M ... ( N  -  1 ) ) )
2524pm2.21d 628 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( K  e.  ( M ... ( N  -  1 ) )  ->  K  e.  ( M ... N
) ) )
26 eluzfz2 10436 . . . . . . 7  |-  ( N  e.  ( ZZ>= `  M
)  ->  N  e.  ( M ... N ) )
2726ad2antrr 492 . . . . . 6  |-  ( ( ( N  e.  (
ZZ>= `  M )  /\  N  =  M )  /\  K  =  N
)  ->  N  e.  ( M ... N ) )
28 eleq1 2301 . . . . . . 7  |-  ( K  =  N  ->  ( K  e.  ( M ... N )  <->  N  e.  ( M ... N ) ) )
2928adantl 277 . . . . . 6  |-  ( ( ( N  e.  (
ZZ>= `  M )  /\  N  =  M )  /\  K  =  N
)  ->  ( K  e.  ( M ... N
)  <->  N  e.  ( M ... N ) ) )
3027, 29mpbird 167 . . . . 5  |-  ( ( ( N  e.  (
ZZ>= `  M )  /\  N  =  M )  /\  K  =  N
)  ->  K  e.  ( M ... N ) )
3130ex 115 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( K  =  N  ->  K  e.  ( M ... N ) ) )
3225, 31jaod 729 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  (
( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N )  ->  K  e.  ( M ... N ) ) )
337, 32impbid 129 . 2  |-  ( ( N  e.  ( ZZ>= `  M )  /\  N  =  M )  ->  ( K  e.  ( M ... N )  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
34 elfzp1 10479 . . . 4  |-  ( ( N  -  1 )  e.  ( ZZ>= `  M
)  ->  ( K  e.  ( M ... (
( N  -  1 )  +  1 ) )  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  ( ( N  - 
1 )  +  1 ) ) ) )
3534adantl 277 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  ( K  e.  ( M ... ( ( N  - 
1 )  +  1 ) )  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  ( ( N  - 
1 )  +  1 ) ) ) )
369adantr 276 . . . . . . 7  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  N  e.  ZZ )
3736zcnd 9769 . . . . . 6  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  N  e.  CC )
38 npcan1 8705 . . . . . 6  |-  ( N  e.  CC  ->  (
( N  -  1 )  +  1 )  =  N )
3937, 38syl 14 . . . . 5  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  (
( N  -  1 )  +  1 )  =  N )
4039oveq2d 6101 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  ( M ... ( ( N  -  1 )  +  1 ) )  =  ( M ... N
) )
4140eleq2d 2308 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  ( K  e.  ( M ... ( ( N  - 
1 )  +  1 ) )  <->  K  e.  ( M ... N ) ) )
4239eqeq2d 2250 . . . 4  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  ( K  =  ( ( N  -  1 )  +  1 )  <->  K  =  N ) )
4342orbi2d 802 . . 3  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  (
( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  ( ( N  -  1 )  +  1 ) )  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
4435, 41, 433bitr3d 218 . 2  |-  ( ( N  e.  ( ZZ>= `  M )  /\  ( N  -  1 )  e.  ( ZZ>= `  M
) )  ->  ( K  e.  ( M ... N )  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
45 uzm1 9953 . 2  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( N  =  M  \/  ( N  -  1 )  e.  ( ZZ>= `  M
) ) )
4633, 44, 45mpjaodan 810 1  |-  ( N  e.  ( ZZ>= `  M
)  ->  ( K  e.  ( M ... N
)  <->  ( K  e.  ( M ... ( N  -  1 ) )  \/  K  =  N ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   (/)c0 3520   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   CCcc 8177   1c1 8180    + caddc 8182    < clt 8360    - cmin 8497   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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  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-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-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  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-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  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:  bcpasc  11204  phibndlem  12994  lgsdir2lem2  16148
  Copyright terms: Public domain W3C validator