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 6522 | . . 3 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → ran 𝐹 ⊆ ℝ) | |
2 | 1 | adantl 484 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ⊆ ℝ) |
3 | fzfi 13343 | . . . 4 ⊢ (𝑀...𝑁) ∈ Fin | |
4 | ffn 6516 | . . . . . 6 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → 𝐹 Fn (𝑀...𝑁)) | |
5 | 4 | adantl 484 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝐹 Fn (𝑀...𝑁)) |
6 | dffn4 6598 | . . . . 5 ⊢ (𝐹 Fn (𝑀...𝑁) ↔ 𝐹:(𝑀...𝑁)–onto→ran 𝐹) | |
7 | 5, 6 | sylib 220 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝐹:(𝑀...𝑁)–onto→ran 𝐹) |
8 | fofi 8812 | . . . 4 ⊢ (((𝑀...𝑁) ∈ Fin ∧ 𝐹:(𝑀...𝑁)–onto→ran 𝐹) → ran 𝐹 ∈ Fin) | |
9 | 3, 7, 8 | sylancr 589 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ∈ Fin) |
10 | fdm 6524 | . . . . . 6 ⊢ (𝐹:(𝑀...𝑁)⟶ℝ → dom 𝐹 = (𝑀...𝑁)) | |
11 | 10 | adantl 484 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → dom 𝐹 = (𝑀...𝑁)) |
12 | simpl 485 | . . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → 𝑁 ∈ (ℤ≥‘𝑀)) | |
13 | fzn0 12924 | . . . . . 6 ⊢ ((𝑀...𝑁) ≠ ∅ ↔ 𝑁 ∈ (ℤ≥‘𝑀)) | |
14 | 12, 13 | sylibr 236 | . . . . 5 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → (𝑀...𝑁) ≠ ∅) |
15 | 11, 14 | eqnetrd 3085 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → dom 𝐹 ≠ ∅) |
16 | dm0rn0 5797 | . . . . 5 ⊢ (dom 𝐹 = ∅ ↔ ran 𝐹 = ∅) | |
17 | 16 | necon3bii 3070 | . . . 4 ⊢ (dom 𝐹 ≠ ∅ ↔ ran 𝐹 ≠ ∅) |
18 | 15, 17 | sylib 220 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → ran 𝐹 ≠ ∅) |
19 | ltso 10723 | . . . 4 ⊢ < Or ℝ | |
20 | fisupcl 8935 | . . . 4 ⊢ (( < Or ℝ ∧ (ran 𝐹 ∈ Fin ∧ ran 𝐹 ≠ ∅ ∧ ran 𝐹 ⊆ ℝ)) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) | |
21 | 19, 20 | mpan 688 | . . 3 ⊢ ((ran 𝐹 ∈ Fin ∧ ran 𝐹 ≠ ∅ ∧ ran 𝐹 ⊆ ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) |
22 | 9, 18, 2, 21 | syl3anc 1367 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹) |
23 | 2, 22 | sseldd 3970 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ 𝐹:(𝑀...𝑁)⟶ℝ) → sup(ran 𝐹, ℝ, < ) ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ⊆ wss 3938 ∅c0 4293 Or wor 5475 dom cdm 5557 ran crn 5558 Fn wfn 6352 ⟶wf 6353 –onto→wfo 6355 ‘cfv 6357 (class class class)co 7158 Fincfn 8511 supcsup 8906 ℝcr 10538 < clt 10677 ℤ≥cuz 12246 ...cfz 12895 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |