dnibndlem13 - Mathbox for Asger C. Ipsen

	Mathbox for Asger C. Ipsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dnibndlem13		Structured version Visualization version GIF version

Theorem dnibndlem13 34597

Description: Lemma for dnibnd 34598. (Contributed by Asger C. Ipsen, 4-Apr-2021.)

**Hypotheses**
Ref	Expression
dnibndlem13.1	⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
dnibndlem13.2	⊢ (𝜑 → 𝐴 ∈ ℝ)
dnibndlem13.3	⊢ (𝜑 → 𝐵 ∈ ℝ)
dnibndlem13.4	⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) ≤ (⌊‘(𝐵 + (1 / 2))))

**Assertion**
Ref	Expression
dnibndlem13	⊢ (𝜑 → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 Allowed substitution hints: 𝜑(𝑥) 𝑇(𝑥)

**Proof of Theorem dnibndlem13**
Step	Hyp	Ref	Expression
1		dnibndlem13.1	. . . 4 ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
2		dnibndlem13.2	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
3	2	ad2antrr 722	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))) → 𝐴 ∈ ℝ)
4		dnibndlem13.3	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
5	4	ad2antrr 722	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))) → 𝐵 ∈ ℝ)
6		simpr 484	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2))))
7	1, 3, 5, 6	dnibndlem12 34596	. . 3 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))) → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))
8	2	ad2antrr 722	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → 𝐴 ∈ ℝ)
9	4	ad2antrr 722	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → 𝐵 ∈ ℝ)
10		simpr 484	. . . . 5 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2))))
11	10	eqcomd 2744	. . . 4 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → (⌊‘(𝐵 + (1 / 2))) = ((⌊‘(𝐴 + (1 / 2))) + 1))
12	1, 8, 9, 11	dnibndlem9 34593	. . 3 ⊢ (((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) ∧ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))
13		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2))))
14		halfre 12117	. . . . . . . . . . . 12 ⊢ (1 / 2) ∈ ℝ
15	14	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
16	2, 15	readdcld 10935	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + (1 / 2)) ∈ ℝ)
17	16	flcld 13446	. . . . . . . . 9 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) ∈ ℤ)
18	4, 15	readdcld 10935	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 + (1 / 2)) ∈ ℝ)
19	18	flcld 13446	. . . . . . . . 9 ⊢ (𝜑 → (⌊‘(𝐵 + (1 / 2))) ∈ ℤ)
20	17, 19	jca 511	. . . . . . . 8 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) ∈ ℤ ∧ (⌊‘(𝐵 + (1 / 2))) ∈ ℤ))
21	20	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) ∈ ℤ ∧ (⌊‘(𝐵 + (1 / 2))) ∈ ℤ))
22		zltp1le 12300	. . . . . . 7 ⊢ (((⌊‘(𝐴 + (1 / 2))) ∈ ℤ ∧ (⌊‘(𝐵 + (1 / 2))) ∈ ℤ) → ((⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2))) ↔ ((⌊‘(𝐴 + (1 / 2))) + 1) ≤ (⌊‘(𝐵 + (1 / 2)))))
23	21, 22	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2))) ↔ ((⌊‘(𝐴 + (1 / 2))) + 1) ≤ (⌊‘(𝐵 + (1 / 2)))))
24	13, 23	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) + 1) ≤ (⌊‘(𝐵 + (1 / 2))))
25		reflcl 13444	. . . . . . . . 9 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ)
26	16, 25	syl 17	. . . . . . . 8 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ)
27		peano2re 11078	. . . . . . . 8 ⊢ ((⌊‘(𝐴 + (1 / 2))) ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℝ)
28	26, 27	syl 17	. . . . . . 7 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℝ)
29	28	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → ((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℝ)
30	19	zred 12355	. . . . . . 7 ⊢ (𝜑 → (⌊‘(𝐵 + (1 / 2))) ∈ ℝ)
31	30	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (⌊‘(𝐵 + (1 / 2))) ∈ ℝ)
32	29, 31	leloed 11048	. . . . 5 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (((⌊‘(𝐴 + (1 / 2))) + 1) ≤ (⌊‘(𝐵 + (1 / 2))) ↔ (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ∨ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2))))))
33	24, 32	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ∨ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))))
34	17	peano2zd 12358	. . . . . . . . . 10 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℤ)
35	34, 19	jca 511	. . . . . . . . 9 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℤ ∧ (⌊‘(𝐵 + (1 / 2))) ∈ ℤ))
36		zltp1le 12300	. . . . . . . . 9 ⊢ ((((⌊‘(𝐴 + (1 / 2))) + 1) ∈ ℤ ∧ (⌊‘(𝐵 + (1 / 2))) ∈ ℤ) → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ↔ (((⌊‘(𝐴 + (1 / 2))) + 1) + 1) ≤ (⌊‘(𝐵 + (1 / 2)))))
37	35, 36	syl 17	. . . . . . . 8 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ↔ (((⌊‘(𝐴 + (1 / 2))) + 1) + 1) ≤ (⌊‘(𝐵 + (1 / 2)))))
38	26	recnd 10934	. . . . . . . . . . 11 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) ∈ ℂ)
39		1cnd 10901	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ ℂ)
40	38, 39, 39	addassd 10928	. . . . . . . . . 10 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) + 1) = ((⌊‘(𝐴 + (1 / 2))) + (1 + 1)))
41		1p1e2 12028	. . . . . . . . . . . 12 ⊢ (1 + 1) = 2
42	41	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (1 + 1) = 2)
43	42	oveq2d 7271	. . . . . . . . . 10 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) + (1 + 1)) = ((⌊‘(𝐴 + (1 / 2))) + 2))
44	40, 43	eqtrd 2778	. . . . . . . . 9 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) + 1) = ((⌊‘(𝐴 + (1 / 2))) + 2))
45	44	breq1d 5080	. . . . . . . 8 ⊢ (𝜑 → ((((⌊‘(𝐴 + (1 / 2))) + 1) + 1) ≤ (⌊‘(𝐵 + (1 / 2))) ↔ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))))
46	37, 45	bitrd 278	. . . . . . 7 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ↔ ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))))
47	46	biimpd 228	. . . . . 6 ⊢ (𝜑 → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) → ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))))
48	47	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) → ((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2)))))
49	48	orim1d 962	. . . 4 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → ((((⌊‘(𝐴 + (1 / 2))) + 1) < (⌊‘(𝐵 + (1 / 2))) ∨ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))) → (((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2))) ∨ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2))))))
50	33, 49	mpd 15	. . 3 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (((⌊‘(𝐴 + (1 / 2))) + 2) ≤ (⌊‘(𝐵 + (1 / 2))) ∨ ((⌊‘(𝐴 + (1 / 2))) + 1) = (⌊‘(𝐵 + (1 / 2)))))
51	7, 12, 50	mpjaodan 955	. 2 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2)))) → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))
52	2	adantr 480	. . 3 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))) → 𝐴 ∈ ℝ)
53	4	adantr 480	. . 3 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))) → 𝐵 ∈ ℝ)
54		simpr 484	. . . 4 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))) → (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2))))
55	54	eqcomd 2744	. . 3 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))) → (⌊‘(𝐵 + (1 / 2))) = (⌊‘(𝐴 + (1 / 2))))
56	1, 52, 53, 55	dnibndlem2 34586	. 2 ⊢ ((𝜑 ∧ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))) → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))
57		dnibndlem13.4	. . 3 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) ≤ (⌊‘(𝐵 + (1 / 2))))
58	26, 30	leloed 11048	. . 3 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) ≤ (⌊‘(𝐵 + (1 / 2))) ↔ ((⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2))) ∨ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2))))))
59	57, 58	mpbid 231	. 2 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) < (⌊‘(𝐵 + (1 / 2))) ∨ (⌊‘(𝐴 + (1 / 2))) = (⌊‘(𝐵 + (1 / 2)))))
60	51, 56, 59	mpjaodan 955	1 ⊢ (𝜑 → (abs‘((𝑇‘𝐵) − (𝑇‘𝐴))) ≤ (abs‘(𝐵 − 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ↦ cmpt 5153 ‘cfv 6418 (class class class)co 7255 ℝcr 10801 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 − cmin 11135 / cdiv 11562 2c2 11958 ℤcz 12249 ⌊cfl 13438 abscabs 14873

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fl 13440 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875

This theorem is referenced by: dnibnd 34598

W3C validator