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

Theorem inffz 16907
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 9706 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑥 ∈ ℝ)
3 simprr 533 . . . 4 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℤ)
43zred 9706 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℝ)
52, 4lttri3d 8393 . 2 ((𝑁 ∈ (ℤ𝑀) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 = 𝑦 ↔ (¬ 𝑥 < 𝑦 ∧ ¬ 𝑦 < 𝑥)))
6 eluzel2 9864 . 2 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
7 eluzfz1 10371 . 2 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
8 elfzle1 10367 . . . 4 (𝑧 ∈ (𝑀...𝑁) → 𝑀𝑧)
98adantl 277 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → 𝑀𝑧)
106zred 9706 . . . 4 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℝ)
11 elfzelz 10365 . . . . 5 (𝑧 ∈ (𝑀...𝑁) → 𝑧 ∈ ℤ)
1211zred 9706 . . . 4 (𝑧 ∈ (𝑀...𝑁) → 𝑧 ∈ ℝ)
13 lenlt 8354 . . . 4 ((𝑀 ∈ ℝ ∧ 𝑧 ∈ ℝ) → (𝑀𝑧 ↔ ¬ 𝑧 < 𝑀))
1410, 12, 13syl2an 289 . . 3 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → (𝑀𝑧 ↔ ¬ 𝑧 < 𝑀))
159, 14mpbid 147 . 2 ((𝑁 ∈ (ℤ𝑀) ∧ 𝑧 ∈ (𝑀...𝑁)) → ¬ 𝑧 < 𝑀)
165, 6, 7, 15infminti 7320 1 (𝑁 ∈ (ℤ𝑀) → inf((𝑀...𝑁), ℤ, < ) = 𝑀)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105   = wceq 1398  wcel 2205   class class class wbr 4111  cfv 5354  (class class class)co 6052  infcinf 7276  cr 8131   < clt 8313  cle 8314  cz 9582  cuz 9859  ...cfz 10348
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8223  ax-resscn 8224  ax-pre-ltirr 8244  ax-pre-apti 8247
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-sup 7277  df-inf 7278  df-pnf 8315  df-mnf 8316  df-xr 8317  df-ltxr 8318  df-le 8319  df-neg 8452  df-z 9583  df-uz 9860  df-fz 10349
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator