Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > inffzOLD | Structured version Visualization version GIF version |
Description: The infimum of a finite sequence of integers. (Contributed by Scott Fenton, 8-Aug-2013.) Obsolete version of inffz 30867 as of 10-Oct-2021. (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
inffzOLD | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → sup((𝑀...𝑁), ℤ, ◡ < ) = 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zssre 11261 | . . . . 5 ⊢ ℤ ⊆ ℝ | |
2 | ltso 9997 | . . . . 5 ⊢ < Or ℝ | |
3 | soss 4977 | . . . . 5 ⊢ (ℤ ⊆ ℝ → ( < Or ℝ → < Or ℤ)) | |
4 | 1, 2, 3 | mp2 9 | . . . 4 ⊢ < Or ℤ |
5 | cnvso 5591 | . . . 4 ⊢ ( < Or ℤ ↔ ◡ < Or ℤ) | |
6 | 4, 5 | mpbi 219 | . . 3 ⊢ ◡ < Or ℤ |
7 | 6 | a1i 11 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ◡ < Or ℤ) |
8 | eluzel2 11568 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
9 | eluzfz1 12219 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁)) | |
10 | elfzle1 12215 | . . . . 5 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑀 ≤ 𝑥) | |
11 | 10 | adantl 481 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝑥) |
12 | 8 | zred 11358 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℝ) |
13 | elfzelz 12213 | . . . . . 6 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℤ) | |
14 | 13 | zred 11358 | . . . . 5 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℝ) |
15 | lenlt 9995 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑀 ≤ 𝑥 ↔ ¬ 𝑥 < 𝑀)) | |
16 | 12, 14, 15 | syl2an 493 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑀 ≤ 𝑥 ↔ ¬ 𝑥 < 𝑀)) |
17 | 11, 16 | mpbid 221 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑥 ∈ (𝑀...𝑁)) → ¬ 𝑥 < 𝑀) |
18 | brcnvg 5225 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑀◡ < 𝑥 ↔ 𝑥 < 𝑀)) | |
19 | 18 | notbid 307 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑥 ∈ (𝑀...𝑁)) → (¬ 𝑀◡ < 𝑥 ↔ ¬ 𝑥 < 𝑀)) |
20 | 8, 19 | sylan 487 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑥 ∈ (𝑀...𝑁)) → (¬ 𝑀◡ < 𝑥 ↔ ¬ 𝑥 < 𝑀)) |
21 | 17, 20 | mpbird 246 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝑥 ∈ (𝑀...𝑁)) → ¬ 𝑀◡ < 𝑥) |
22 | 7, 8, 9, 21 | supmax 8256 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → sup((𝑀...𝑁), ℤ, ◡ < ) = 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ⊆ wss 3540 class class class wbr 4583 Or wor 4958 ◡ccnv 5037 ‘cfv 5804 (class class class)co 6549 supcsup 8229 ℝcr 9814 < clt 9953 ≤ cle 9954 ℤcz 11254 ℤ≥cuz 11563 ...cfz 12197 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-pre-lttri 9889 ax-pre-lttrn 9890 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-neg 10148 df-z 11255 df-uz 11564 df-fz 12198 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |