Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  inffz GIF version

Theorem inffz 16844
Description: The infimum of a finite sequence of integers. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Jim Kingdon, 15-Oct-2022.)
Assertion
Ref Expression
inffz (𝑁 ∈ (ℤ𝑀) → inf((𝑀...𝑁), ℤ, < ) = 𝑀)

Proof of Theorem inffz
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 531 . . . 4 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑥 ∈ ℤ)
21zred 9696 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑥 ∈ ℝ)
3 simprr 533 . . . 4 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℤ)
43zred 9696 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℝ)
52, 4lttri3d 8384 . 2 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 = 𝑦 ↔ (¬ 𝑥 < 𝑦 ∧ ¬ 𝑦 < 𝑥)))
6 eluzel2 9854 . 2 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
7 eluzfz1 10361 . 2 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
8 elfzle1 10357 . . . 4 (𝑧 ∈ (𝑀...𝑁) → 𝑀𝑧)
98adantl 277 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → 𝑀𝑧)
106zred 9696 . . . 4 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℝ)
11 elfzelz 10355 . . . . 5 (𝑧 ∈ (𝑀...𝑁) → 𝑧 ∈ ℤ)
1211zred 9696 . . . 4 (𝑧 ∈ (𝑀...𝑁) → 𝑧 ∈ ℝ)
13 lenlt 8345 . . . 4 ((𝑀 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (𝑀𝑧 ↔ ¬ 𝑧 < 𝑀))
1410, 12, 13syl2an 289 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → (𝑀𝑧 ↔ ¬ 𝑧 < 𝑀))
159, 14mpbid 147 . 2 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → ¬ 𝑧 < 𝑀)
165, 6, 7, 15infminti 7317 1 (𝑁 ∈ (ℤ𝑀) → inf((𝑀...𝑁), ℤ, < ) = 𝑀)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203   class class class wbr 4108  cfv 5351  (class class class)co 6049  infcinf 7273  cr 8122   < clt 8304  cle 8305  cz 9573  cuz 9849  ...cfz 10338
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-pre-ltirr 8235  ax-pre-apti 8238
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-sup 7274  df-inf 7275  df-pnf 8306  df-mnf 8307  df-xr 8308  df-ltxr 8309  df-le 8310  df-neg 8443  df-z 9574  df-uz 9850  df-fz 10339
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator