Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  stoweidlem45 Structured version   Visualization version   GIF version

Theorem stoweidlem45 47389
Description: This lemma proves that, given an appropriate 𝐾 (in another theorem we prove such a 𝐾 exists), there exists a function qn as in the proof of Lemma 1 in [BrosowskiDeutsh] p. 91 ( at the top of page 91): 0 <= qn <= 1 , qn < ε on T \ U, and qn > 1 - ε on 𝑉. We use y to represent the final qn in the paper (the one with n large enough), 𝑁 to represent 𝑛 in the paper, 𝐾 to represent 𝑘, 𝐷 to represent δ, 𝐸 to represent ε, and 𝑃 to represent 𝑝. (Contributed by Glauco Siliprandi, 20-Apr-2017.)
Hypotheses
Ref Expression
stoweidlem45.1 Ⅎ𝑡𝑃
stoweidlem45.2 Ⅎ𝑡𝜑
stoweidlem45.3 𝑉 = {𝑡 ∈ 𝑇 ∣ (𝑃‘𝑡) < (𝐷 / 2)}
stoweidlem45.4 𝑄 = (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)))
stoweidlem45.5 (𝜑 → 𝑁 ∈ ℕ)
stoweidlem45.6 (𝜑 → 𝐾 ∈ ℕ)
stoweidlem45.7 (𝜑 → 𝐷 ∈ ℝ+)
stoweidlem45.8 (𝜑 → 𝐷 < 1)
stoweidlem45.9 (𝜑 → 𝑃 ∈ 𝐴)
stoweidlem45.10 (𝜑 → 𝑃:𝑇⟶ℝ)
stoweidlem45.11 (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1))
stoweidlem45.12 (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝐷 ≤ (𝑃‘𝑡))
stoweidlem45.13 ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
stoweidlem45.14 ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem45.15 ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem45.16 ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
stoweidlem45.17 (𝜑 → 𝐸 ∈ ℝ+)
stoweidlem45.18 (𝜑 → (1 − 𝐸) < (1 − (((𝐾 · 𝐷) / 2)↑𝑁)))
stoweidlem45.19 (𝜑 → (1 / ((𝐾 · 𝐷)↑𝑁)) < 𝐸)
Assertion
Ref Expression
stoweidlem45 (𝜑 → ∃𝑦 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸))
Distinct variable groups:   𝑓,𝑔,𝑡,𝐴   𝑓,𝑁,𝑔,𝑡   𝑃,𝑓,𝑔   𝑇,𝑓,𝑔,𝑡   𝜑,𝑓,𝑔   𝑥,𝑡,𝐴   𝑦,𝑡,𝐴   𝑡,𝐾   𝑥,𝑇   𝜑,𝑥   𝑦,𝐸   𝑦,𝑄   𝑦,𝑇   𝑦,𝑈   𝑦,𝑉
Allowed substitution hints:   𝜑(𝑦, 𝑡)   𝐷(𝑥, 𝑦, 𝑡, 𝑓, 𝑔)   𝑃(𝑥, 𝑦, 𝑡)   𝑄(𝑥, 𝑡, 𝑓, 𝑔)   𝑈(𝑥, 𝑡, 𝑓, 𝑔)   𝐸(𝑥, 𝑡, 𝑓, 𝑔)   𝐾(𝑥, 𝑦, 𝑓, 𝑔)   𝑁(𝑥, 𝑦)   𝑉(𝑥, 𝑡, 𝑓, 𝑔)

Proof of Theorem stoweidlem45
StepHypRef Expression
1 stoweidlem45.1 . . 3 Ⅎ𝑡𝑃
2 stoweidlem45.2 . . 3 Ⅎ𝑡𝜑
3 stoweidlem45.4 . . 3 𝑄 = (𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)))
4 eqid 2763 . . 3 (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁))) = (𝑡 ∈ 𝑇 ↦ (1 − ((𝑃‘𝑡)↑𝑁)))
5 eqid 2763 . . 3 (𝑡 ∈ 𝑇 ↦ 1) = (𝑡 ∈ 𝑇 ↦ 1)
6 eqid 2763 . . 3 (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁)) = (𝑡 ∈ 𝑇 ↦ ((𝑃‘𝑡)↑𝑁))
7 stoweidlem45.9 . . 3 (𝜑 → 𝑃 ∈ 𝐴)
8 stoweidlem45.10 . . 3 (𝜑 → 𝑃:𝑇⟶ℝ)
9 stoweidlem45.13 . . 3 ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
10 stoweidlem45.14 . . 3 ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
11 stoweidlem45.15 . . 3 ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
12 stoweidlem45.16 . . 3 ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑥) ∈ 𝐴)
13 stoweidlem45.5 . . 3 (𝜑 → 𝑁 ∈ ℕ)
14 stoweidlem45.6 . . . 4 (𝜑 → 𝐾 ∈ ℕ)
1513nnnn0d 12707 . . . 4 (𝜑 → 𝑁 ∈ ℕ0)
1614, 15nnexpcld 14430 . . 3 (𝜑 → (𝐾↑𝑁) ∈ ℕ)
171, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16stoweidlem40 47384 . 2 (𝜑 → 𝑄 ∈ 𝐴)
18 1red 11348 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 ∈ ℝ)
198ffvelcdmda 7116 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑃‘𝑡) ∈ ℝ)
2015adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑁 ∈ ℕ0)
2119, 20reexpcld 14346 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) ∈ ℝ)
2218, 21resubcld 11783 . . . . . . 7 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ)
2314nnnn0d 12707 . . . . . . . . 9 (𝜑 → 𝐾 ∈ ℕ0)
2423, 15nn0expcld 14431 . . . . . . . 8 (𝜑 → (𝐾↑𝑁) ∈ ℕ0)
2524adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐾↑𝑁) ∈ ℕ0)
26 1m1e0 12455 . . . . . . . 8 (1 − 1) = 0
27 stoweidlem45.11 . . . . . . . . . . . 12 (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1))
2827r19.21bi 3258 . . . . . . . . . . 11 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1))
2928simpld 500 . . . . . . . . . 10 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝑃‘𝑡))
3028simprd 501 . . . . . . . . . 10 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑃‘𝑡) ≤ 1)
31 exple1 14360 . . . . . . . . . 10 ((((𝑃‘𝑡) ∈ ℝ ∧ 0 ≤ (𝑃‘𝑡) ∧ (𝑃‘𝑡) ≤ 1) ∧ 𝑁 ∈ ℕ0) → ((𝑃‘𝑡)↑𝑁) ≤ 1)
3219, 29, 30, 20, 31syl31anc 1401 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑃‘𝑡)↑𝑁) ≤ 1)
3321, 18, 18, 32lesub2dd 11973 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − 1) ≤ (1 − ((𝑃‘𝑡)↑𝑁)))
3426, 33eqbrtrrid 5147 . . . . . . 7 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (1 − ((𝑃‘𝑡)↑𝑁)))
3522, 25, 34expge0d 14347 . . . . . 6 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)))
363, 8, 15, 23stoweidlem12 47356 . . . . . 6 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑄‘𝑡) = ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)))
3735, 36breqtrrd 5139 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝑄‘𝑡))
38 0red 11350 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ∈ ℝ)
3919, 20, 29expge0d 14347 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ ((𝑃‘𝑡)↑𝑁))
4038, 21, 18, 39lesub2dd 11973 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) ≤ (1 − 0))
41 1m0e1 12502 . . . . . . . 8 (1 − 0) = 1
4240, 41breqtrdi 5152 . . . . . . 7 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − ((𝑃‘𝑡)↑𝑁)) ≤ 1)
43 exple1 14360 . . . . . . 7 ((((1 − ((𝑃‘𝑡)↑𝑁)) ∈ ℝ ∧ 0 ≤ (1 − ((𝑃‘𝑡)↑𝑁)) ∧ (1 − ((𝑃‘𝑡)↑𝑁)) ≤ 1) ∧ (𝐾↑𝑁) ∈ ℕ0) → ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)) ≤ 1)
4422, 34, 42, 25, 43syl31anc 1401 . . . . . 6 ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)) ≤ 1)
4536, 44eqbrtrd 5133 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑄‘𝑡) ≤ 1)
4637, 45jca 521 . . . 4 ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1))
4746ex 418 . . 3 (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1)))
482, 47ralrimi 3264 . 2 (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1))
49 stoweidlem45.3 . . . . 5 𝑉 = {𝑡 ∈ 𝑇 ∣ (𝑃‘𝑡) < (𝐷 / 2)}
50 stoweidlem45.7 . . . . 5 (𝜑 → 𝐷 ∈ ℝ+)
51 stoweidlem45.17 . . . . 5 (𝜑 → 𝐸 ∈ ℝ+)
52 stoweidlem45.18 . . . . 5 (𝜑 → (1 − 𝐸) < (1 − (((𝐾 · 𝐷) / 2)↑𝑁)))
5349, 3, 8, 15, 23, 50, 51, 52, 27stoweidlem24 47368 . . . 4 ((𝜑 ∧ 𝑡 ∈ 𝑉) → (1 − 𝐸) < (𝑄‘𝑡))
5453ex 418 . . 3 (𝜑 → (𝑡 ∈ 𝑉 → (1 − 𝐸) < (𝑄‘𝑡)))
552, 54ralrimi 3264 . 2 (𝜑 → ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑄‘𝑡))
56 stoweidlem45.12 . . . . 5 (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)𝐷 ≤ (𝑃‘𝑡))
57 stoweidlem45.19 . . . . 5 (𝜑 → (1 / ((𝐾 · 𝐷)↑𝑁)) < 𝐸)
583, 13, 14, 50, 8, 27, 56, 51, 57stoweidlem25 47369 . . . 4 ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (𝑄‘𝑡) < 𝐸)
5958ex 418 . . 3 (𝜑 → (𝑡 ∈ (𝑇 ∖ 𝑈) → (𝑄‘𝑡) < 𝐸))
602, 59ralrimi 3264 . 2 (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑄‘𝑡) < 𝐸)
61 nfmpt1 5210 . . . . . . 7 Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ ((1 − ((𝑃‘𝑡)↑𝑁))↑(𝐾↑𝑁)))
623, 61nfcxfr 2924 . . . . . 6 Ⅎ𝑡𝑄
6362nfeq2 2943 . . . . 5 Ⅎ𝑡 𝑦 = 𝑄
64 fveq1 6915 . . . . . . 7 (𝑦 = 𝑄 → (𝑦‘𝑡) = (𝑄‘𝑡))
6564breq2d 5120 . . . . . 6 (𝑦 = 𝑄 → (0 ≤ (𝑦‘𝑡) ↔ 0 ≤ (𝑄‘𝑡)))
6664breq1d 5118 . . . . . 6 (𝑦 = 𝑄 → ((𝑦‘𝑡) ≤ 1 ↔ (𝑄‘𝑡) ≤ 1))
6765, 66anbi12d 644 . . . . 5 (𝑦 = 𝑄 → ((0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ↔ (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1)))
6863, 67ralbid 3279 . . . 4 (𝑦 = 𝑄 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1)))
6964breq2d 5120 . . . . 5 (𝑦 = 𝑄 → ((1 − 𝐸) < (𝑦‘𝑡) ↔ (1 − 𝐸) < (𝑄‘𝑡)))
7063, 69ralbid 3279 . . . 4 (𝑦 = 𝑄 → (∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡) ↔ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑄‘𝑡)))
7164breq1d 5118 . . . . 5 (𝑦 = 𝑄 → ((𝑦‘𝑡) < 𝐸 ↔ (𝑄‘𝑡) < 𝐸))
7263, 71ralbid 3279 . . . 4 (𝑦 = 𝑄 → (∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸 ↔ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑄‘𝑡) < 𝐸))
7368, 70, 723anbi123d 1465 . . 3 (𝑦 = 𝑄 → ((∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸) ↔ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑄‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑄‘𝑡) < 𝐸)))
7473rspcev 3580 . 2 ((𝑄 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑄‘𝑡) ∧ (𝑄‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑄‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑄‘𝑡) < 𝐸)) → ∃𝑦 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸))
7517, 48, 55, 60, 74syl13anc 1400 1 (𝜑 → ∃𝑦 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡) ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080  ∃wrex 3090  {crab 3416   ∖ cdif 4048   class class class wbr 5108   ↦ cmpt 5192  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  0cc0 11239  1c1 11240   + caddc 11242   · cmul 11244   < clt 11382   ≤ cle 11383   − cmin 11580   / cdiv 12013  ℕcn 12375  2c2 12437  ℕ0cn0 12646  ℝ+crp 13160  ↑cexp 14244
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-rp 13161  df-seq 14185  df-exp 14245
This theorem is used by:  stoweidlem49  47393
  Copyright terms: Public domain W3C validator