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 37602

Description: Lemma for knoppndv 37615. (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 12846	. . . . . . . 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 16558	. . . . . . . . 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 37601	. . . . . 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 37600	. . . . . 6 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → ((𝐹‘𝐴)‘𝐽) = 0)
23	19, 22	oveq12d 7469	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
24	4	knoppndvlem3 37595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ (abs‘𝐶) < 1))
25	24	simpld 500	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ)
26	25	recnd 11376	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ)
27	26, 6	expcld 14329	. . . . . . . 8 ⊢ (𝜑 → (𝐶↑𝐽) ∈ ℂ)
28		2cnd 12461	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
29		2ne0 12489	. . . . . . . . 9 ⊢ 2 ≠ 0
30	29	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2 ≠ 0)
31	27, 28, 30	divcld 12133	. . . . . . 7 ⊢ (𝜑 → ((𝐶↑𝐽) / 2) ∈ ℂ)
32	31	subid1d 11697	. . . . . 6 ⊢ (𝜑 → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
33	32	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
34	23, 33	eqtrd 2798	. . . 4 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽)) = ((𝐶↑𝐽) / 2))
35	34	fveq2d 6920	. . 3 ⊢ ((𝜑 ∧ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
36	3	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = ((((2 · 𝑁)↑ -𝐽) / 2) · (𝑀 + 1)))
37	6	nn0zd 12758	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℤ)
38	11, 37, 9	knoppndvlem1 37593	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑ -𝐽) / 2) · (𝑀 + 1)) ∈ ℝ)
39	36, 38	eqeltrd 2864	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ)
40	1, 2, 11, 25, 39, 6	knoppcnlem3 37576	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℝ)
41	40	recnd 11376	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐵)‘𝐽) ∈ ℂ)
42	20	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = ((((2 · 𝑁)↑ -𝐽) / 2) · 𝑀))
43	11, 37, 8	knoppndvlem1 37593	. . . . . . . . 9 ⊢ (𝜑 → ((((2 · 𝑁)↑ -𝐽) / 2) · 𝑀) ∈ ℝ)
44	42, 43	eqeltrd 2864	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ)
45	1, 2, 11, 25, 44, 6	knoppcnlem3 37576	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℝ)
46	45	recnd 11376	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝐴)‘𝐽) ∈ ℂ)
47	41, 46	abssubd 15667	. . . . 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 37601	. . . . . . 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 37600	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → ((𝐹‘𝐵)‘𝐽) = 0)
59	54, 58	oveq12d 7469	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = (((𝐶↑𝐽) / 2) − 0))
60	32	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐶↑𝐽) / 2) − 0) = ((𝐶↑𝐽) / 2))
61	59, 60	eqtrd 2798	. . . . 5 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽)) = ((𝐶↑𝐽) / 2))
62	61	fveq2d 6920	. . . 4 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐴)‘𝐽) − ((𝐹‘𝐵)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
63	48, 62	eqtrd 2798	. . 3 ⊢ ((𝜑 ∧ ¬ 2 ∥ 𝑀) → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
64	35, 63	pm2.61dan 825	. 2 ⊢ (𝜑 → (abs‘(((𝐹‘𝐵)‘𝐽) − ((𝐹‘𝐴)‘𝐽))) = (abs‘((𝐶↑𝐽) / 2)))
65	27, 28, 30	absdivd 15669	. . 3 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = ((abs‘(𝐶↑𝐽)) / (abs‘2)))
66	26, 6	absexpd 15666	. . . 4 ⊢ (𝜑 → (abs‘(𝐶↑𝐽)) = ((abs‘𝐶)↑𝐽))
67		0le2 12485	. . . . . 6 ⊢ 0 ≤ 2
68		2re 12457	. . . . . . 7 ⊢ 2 ∈ ℝ
69	68	absidi 15589	. . . . . 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 7469	. . 3 ⊢ (𝜑 → ((abs‘(𝐶↑𝐽)) / (abs‘2)) = (((abs‘𝐶)↑𝐽) / 2))
73	65, 72	eqtrd 2798	. 2 ⊢ (𝜑 → (abs‘((𝐶↑𝐽) / 2)) = (((abs‘𝐶)↑𝐽) / 2))
74	64, 73	eqtrd 2798	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 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 · cmul 11244 < clt 11382 ≤ cle 11383 − cmin 11580 -cneg 11581 / cdiv 12013 ℕcn 12375 2c2 12437 ℕ₀cn0 12646 ℤcz 12733 (,)cioo 13516 ⌊cfl 13970 ↑cexp 14244 abscabs 15444 ∥ cdvds 16466

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-ioo 13520 df-ico 13522 df-fl 13972 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-dvds 16467

This theorem is used by: knoppndvlem15 37607

W3C validator