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 33860

Description: Lemma for knoppndv 33873. (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 483	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐶 ∈ (-1(,)1))
6		knoppndvlem10.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ ℕ₀)
7	6	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
8		knoppndvlem10.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
9	8	peano2zd 12091	. . . . . . . 8 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
10	9	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
11		knoppndvlem10.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ)
12	11	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
13		notnot 144	. . . . . . . . 9 ⊢ (2 ∥ 𝑀 → ¬ ¬ 2 ∥ 𝑀)
14	13	adantl 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ ¬ 2 ∥ 𝑀)
15	8	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
16		oddp1even 15693	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
17	15, 16	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
18	14, 17	mtbid 326	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ 2 ∥ (𝑀 + 1))
19	1, 2, 3, 5, 7, 10, 12, 18	knoppndvlem9 33859	. . . . . 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 33858	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = 0)
23	19, 22	oveq12d 7174	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
24	4	knoppndvlem3 33853	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1))
25	24	simpld 497	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ)
26	25	recnd 10669	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
27	26, 6	expcld 13511	. . . . . . . 8 ⊢ (𝜑 → (𝐶↑𝐽) ∈ ℂ)
28		2cnd 11716	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
29		2ne0 11742	. . . . . . . . 9 ⊢ 2 ≠ 0
30	29	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2 ≠ 0)
31	27, 28, 30	divcld 11416	. . . . . . 7 ⊢ (𝜑 → ((𝐶↑𝐽) / 2) ∈ ℂ)
32	31	subid1d 10986	. . . . . 6 ⊢ (𝜑 → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
33	32	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
34	23, 33	eqtrd 2856	. . . 4 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = ((𝐶↑𝐽) / 2))
35	34	fveq2d 6674	. . 3 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
36	3	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1)))
37	6	nn0zd 12086	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℤ)
38	11, 37, 9	knoppndvlem1 33851	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · (𝑀 + 1)) ∈ ℝ)
39	36, 38	eqeltrd 2913	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
40	1, 2, 11, 25, 39, 6	knoppcnlem3 33834	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℝ)
41	40	recnd 10669	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℂ)
42	20	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀))
43	11, 37, 8	knoppndvlem1 33851	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑-𝐽) / 2) · 𝑀) ∈ ℝ)
44	42, 43	eqeltrd 2913	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
45	1, 2, 11, 25, 44, 6	knoppcnlem3 33834	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℝ)
46	45	recnd 10669	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℂ)
47	41, 46	abssubd 14813	. . . . 5 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
48	47	adantr 483	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
49	4	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐶 ∈ (-1(,)1))
50	6	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
51	8	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
52	11	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
53		simpr 487	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
54	1, 2, 20, 49, 50, 51, 52, 53	knoppndvlem9 33859	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = ((𝐶↑𝐽) / 2))
55	9	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
56	51, 16	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
57	53, 56	mpbid 234	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 2 ∥ (𝑀 + 1))
58	1, 2, 3, 49, 50, 55, 52, 57	knoppndvlem8 33858	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = 0)
59	54, 58	oveq12d 7174	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
60	32	adantr 483	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
61	59, 60	eqtrd 2856	. . . . 5 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = ((𝐶↑𝐽) / 2))
62	61	fveq2d 6674	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
63	48, 62	eqtrd 2856	. . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
64	35, 63	pm2.61dan 811	. 2 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
65	27, 28, 30	absdivd 14815	. . 3 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = ((abs‘(𝐶↑𝐽)) / (abs‘2)))
66	26, 6	absexpd 14812	. . . 4 ⊢ (𝜑 → (abs‘(𝐶↑𝐽)) = ((abs‘𝐶)↑𝐽))
67		0le2 11740	. . . . . 6 ⊢ 0 ≤ 2
68		2re 11712	. . . . . . 7 ⊢ 2 ∈ ℝ
69	68	absidi 14737	. . . . . 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 7174	. . 3 ⊢ (𝜑 → ((abs‘(𝐶↑𝐽)) / (abs‘2)) = (((abs‘𝐶)↑𝐽) / 2))
73	65, 72	eqtrd 2856	. 2 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = (((abs‘𝐶)↑𝐽) / 2))
74	64, 73	eqtrd 2856	1 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (((abs‘𝐶)↑𝐽) / 2))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 class class class wbr 5066 ↦ cmpt 5146 ‘cfv 6355 (class class class)co 7156 ℝcr 10536 0cc0 10537 1c1 10538 + caddc 10540 · cmul 10542 < clt 10675 ≤ cle 10676 − cmin 10870 -cneg 10871 / cdiv 11297 ℕcn 11638 2c2 11693 ℕ₀cn0 11898 ℤcz 11982 (,)cioo 12739 ⌊cfl 13161 ↑cexp 13430 abscabs 14593 ∥ cdvds 15607

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-inf 8907 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-ioo 12743 df-ico 12745 df-fl 13163 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-dvds 15608

This theorem is referenced by: knoppndvlem15 33865

W3C validator