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 37462

Description: Lemma for knoppndv 37475. (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 486	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐶 ∈ ( -1(,)1))
6		knoppndvlem10.j	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ ℕ₀)
7	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
8		knoppndvlem10.m	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℤ)
9	8	peano2zd 12807	. . . . . . . 8 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
10	9	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
11		knoppndvlem10.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ)
12	11	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
13		notnot 143	. . . . . . . . 9 ⊢ (2 ∥ 𝑀 → ¬ ¬ 2 ∥ 𝑀)
14	13	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ ¬ 2 ∥ 𝑀)
15	8	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
16		oddp1even 16515	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
17	15, 16	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
18	14, 17	mtbid 327	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ¬ 2 ∥ (𝑀 + 1))
19	1, 2, 3, 5, 7, 10, 12, 18	knoppndvlem9 37461	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = ((𝐶↑𝐽) / 2))
20		knoppndvlem10.a	. . . . . . 7 ⊢ 𝐴 = ((((2 · 𝑁)↑ -𝐽) / 2) · 𝑀)
21	14	notnotrd 134	. . . . . . 7 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → 2 ∥ 𝑀)
22	1, 2, 20, 5, 7, 15, 12, 21	knoppndvlem8 37460	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = 0)
23	19, 22	oveq12d 7438	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
24	4	knoppndvlem3 37455	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1))
25	24	simpld 500	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ)
26	25	recnd 11338	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
27	26, 6	expcld 14290	. . . . . . . 8 ⊢ (𝜑 → (𝐶↑𝐽) ∈ ℂ)
28		2cnd 12422	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
29		2ne0 12450	. . . . . . . . 9 ⊢ 2 ≠ 0
30	29	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2 ≠ 0)
31	27, 28, 30	divcld 12094	. . . . . . 7 ⊢ (𝜑 → ((𝐶↑𝐽) / 2) ∈ ℂ)
32	31	subid1d 11659	. . . . . 6 ⊢ (𝜑 → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
33	32	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
34	23, 33	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = ((𝐶↑𝐽) / 2))
35	34	fveq2d 6889	. . 3 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
36	3	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = ((((2 · 𝑁)↑ -𝐽) / 2) · (𝑀 + 1)))
37	6	nn0zd 12719	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℤ)
38	11, 37, 9	knoppndvlem1 37453	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑ -𝐽) / 2) · (𝑀 + 1)) ∈ ℝ)
39	36, 38	eqeltrd 2860	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
40	1, 2, 11, 25, 39, 6	knoppcnlem3 37436	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℝ)
41	40	recnd 11338	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℂ)
42	20	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ((((2 · 𝑁)↑ -𝐽) / 2) · 𝑀))
43	11, 37, 8	knoppndvlem1 37453	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑ -𝐽) / 2) · 𝑀) ∈ ℝ)
44	42, 43	eqeltrd 2860	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
45	1, 2, 11, 25, 44, 6	knoppcnlem3 37436	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℝ)
46	45	recnd 11338	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℂ)
47	41, 46	abssubd 15624	. . . . 5 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
48	47	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))))
49	4	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐶 ∈ ( -1(,)1))
50	6	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝐽 ∈ ℕ₀)
51	8	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑀 ∈ ℤ)
52	11	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 𝑁 ∈ ℕ)
53		simpr 490	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ¬ 2 ∥ 𝑀)
54	1, 2, 20, 49, 50, 51, 52, 53	knoppndvlem9 37461	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = ((𝐶↑𝐽) / 2))
55	9	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (𝑀 + 1) ∈ ℤ)
56	51, 16	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (¬ 2 ∥ 𝑀 ↔ 2 ∥ (𝑀 + 1)))
57	53, 56	mpbid 235	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → 2 ∥ (𝑀 + 1))
58	1, 2, 3, 49, 50, 55, 52, 57	knoppndvlem8 37460	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = 0)
59	54, 58	oveq12d 7438	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
60	32	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
61	59, 60	eqtrd 2795	. . . . 5 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = ((𝐶↑𝐽) / 2))
62	61	fveq2d 6889	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
63	48, 62	eqtrd 2795	. . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
64	35, 63	pm2.61dan 825	. 2 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
65	27, 28, 30	absdivd 15626	. . 3 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = ((abs‘(𝐶↑𝐽)) / (abs‘2)))
66	26, 6	absexpd 15623	. . . 4 ⊢ (𝜑 → (abs‘(𝐶↑𝐽)) = ((abs‘𝐶)↑𝐽))
67		0le2 12446	. . . . . 6 ⊢ 0 ≤ 2
68		2re 12418	. . . . . . 7 ⊢ 2 ∈ ℝ
69	68	absidi 15546	. . . . . 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 7438	. . 3 ⊢ (𝜑 → ((abs‘(𝐶↑𝐽)) / (abs‘2)) = (((abs‘𝐶)↑𝐽) / 2))
73	65, 72	eqtrd 2795	. 2 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = (((abs‘𝐶)↑𝐽) / 2))
74	64, 73	eqtrd 2795	1 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (((abs‘𝐶)↑𝐽) / 2))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6538 (class class class)co 7420 ℝcr 11200 0cc0 11201 1c1 11202 + caddc 11204 · cmul 11206 < clt 11344 ≤ cle 11345 − cmin 11542 -cneg 11543 / cdiv 11974 ℕcn 12336 2c2 12398 ℕ₀cn0 12607 ℤcz 12694 (,)cioo 13477 ⌊cfl 13931 ↑cexp 14205 abscabs 15402 ∥ cdvds 16423

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11257 ax-resscn 11258 ax-1cn 11259 ax-icn 11260 ax-addcl 11261 ax-addrcl 11262 ax-mulcl 11263 ax-mulrcl 11264 ax-mulcom 11265 ax-addass 11266 ax-mulass 11267 ax-distr 11268 ax-i2m1 11269 ax-1ne0 11270 ax-1rid 11271 ax-rnegex 11272 ax-rrecex 11273 ax-cnre 11274 ax-pre-lttri 11275 ax-pre-lttrn 11276 ax-pre-ltadd 11277 ax-pre-mulgt0 11278 ax-pre-sup 11279

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-er 8718 df-en 8975 df-dom 8976 df-sdom 8977 df-sup 9435 df-inf 9436 df-pnf 11346 df-mnf 11347 df-xr 11348 df-ltxr 11349 df-le 11350 df-sub 11544 df-neg 11545 df-div 11975 df-nn 12337 df-2 12406 df-3 12407 df-n0 12608 df-z 12695 df-uz 12967 df-rp 13122 df-ioo 13481 df-ico 13483 df-fl 13933 df-seq 14146 df-exp 14206 df-cj 15267 df-re 15268 df-im 15269 df-sqrt 15403 df-abs 15404 df-dvds 16424

This theorem is used by: knoppndvlem15 37467

W3C validator