| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fseqsupcl | Structured version Visualization version GIF version | ||
| Description: The values of a finite real sequence have a supremum. (Contributed by NM, 20-Sep-2005.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| fseqsupcl | ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frn 6675 | . . 3 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → ran 𝐹 ⊆ ℝ) | |
| 2 | 1 | adantl 481 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ⊆ ℝ) |
| 3 | fzfi 13934 | . . . 4 ⊢ (𝑀...𝑁) ∈ Fin | |
| 4 | ffn 6668 | . . . . . 6 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → 𝐹 Fn (𝑀...𝑁)) | |
| 5 | 4 | adantl 481 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝐹 Fn (𝑀...𝑁)) |
| 6 | dffn4 6758 | . . . . 5 ⊢ (𝐹 Fn (𝑀...𝑁) ↔ 𝐹:(𝑀...𝑁)–onto→ran 𝐹) | |
| 7 | 5, 6 | sylib 218 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝐹:(𝑀...𝑁)–onto→ran 𝐹) |
| 8 | fofi 9223 | . . . 4 ⊢ (((𝑀...𝑁) ∈ Fin ∧ 𝐹:(𝑀...𝑁)–onto→ran 𝐹) → ran 𝐹 ∈ Fin) | |
| 9 | 3, 7, 8 | sylancr 588 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ∈ Fin) |
| 10 | fdm 6677 | . . . . . 6 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → dom 𝐹 = (𝑀...𝑁)) | |
| 11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → dom 𝐹 = (𝑀...𝑁)) |
| 12 | simpl 482 | . . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 13 | fzn0 13492 | . . . . . 6 ⊢ ((𝑀...𝑁) ≠ ∅ ↔ 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 14 | 12, 13 | sylibr 234 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → (𝑀...𝑁) ≠ ∅) |
| 15 | 11, 14 | eqnetrd 2999 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → dom 𝐹 ≠ ∅) |
| 16 | dm0rn0 5879 | . . . . 5 ⊢ (dom 𝐹 = ∅ ↔ ran 𝐹 = ∅) | |
| 17 | 16 | necon3bii 2984 | . . . 4 ⊢ (dom 𝐹 ≠ ∅ ↔ ran 𝐹 ≠ ∅) |
| 18 | 15, 17 | sylib 218 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ≠ ∅) |
| 19 | ltso 11226 | . . . 4 ⊢ < Or ℝ | |
| 20 | fisupcl 9383 | . . . 4 ⊢ (( < Or ℝ ∧ (ran 𝐹 ∈ Fin ∧ ran 𝐹 ≠ ∅ ∧ ran 𝐹 ⊆ ℝ)) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) | |
| 21 | 19, 20 | mpan 691 | . . 3 ⊢ ((ran 𝐹 ∈ Fin ∧ ran 𝐹 ≠ ∅ ∧ ran 𝐹 ⊆ ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) |
| 22 | 9, 18, 2, 21 | syl3anc 1374 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) |
| 23 | 2, 22 | sseldd 3922 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ⊆ wss 3889 ∅c0 4273 Or wor 5538 dom cdm 5631 ran crn 5632 Fn wfn 6493 ⟶wf 6494 –onto→wfo 6496 ‘cfv 6498 (class class class)co 7367 Fincfn 8893 supcsup 9353 ℝcr 11037 < clt 11179 ℤ≥cuz 12788 ...cfz 13461 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |