Theorem ivthinclemlopn 15874

Description: Lemma for ivthinc 15881. The lower cut is open. (Contributed by Jim Kingdon, 6-Feb-2024.)

Hypotheses

Ref	Expression
ivth.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
ivth.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
ivth.3	⊢ (𝜑 → 𝑈 ∈ ℝ)
ivth.4	⊢ (𝜑 → 𝐴 < 𝐵)
ivth.5	⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷)
ivth.7	⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ))
ivth.8	⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ)
ivth.9	⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
ivthinc.i	⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 < 𝑦)) → (𝐹‘𝑥) < (𝐹‘𝑦))
ivthinclem.l	⊢ 𝐿 = {𝑤 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑤) < 𝑈}
ivthinclem.r	⊢ 𝑅 = {𝑤 ∈ (𝐴[,]𝐵) ∣ 𝑈 < (𝐹‘𝑤)}
ivthinclemlopn.q	⊢ (𝜑 → 𝑄 ∈ 𝐿)

Assertion

Ref	Expression
ivthinclemlopn	⊢ (𝜑 → ∃𝑟 ∈ 𝐿 𝑄 < 𝑟)

Distinct variable groups:   𝑤,𝐴   𝑥,𝐴,𝑦   𝑤,𝐵   𝑥,𝐵,𝑦   𝑤,𝐹   𝑥,𝐹,𝑦   𝐿,𝑟   𝑄,𝑟   𝑤,𝑄   𝑥,𝑄,𝑦   𝑤,𝑈   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑤, 𝑟)   𝐴(𝑟)   𝐵(𝑟)   𝐷(𝑥, 𝑦, 𝑤, 𝑟)   𝑅(𝑥, 𝑦, 𝑤, 𝑟)   𝑈(𝑥, 𝑦, 𝑟)   𝐹(𝑟)   𝐿(𝑥, 𝑦, 𝑤)

Proof of Theorem ivthinclemlopn

Dummy variables 𝑧 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ivth.7	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐷–cn→ℂ))
2		ivth.5	. . . 4 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ 𝐷)
3		ivthinclemlopn.q	. . . . . 6 ⊢ (𝜑 → 𝑄 ∈ 𝐿)
4		fveq2 5698	. . . . . . . 8 ⊢ (𝑤 = 𝑄 → (𝐹‘𝑤) = (𝐹‘𝑄))
5	4	breq1d 4141	. . . . . . 7 ⊢ (𝑤 = 𝑄 → ((𝐹‘𝑤) < 𝑈 ↔ (𝐹‘𝑄) < 𝑈))
6		ivthinclem.l	. . . . . . 7 ⊢ 𝐿 = {𝑤 ∈ (𝐴[,]𝐵) ∣ (𝐹‘𝑤) < 𝑈}
7	5, 6	elrab2 2985	. . . . . 6 ⊢ (𝑄 ∈ 𝐿 ↔ (𝑄 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑄) < 𝑈))
8	3, 7	sylib 122	. . . . 5 ⊢ (𝜑 → (𝑄 ∈ (𝐴[,]𝐵) ∧ (𝐹‘𝑄) < 𝑈))
9	8	simpld 112	. . . 4 ⊢ (𝜑 → 𝑄 ∈ (𝐴[,]𝐵))
10	2, 9	sseldd 3249	. . 3 ⊢ (𝜑 → 𝑄 ∈ 𝐷)
11		ivth.3	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ ℝ)
12		fveq2 5698	. . . . . . 7 ⊢ (𝑥 = 𝑄 → (𝐹‘𝑥) = (𝐹‘𝑄))
13	12	eleq1d 2307	. . . . . 6 ⊢ (𝑥 = 𝑄 → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘𝑄) ∈ ℝ))
14		ivth.8	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → (𝐹‘𝑥) ∈ ℝ)
15	14	ralrimiva 2623	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) ∈ ℝ)
16	13, 15, 9	rspcdva 2934	. . . . 5 ⊢ (𝜑 → (𝐹‘𝑄) ∈ ℝ)
17	11, 16	resubcld 8716	. . . 4 ⊢ (𝜑 → (𝑈 − (𝐹‘𝑄)) ∈ ℝ)
18	8	simprd 114	. . . . 5 ⊢ (𝜑 → (𝐹‘𝑄) < 𝑈)
19	16, 11	posdifd 8868	. . . . 5 ⊢ (𝜑 → ((𝐹‘𝑄) < 𝑈 ↔ 0 < (𝑈 − (𝐹‘𝑄))))
20	18, 19	mpbid 147	. . . 4 ⊢ (𝜑 → 0 < (𝑈 − (𝐹‘𝑄)))
21	17, 20	elrpd 10112	. . 3 ⊢ (𝜑 → (𝑈 − (𝐹‘𝑄)) ∈ ℝ+)
22		cncfi 15816	. . 3 ⊢ ((𝐹 ∈ (𝐷–cn→ℂ) ∧ 𝑄 ∈ 𝐷 ∧ (𝑈 − (𝐹‘𝑄)) ∈ ℝ+) → ∃𝑑 ∈ ℝ+ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
23	1, 10, 21, 22	syl3anc 1278	. 2 ⊢ (𝜑 → ∃𝑑 ∈ ℝ+ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
24		ivth.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
25		ivth.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℝ)
26		elicc2 10358	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑄 ∈ (𝐴[,]𝐵) ↔ (𝑄 ∈ ℝ ∧ 𝐴 ≤ 𝑄 ∧ 𝑄 ≤ 𝐵)))
27	24, 25, 26	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑄 ∈ (𝐴[,]𝐵) ↔ (𝑄 ∈ ℝ ∧ 𝐴 ≤ 𝑄 ∧ 𝑄 ≤ 𝐵)))
28	9, 27	mpbid 147	. . . . . . . 8 ⊢ (𝜑 → (𝑄 ∈ ℝ ∧ 𝐴 ≤ 𝑄 ∧ 𝑄 ≤ 𝐵))
29	28	simp1d 1040	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ ℝ)
30	29	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑄 ∈ ℝ)
31		simprl 535	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑑 ∈ ℝ+)
32	31	rphalfcld 10128	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑑 / 2) ∈ ℝ+)
33	32	rpred 10115	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑑 / 2) ∈ ℝ)
34	30, 33	readdcld 8362	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) ∈ ℝ)
35	24	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝐴 ∈ ℝ)
36	28	simp2d 1041	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≤ 𝑄)
37	36	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝐴 ≤ 𝑄)
38	30, 32	ltaddrpd 10149	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑄 < (𝑄 + (𝑑 / 2)))
39	30, 34, 38	ltled 8453	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑄 ≤ (𝑄 + (𝑑 / 2)))
40	35, 30, 34, 37, 39	letrd 8458	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝐴 ≤ (𝑄 + (𝑑 / 2)))
41	25	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝐵 ∈ ℝ)
42	31	rpred 10115	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑑 ∈ ℝ)
43	30, 42	readdcld 8362	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + 𝑑) ∈ ℝ)
44		rphalflt 10102	. . . . . . . . 9 ⊢ (𝑑 ∈ ℝ+ → (𝑑 / 2) < 𝑑)
45	31, 44	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑑 / 2) < 𝑑)
46	33, 42, 30, 45	ltadd2dd 8758	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) < (𝑄 + 𝑑))
47	29	ad2antrr 492	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑄 ∈ ℝ)
48	31	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑑 ∈ ℝ+)
49	48	rpred 10115	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑑 ∈ ℝ)
50	47, 49	resubcld 8716	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝑄 − 𝑑) ∈ ℝ)
51	25	ad2antrr 492	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝐵 ∈ ℝ)
52	47, 48	ltsubrpd 10148	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝑄 − 𝑑) < 𝑄)
53	28	simp3d 1042	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑄 ≤ 𝐵)
54	53	ad2antrr 492	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑄 ≤ 𝐵)
55	50, 47, 51, 52, 54	ltletrd 8759	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝑄 − 𝑑) < 𝐵)
56		simpr 110	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝐵 < (𝑄 + 𝑑))
57	51, 47, 49	absdifltd 11968	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ((abs‘(𝐵 − 𝑄)) < 𝑑 ↔ ((𝑄 − 𝑑) < 𝐵 ∧ 𝐵 < (𝑄 + 𝑑))))
58	55, 56, 57	mpbir2and 957	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (abs‘(𝐵 − 𝑄)) < 𝑑)
59		fvoveq1 6111	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = 𝐵 → (abs‘(𝑧 − 𝑄)) = (abs‘(𝐵 − 𝑄)))
60	59	breq1d 4141	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = 𝐵 → ((abs‘(𝑧 − 𝑄)) < 𝑑 ↔ (abs‘(𝐵 − 𝑄)) < 𝑑))
61	60	imbrov2fvoveq 6113	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝐵 → (((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))) ↔ ((abs‘(𝐵 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝐵) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄)))))
62		simplrr 542	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
63	24	rexrd 8382	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
64	25	rexrd 8382	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
65		ivth.4	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐴 < 𝐵)
66	24, 25, 65	ltled 8453	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
67		ubicc2 10405	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ (𝐴[,]𝐵))
68	63, 64, 66, 67	syl3anc 1278	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐵))
69	2, 68	sseldd 3249	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐵 ∈ 𝐷)
70	69	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝐵 ∈ 𝐷)
71	61, 62, 70	rspcdva 2934	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ((abs‘(𝐵 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝐵) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
72	58, 71	mpd 13	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (abs‘((𝐹‘𝐵) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄)))
73		fveq2 5698	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
74	73	eleq1d 2307	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘𝐵) ∈ ℝ))
75	15	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ∀𝑥 ∈ (𝐴[,]𝐵)(𝐹‘𝑥) ∈ ℝ)
76	68	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝐵 ∈ (𝐴[,]𝐵))
77	74, 75, 76	rspcdva 2934	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘𝐵) ∈ ℝ)
78	77	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝐹‘𝐵) ∈ ℝ)
79	16	ad2antrr 492	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝐹‘𝑄) ∈ ℝ)
80	17	ad2antrr 492	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝑈 − (𝐹‘𝑄)) ∈ ℝ)
81	78, 79, 80	absdifltd 11968	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ((abs‘((𝐹‘𝐵) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄)) ↔ (((𝐹‘𝑄) − (𝑈 − (𝐹‘𝑄))) < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < ((𝐹‘𝑄) + (𝑈 − (𝐹‘𝑄))))))
82	72, 81	mpbid 147	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (((𝐹‘𝑄) − (𝑈 − (𝐹‘𝑄))) < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < ((𝐹‘𝑄) + (𝑈 − (𝐹‘𝑄)))))
83	82	simprd 114	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝐹‘𝐵) < ((𝐹‘𝑄) + (𝑈 − (𝐹‘𝑄))))
84	79	recnd 8361	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝐹‘𝑄) ∈ ℂ)
85	11	recnd 8361	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑈 ∈ ℂ)
86	85	ad2antrr 492	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑈 ∈ ℂ)
87	84, 86	pncan3d 8648	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ((𝐹‘𝑄) + (𝑈 − (𝐹‘𝑄))) = 𝑈)
88	83, 87	breqtrd 4157	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → (𝐹‘𝐵) < 𝑈)
89		ivth.9	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐹‘𝐴) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
90	89	simprd 114	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑈 < (𝐹‘𝐵))
91	90	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑈 < (𝐹‘𝐵))
92	88, 91	jca 306	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ((𝐹‘𝐵) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
93	11	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → 𝑈 ∈ ℝ)
94		ltnsym2 8423	. . . . . . . . . 10 ⊢ (((𝐹‘𝐵) ∈ ℝ ∧ 𝑈 ∈ ℝ) → ¬ ((𝐹‘𝐵) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
95	78, 93, 94	syl2anc 415	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) ∧ 𝐵 < (𝑄 + 𝑑)) → ¬ ((𝐹‘𝐵) < 𝑈 ∧ 𝑈 < (𝐹‘𝐵)))
96	92, 95	pm2.65da 671	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ¬ 𝐵 < (𝑄 + 𝑑))
97	43, 41, 96	nltled 8455	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + 𝑑) ≤ 𝐵)
98	34, 43, 41, 46, 97	ltletrd 8759	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) < 𝐵)
99	34, 41, 98	ltled 8453	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) ≤ 𝐵)
100		elicc2 10358	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑄 + (𝑑 / 2)) ∈ (𝐴[,]𝐵) ↔ ((𝑄 + (𝑑 / 2)) ∈ ℝ ∧ 𝐴 ≤ (𝑄 + (𝑑 / 2)) ∧ (𝑄 + (𝑑 / 2)) ≤ 𝐵)))
101	35, 41, 100	syl2anc 415	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ((𝑄 + (𝑑 / 2)) ∈ (𝐴[,]𝐵) ↔ ((𝑄 + (𝑑 / 2)) ∈ ℝ ∧ 𝐴 ≤ (𝑄 + (𝑑 / 2)) ∧ (𝑄 + (𝑑 / 2)) ≤ 𝐵)))
102	34, 40, 99, 101	mpbir3and 1211	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) ∈ (𝐴[,]𝐵))
103	16	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘𝑄) ∈ ℝ)
104		fveq2 5698	. . . . . . . . 9 ⊢ (𝑥 = (𝑄 + (𝑑 / 2)) → (𝐹‘𝑥) = (𝐹‘(𝑄 + (𝑑 / 2))))
105	104	eleq1d 2307	. . . . . . . 8 ⊢ (𝑥 = (𝑄 + (𝑑 / 2)) → ((𝐹‘𝑥) ∈ ℝ ↔ (𝐹‘(𝑄 + (𝑑 / 2))) ∈ ℝ))
106	105, 75, 102	rspcdva 2934	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘(𝑄 + (𝑑 / 2))) ∈ ℝ)
107		breq2 4135	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑄 + (𝑑 / 2)) → (𝑄 < 𝑦 ↔ 𝑄 < (𝑄 + (𝑑 / 2))))
108		fveq2 5698	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑄 + (𝑑 / 2)) → (𝐹‘𝑦) = (𝐹‘(𝑄 + (𝑑 / 2))))
109	108	breq2d 4143	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑄 + (𝑑 / 2)) → ((𝐹‘𝑄) < (𝐹‘𝑦) ↔ (𝐹‘𝑄) < (𝐹‘(𝑄 + (𝑑 / 2)))))
110	107, 109	imbi12d 234	. . . . . . . . . 10 ⊢ (𝑦 = (𝑄 + (𝑑 / 2)) → ((𝑄 < 𝑦 → (𝐹‘𝑄) < (𝐹‘𝑦)) ↔ (𝑄 < (𝑄 + (𝑑 / 2)) → (𝐹‘𝑄) < (𝐹‘(𝑄 + (𝑑 / 2))))))
111		breq1 4134	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑄 → (𝑥 < 𝑦 ↔ 𝑄 < 𝑦))
112	12	breq1d 4141	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑄 → ((𝐹‘𝑥) < (𝐹‘𝑦) ↔ (𝐹‘𝑄) < (𝐹‘𝑦)))
113	111, 112	imbi12d 234	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑄 → ((𝑥 < 𝑦 → (𝐹‘𝑥) < (𝐹‘𝑦)) ↔ (𝑄 < 𝑦 → (𝐹‘𝑄) < (𝐹‘𝑦))))
114	113	ralbidv 2550	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑄 → (∀𝑦 ∈ (𝐴[,]𝐵)(𝑥 < 𝑦 → (𝐹‘𝑥) < (𝐹‘𝑦)) ↔ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑄 < 𝑦 → (𝐹‘𝑄) < (𝐹‘𝑦))))
115		ivthinc.i	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ (𝑦 ∈ (𝐴[,]𝐵) ∧ 𝑥 < 𝑦)) → (𝐹‘𝑥) < (𝐹‘𝑦))
116	115	expr 375	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑥 < 𝑦 → (𝐹‘𝑥) < (𝐹‘𝑦)))
117	116	ralrimiva 2623	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → ∀𝑦 ∈ (𝐴[,]𝐵)(𝑥 < 𝑦 → (𝐹‘𝑥) < (𝐹‘𝑦)))
118	117	ralrimiva 2623	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(𝑥 < 𝑦 → (𝐹‘𝑥) < (𝐹‘𝑦)))
119	114, 118, 9	rspcdva 2934	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑦 ∈ (𝐴[,]𝐵)(𝑄 < 𝑦 → (𝐹‘𝑄) < (𝐹‘𝑦)))
120	119	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ∀𝑦 ∈ (𝐴[,]𝐵)(𝑄 < 𝑦 → (𝐹‘𝑄) < (𝐹‘𝑦)))
121	110, 120, 102	rspcdva 2934	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 < (𝑄 + (𝑑 / 2)) → (𝐹‘𝑄) < (𝐹‘(𝑄 + (𝑑 / 2)))))
122	38, 121	mpd 13	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘𝑄) < (𝐹‘(𝑄 + (𝑑 / 2))))
123	103, 106, 122	ltled 8453	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘𝑄) ≤ (𝐹‘(𝑄 + (𝑑 / 2))))
124	103, 106, 123	abssubge0d 11966	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄))) = ((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄)))
125	30	recnd 8361	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑄 ∈ ℂ)
126	33	recnd 8361	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑑 / 2) ∈ ℂ)
127	125, 126	pncan2d 8647	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ((𝑄 + (𝑑 / 2)) − 𝑄) = (𝑑 / 2))
128	127	fveq2d 5702	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) = (abs‘(𝑑 / 2)))
129	32	rpge0d 10119	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 0 ≤ (𝑑 / 2))
130	33, 129	absidd 11957	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘(𝑑 / 2)) = (𝑑 / 2))
131	128, 130	eqtrd 2271	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) = (𝑑 / 2))
132	131, 45	eqbrtrd 4153	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) < 𝑑)
133		fvoveq1 6111	. . . . . . . . . 10 ⊢ (𝑧 = (𝑄 + (𝑑 / 2)) → (abs‘(𝑧 − 𝑄)) = (abs‘((𝑄 + (𝑑 / 2)) − 𝑄)))
134	133	breq1d 4141	. . . . . . . . 9 ⊢ (𝑧 = (𝑄 + (𝑑 / 2)) → ((abs‘(𝑧 − 𝑄)) < 𝑑 ↔ (abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) < 𝑑))
135	134	imbrov2fvoveq 6113	. . . . . . . 8 ⊢ (𝑧 = (𝑄 + (𝑑 / 2)) → (((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))) ↔ ((abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) < 𝑑 → (abs‘((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄)))))
136		simprr 537	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
137	2	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐴[,]𝐵) ⊆ 𝐷)
138	137, 102	sseldd 3249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) ∈ 𝐷)
139	135, 136, 138	rspcdva 2934	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ((abs‘((𝑄 + (𝑑 / 2)) − 𝑄)) < 𝑑 → (abs‘((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))
140	132, 139	mpd 13	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (abs‘((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄)))
141	124, 140	eqbrtrrd 4155	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄)) < (𝑈 − (𝐹‘𝑄)))
142	11	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → 𝑈 ∈ ℝ)
143	106, 142, 103	ltsub1d 8890	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ((𝐹‘(𝑄 + (𝑑 / 2))) < 𝑈 ↔ ((𝐹‘(𝑄 + (𝑑 / 2))) − (𝐹‘𝑄)) < (𝑈 − (𝐹‘𝑄))))
144	141, 143	mpbird 167	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝐹‘(𝑄 + (𝑑 / 2))) < 𝑈)
145		fveq2 5698	. . . . . 6 ⊢ (𝑤 = (𝑄 + (𝑑 / 2)) → (𝐹‘𝑤) = (𝐹‘(𝑄 + (𝑑 / 2))))
146	145	breq1d 4141	. . . . 5 ⊢ (𝑤 = (𝑄 + (𝑑 / 2)) → ((𝐹‘𝑤) < 𝑈 ↔ (𝐹‘(𝑄 + (𝑑 / 2))) < 𝑈))
147	146, 6	elrab2 2985	. . . 4 ⊢ ((𝑄 + (𝑑 / 2)) ∈ 𝐿 ↔ ((𝑄 + (𝑑 / 2)) ∈ (𝐴[,]𝐵) ∧ (𝐹‘(𝑄 + (𝑑 / 2))) < 𝑈))
148	102, 144, 147	sylanbrc 421	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → (𝑄 + (𝑑 / 2)) ∈ 𝐿)
149		breq2 4135	. . . 4 ⊢ (𝑟 = (𝑄 + (𝑑 / 2)) → (𝑄 < 𝑟 ↔ 𝑄 < (𝑄 + (𝑑 / 2))))
150	149	rspcev 2929	. . 3 ⊢ (((𝑄 + (𝑑 / 2)) ∈ 𝐿 ∧ 𝑄 < (𝑄 + (𝑑 / 2))) → ∃𝑟 ∈ 𝐿 𝑄 < 𝑟)
151	148, 38, 150	syl2anc 415	. 2 ⊢ ((𝜑 ∧ (𝑑 ∈ ℝ+ ∧ ∀𝑧 ∈ 𝐷 ((abs‘(𝑧 − 𝑄)) < 𝑑 → (abs‘((𝐹‘𝑧) − (𝐹‘𝑄))) < (𝑈 − (𝐹‘𝑄))))) → ∃𝑟 ∈ 𝐿 𝑄 < 𝑟)
152	23, 151	rexlimddv 2673	1 ⊢ (𝜑 → ∃𝑟 ∈ 𝐿 𝑄 < 𝑟)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532   ⊆ wss 3220   class class class wbr 4131  ‘cfv 5380  (class class class)co 6088  ℂcc 8184  ℝcr 8185  0cc0 8186   + caddc 8189  ℝ^*cxr 8366   < clt 8367   ≤ cle 8368   − cmin 8505   / cdiv 9011  2c2 9365  ℝ⁺crp 10072  [,]cicc 10311  abscabs 11786  –cn→ccncf 15808

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-map 6928  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-rp 10073  df-icc 10315  df-seqfrec 10907  df-exp 10998  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788  df-cncf 15809

This theorem is used by:  ivthinclemlr  15875