knoppndvlem10 - Mathbox for Asger C. Ipsen

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

Theorem knoppndvlem10 33973

Description: Lemma for knoppndv 33986. (Contributed by Asger C. Ipsen, 15-Jun-2021.) (Revised by Asger C. Ipsen, 5-Jul-2021.)

**Hypotheses**
Ref	Expression
knoppndvlem10.t	⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
knoppndvlem10.f	⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))))
knoppndvlem10.a	⊢ 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)
knoppndvlem10.b	⊢ 𝐵 = ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1))
knoppndvlem10.c	⊢ (𝜑 → 𝐶 ∈ (-1(,)1))
knoppndvlem10.j	⊢ (𝜑 → 𝐽 ∈ ℕ₀)
knoppndvlem10.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
knoppndvlem10.n	⊢ (𝜑 → 𝑁 ∈ ℕ)

**Assertion**
Ref	Expression
knoppndvlem10	⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (((abs‘𝐶)↑𝐽) / 2))

Distinct variable groups: 𝐴,𝑛,𝑦 𝑥,𝐴 𝐵,𝑛,𝑦 𝑥,𝐵 𝐶,𝑛,𝑦 𝑛,𝐽 𝑥,𝐽 𝑛,𝑀,𝑦 𝑥,𝑀 𝑛,𝑁,𝑦 𝑥,𝑁 𝑇,𝑛,𝑦 𝜑,𝑛,𝑦 Allowed substitution hints: 𝜑(𝑥) 𝐶(𝑥) 𝑇(𝑥) 𝐹(𝑥,𝑦,𝑛) 𝐽(𝑦)

**Proof of Theorem knoppndvlem10**
Step	Hyp	Ref	Expression
1		knoppndvlem10.t	. . . . . . 7 ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥)))
2		knoppndvlem10.f	. . . . . . 7 ⊢ 𝐹 = (𝑦 ∈ ℝ ↦ (𝑛 ∈ ℕ₀ ↦ ((𝐶↑𝑛) · (𝑇‘(((2 · 𝑁)↑𝑛) · 𝑦)))))
3		knoppndvlem10.b	. . . . . . 7 ⊢ 𝐵 = ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1))
4		knoppndvlem10.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ (-1(,)1))
5	4	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐶 ∈ (-1(,)1))
6		knoppndvlem10.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ ℕ₀)
7	6	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
8		knoppndvlem10.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
9	8	peano2zd 12078	. . . . . . . 8 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
10	9	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
11		knoppndvlem10.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ)
12	11	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
13		notnot 144	. . . . . . . . 9 ⊢ (2 ∥ 𝑀 → ¬ ¬ 2 ∥ 𝑀)
14	13	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ ¬ 2 ∥ 𝑀)
15	8	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
16		oddp1even 15685	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
17	15, 16	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
18	14, 17	mtbid 327	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ 2 ∥ (𝑀 + 1))
19	1, 2, 3, 5, 7, 10, 12, 18	knoppndvlem9 33972	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = ((𝐶↑𝐽) / 2))
20		knoppndvlem10.a	. . . . . . 7 ⊢ 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀)
21	14	notnotrd 135	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 2 ∥ 𝑀)
22	1, 2, 20, 5, 7, 15, 12, 21	knoppndvlem8 33971	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = 0)
23	19, 22	oveq12d 7153	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
24	4	knoppndvlem3 33966	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1))
25	24	simpld 498	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ)
26	25	recnd 10658	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
27	26, 6	expcld 13506	. . . . . . . 8 ⊢ (𝜑 → (𝐶↑𝐽) ∈ ℂ)
28		2cnd 11703	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
29		2ne0 11729	. . . . . . . . 9 ⊢ 2 ≠ 0
30	29	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2 ≠ 0)
31	27, 28, 30	divcld 11405	. . . . . . 7 ⊢ (𝜑 → ((𝐶↑𝐽) / 2) ∈ ℂ)
32	31	subid1d 10975	. . . . . 6 ⊢ (𝜑 → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
33	32	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
34	23, 33	eqtrd 2833	. . . 4 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = ((𝐶↑𝐽) / 2))
35	34	fveq2d 6649	. . 3 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
36	3	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1)))
37	6	nn0zd 12073	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℤ)
38	11, 37, 9	knoppndvlem1 33964	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1)) ∈ ℝ)
39	36, 38	eqeltrd 2890	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
40	1, 2, 11, 25, 39, 6	knoppcnlem3 33947	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℝ)
41	40	recnd 10658	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℂ)
42	20	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀))
43	11, 37, 8	knoppndvlem1 33964	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀) ∈ ℝ)
44	42, 43	eqeltrd 2890	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
45	1, 2, 11, 25, 44, 6	knoppcnlem3 33947	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℝ)
46	45	recnd 10658	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℂ)
47	41, 46	abssubd 14805	. . . . 5 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
48	47	adantr 484	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
49	4	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐶 ∈ (-1(,)1))
50	6	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
51	8	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
52	11	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
53		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
54	1, 2, 20, 49, 50, 51, 52, 53	knoppndvlem9 33972	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = ((𝐶↑𝐽) / 2))
55	9	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
56	51, 16	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
57	53, 56	mpbid 235	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 2 ∥ (𝑀 + 1))
58	1, 2, 3, 49, 50, 55, 52, 57	knoppndvlem8 33971	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = 0)
59	54, 58	oveq12d 7153	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
60	32	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
61	59, 60	eqtrd 2833	. . . . 5 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = ((𝐶↑𝐽) / 2))
62	61	fveq2d 6649	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
63	48, 62	eqtrd 2833	. . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
64	35, 63	pm2.61dan 812	. 2 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
65	27, 28, 30	absdivd 14807	. . 3 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = ((abs‘(𝐶↑𝐽)) / (abs‘2)))
66	26, 6	absexpd 14804	. . . 4 ⊢ (𝜑 → (abs‘(𝐶↑𝐽)) = ((abs‘𝐶)↑𝐽))
67		0le2 11727	. . . . . 6 ⊢ 0 ≤ 2
68		2re 11699	. . . . . . 7 ⊢ 2 ∈ ℝ
69	68	absidi 14729	. . . . . 6 ⊢ (0 ≤ 2 → (abs‘2) = 2)
70	67, 69	ax-mp 5	. . . . 5 ⊢ (abs‘2) = 2
71	70	a1i 11	. . . 4 ⊢ (𝜑 → (abs‘2) = 2)
72	66, 71	oveq12d 7153	. . 3 ⊢ (𝜑 → ((abs‘(𝐶↑𝐽)) / (abs‘2)) = (((abs‘𝐶)↑𝐽) / 2))
73	65, 72	eqtrd 2833	. 2 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = (((abs‘𝐶)↑𝐽) / 2))
74	64, 73	eqtrd 2833	1 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (((abs‘𝐶)↑𝐽) / 2))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 class class class wbr 5030 ↦ cmpt 5110 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 0cc0 10526 1c1 10527 + caddc 10529 · cmul 10531 < clt 10664 ≤ cle 10665 − cmin 10859 -cneg 10860 / cdiv 11286 ℕcn 11625 2c2 11680 ℕ₀cn0 11885 ℤcz 11969 (,)cioo 12726 ⌊cfl 13155 ↑cexp 13425 abscabs 14585 ∥ cdvds 15599

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-ioo 12730 df-ico 12732 df-fl 13157 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-dvds 15600

This theorem is referenced by: knoppndvlem15 33978

W3C validator