Metamath Proof Explorer


Theorem fseqsupubi

Description: The values of a finite real sequence are bounded by their supremum. (Contributed by NM, 20-Sep-2005)

Ref Expression
Assertion fseqsupubi ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → F ⁡ K ≤ sup ran ⁡ F ℝ <

Proof

Step Hyp Ref Expression
1 frn ⊢ F : M … N ⟶ ℝ → ran ⁡ F ⊆ ℝ
2 1 adantl ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → ran ⁡ F ⊆ ℝ
3 fdm ⊢ F : M … N ⟶ ℝ → dom ⁡ F = M … N
4 ne0i ⊢ K ∈ M … N → M … N ≠ ∅
5 dm0rn0 ⊢ dom ⁡ F = ∅ ↔ ran ⁡ F = ∅
6 eqeq1 ⊢ dom ⁡ F = M … N → dom ⁡ F = ∅ ↔ M … N = ∅
7 6 biimpd ⊢ dom ⁡ F = M … N → dom ⁡ F = ∅ → M … N = ∅
8 5 7 biimtrrid ⊢ dom ⁡ F = M … N → ran ⁡ F = ∅ → M … N = ∅
9 8 necon3d ⊢ dom ⁡ F = M … N → M … N ≠ ∅ → ran ⁡ F ≠ ∅
10 4 9 mpan9 ⊢ K ∈ M … N ∧ dom ⁡ F = M … N → ran ⁡ F ≠ ∅
11 3 10 sylan2 ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → ran ⁡ F ≠ ∅
12 fsequb2 ⊢ F : M … N ⟶ ℝ → ∃ x ∈ ℝ ∀ y ∈ ran ⁡ F y ≤ x
13 12 adantl ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → ∃ x ∈ ℝ ∀ y ∈ ran ⁡ F y ≤ x
14 ffn ⊢ F : M … N ⟶ ℝ → F Fn M … N
15 fnfvelrn ⊢ F Fn M … N ∧ K ∈ M … N → F ⁡ K ∈ ran ⁡ F
16 15 ancoms ⊢ K ∈ M … N ∧ F Fn M … N → F ⁡ K ∈ ran ⁡ F
17 14 16 sylan2 ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → F ⁡ K ∈ ran ⁡ F
18 2 11 13 17 suprubd ⊢ K ∈ M … N ∧ F : M … N ⟶ ℝ → F ⁡ K ≤ sup ran ⁡ F ℝ <