Metamath Proof Explorer


Theorem rfcnnnub

Description: Given a real continuous function F defined on a compact topological space, there is always a positive integer that is a strict upper bound of its range. (Contributed by Glauco Siliprandi, 20-Apr-2017)

Ref Expression
Hypotheses rfcnnnub.1 ⊢ Ⅎ _ t F
rfcnnnub.2 ⊢ Ⅎ t φ
rfcnnnub.3 ⊢ K = topGen ⁡ ran ⁡ .
rfcnnnub.4 ⊢ φ → J ∈ Comp
rfcnnnub.5 ⊢ T = ⋃ J
rfcnnnub.6 ⊢ φ → T ≠ ∅
rfcnnnub.7 ⊢ C = J Cn K
rfcnnnub.8 ⊢ φ → F ∈ C
Assertion rfcnnnub ⊢ φ → ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n

Proof

Step Hyp Ref Expression
1 rfcnnnub.1 ⊢ Ⅎ _ t F
2 rfcnnnub.2 ⊢ Ⅎ t φ
3 rfcnnnub.3 ⊢ K = topGen ⁡ ran ⁡ .
4 rfcnnnub.4 ⊢ φ → J ∈ Comp
5 rfcnnnub.5 ⊢ T = ⋃ J
6 rfcnnnub.6 ⊢ φ → T ≠ ∅
7 rfcnnnub.7 ⊢ C = J Cn K
8 rfcnnnub.8 ⊢ φ → F ∈ C
9 nfcv ⊢ Ⅎ _ s F
10 nfcv ⊢ Ⅎ _ s T
11 nfcv ⊢ Ⅎ _ t T
12 nfv ⊢ Ⅎ s φ
13 8 7 eleqtrdi ⊢ φ → F ∈ J Cn K
14 9 1 10 11 12 2 5 3 4 13 6 evthf ⊢ φ → ∃ s ∈ T ∀ t ∈ T F ⁡ t ≤ F ⁡ s
15 df-rex ⊢ ∃ s ∈ T ∀ t ∈ T F ⁡ t ≤ F ⁡ s ↔ ∃ s s ∈ T ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s
16 14 15 sylib ⊢ φ → ∃ s s ∈ T ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s
17 3 5 7 8 fcnre ⊢ φ → F : T ⟶ ℝ
18 17 ffvelcdmda ⊢ φ ∧ s ∈ T → F ⁡ s ∈ ℝ
19 18 ex ⊢ φ → s ∈ T → F ⁡ s ∈ ℝ
20 19 anim1d ⊢ φ → s ∈ T ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s → F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s
21 20 eximdv ⊢ φ → ∃ s s ∈ T ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s → ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s
22 16 21 mpd ⊢ φ → ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s
23 17 ffvelcdmda ⊢ φ ∧ t ∈ T → F ⁡ t ∈ ℝ
24 23 ex ⊢ φ → t ∈ T → F ⁡ t ∈ ℝ
25 2 24 ralrimi ⊢ φ → ∀ t ∈ T F ⁡ t ∈ ℝ
26 19.41v ⊢ ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ↔ ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
27 22 25 26 sylanbrc ⊢ φ → ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
28 df-3an ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ↔ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
29 28 exbii ⊢ ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ↔ ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
30 27 29 sylibr ⊢ φ → ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
31 nfcv ⊢ Ⅎ _ t s
32 1 31 nffv ⊢ Ⅎ _ t F ⁡ s
33 32 nfel1 ⊢ Ⅎ t F ⁡ s ∈ ℝ
34 nfra1 ⊢ Ⅎ t ∀ t ∈ T F ⁡ t ≤ F ⁡ s
35 nfra1 ⊢ Ⅎ t ∀ t ∈ T F ⁡ t ∈ ℝ
36 33 34 35 nf3an ⊢ Ⅎ t F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ
37 nfv ⊢ Ⅎ t n ∈ ℕ
38 nfcv ⊢ Ⅎ _ t <
39 nfcv ⊢ Ⅎ _ t n
40 32 38 39 nfbr ⊢ Ⅎ t F ⁡ s < n
41 37 40 nfan ⊢ Ⅎ t n ∈ ℕ ∧ F ⁡ s < n
42 36 41 nfan ⊢ Ⅎ t F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n
43 simpll3 ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → ∀ t ∈ T F ⁡ t ∈ ℝ
44 simpr ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → t ∈ T
45 rsp ⊢ ∀ t ∈ T F ⁡ t ∈ ℝ → t ∈ T → F ⁡ t ∈ ℝ
46 43 44 45 sylc ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → F ⁡ t ∈ ℝ
47 simpll1 ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → F ⁡ s ∈ ℝ
48 simplrl ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → n ∈ ℕ
49 48 nnred ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → n ∈ ℝ
50 simpl2 ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n → ∀ t ∈ T F ⁡ t ≤ F ⁡ s
51 50 r19.21bi ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → F ⁡ t ≤ F ⁡ s
52 simplrr ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → F ⁡ s < n
53 46 47 49 51 52 lelttrd ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n ∧ t ∈ T → F ⁡ t < n
54 53 ex ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n → t ∈ T → F ⁡ t < n
55 42 54 ralrimi ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ ∧ n ∈ ℕ ∧ F ⁡ s < n → ∀ t ∈ T F ⁡ t < n
56 arch ⊢ F ⁡ s ∈ ℝ → ∃ n ∈ ℕ F ⁡ s < n
57 56 3ad2ant1 ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ → ∃ n ∈ ℕ F ⁡ s < n
58 55 57 reximddv ⊢ F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ → ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n
59 58 eximi ⊢ ∃ s F ⁡ s ∈ ℝ ∧ ∀ t ∈ T F ⁡ t ≤ F ⁡ s ∧ ∀ t ∈ T F ⁡ t ∈ ℝ → ∃ s ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n
60 30 59 syl ⊢ φ → ∃ s ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n
61 19.9v ⊢ ∃ s ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n ↔ ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n
62 60 61 sylib ⊢ φ → ∃ n ∈ ℕ ∀ t ∈ T F ⁡ t < n