dignn0flhalflem2 - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dignn0flhalflem2		Structured version Visualization version GIF version

Theorem dignn0flhalflem2 48609

Description: Lemma 2 for dignn0flhalf 48611. (Contributed by AV, 7-Jun-2012.)

**Assertion**
Ref	Expression
dignn0flhalflem2	⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))

**Proof of Theorem dignn0flhalflem2**
Step	Hyp	Ref	Expression
1		zre 12540	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ)
2	1	rehalfcld 12436	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 / 2) ∈ ℝ)
3	2	flcld 13767	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℤ)
4	3	zred 12645	. . . . . 6 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℝ)
5	4	3ad2ant1 1133	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
6		2re 12267	. . . . . . . 8 ⊢ 2 ∈ ℝ
7	6	a1i 11	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ)
8		id 22	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℕ₀)
9	7, 8	reexpcld 14135	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ)
10	9	3ad2ant3 1135	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ)
11		2cnd 12271	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℂ)
12		2ne0 12297	. . . . . . 7 ⊢ 2 ≠ 0
13	12	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ≠ 0)
14		nn0z 12561	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
15	14	3ad2ant3 1135	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℤ)
16	11, 13, 15	expne0d 14124	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ≠ 0)
17	5, 10, 16	redivcld 12017	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ)
18	17	flcld 13767	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ)
19	1	3ad2ant1 1133	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝐴 ∈ ℝ)
20	6	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ)
21		simp3 1138	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℕ₀)
22		1nn0 12465	. . . . . . . 8 ⊢ 1 ∈ ℕ₀
23	22	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℕ₀)
24	21, 23	nn0addcld 12514	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℕ₀)
25	20, 24	reexpcld 14135	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ∈ ℝ)
26	15	peano2zd 12648	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℤ)
27	11, 13, 26	expne0d 14124	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ≠ 0)
28	19, 25, 27	redivcld 12017	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) ∈ ℝ)
29	28	flcld 13767	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ)
30		nn0p1nn 12488	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ)
31		dignn0flhalflem1 48608	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ (𝑁 + 1) ∈ ℕ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
32	30, 31	syl3an3 1165	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
33		1zzd 12571	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℤ)
34		flsubz 48515	. . . . . 6 ⊢ (((𝐴 / (2↑(𝑁 + 1))) ∈ ℝ ∧ 1 ∈ ℤ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
35	28, 33, 34	syl2anc 584	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
36	35	eqcomd 2736	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) = (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)))
37		nnz 12557	. . . . . . . . . 10 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 − 1) / 2) ∈ ℤ)
38		zob 16336	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℤ → (((𝐴 + 1) / 2) ∈ ℤ ↔ ((𝐴 − 1) / 2) ∈ ℤ))
39	37, 38	imbitrrid 246	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 + 1) / 2) ∈ ℤ))
40	39	imp 406	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → ((𝐴 + 1) / 2) ∈ ℤ)
41		zofldiv2 48524	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 + 1) / 2) ∈ ℤ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
42	40, 41	syldan 591	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
43	42	3adant3 1132	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
44	43	fvoveq1d 7412	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))))
45		zcn 12541	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
46		1cnd 11176	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 1 ∈ ℂ)
47	45, 46	subcld 11540	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 − 1) ∈ ℂ)
48		2rp 12963	. . . . . . . . . 10 ⊢ 2 ∈ ℝ⁺
49	48	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → 2 ∈ ℝ⁺)
50	49	rpcnne0d 13011	. . . . . . . 8 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → (2 ∈ ℂ ∧ 2 ≠ 0))
51	48	a1i 11	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ⁺)
52	51, 14	rpexpcld 14219	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ⁺)
53	52	rpcnne0d 13011	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0))
54		divdiv1 11900	. . . . . . . 8 ⊢ (((𝐴 − 1) ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
55	47, 50, 53, 54	syl3an 1160	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
56	10	recnd 11209	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
57	11, 56	mulcomd 11202	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
58	11, 21	expp1d 14119	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
59	57, 58	eqtr4d 2768	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
60	59	oveq2d 7406	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 − 1) / (2 · (2↑𝑁))) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
61	55, 60	eqtrd 2765	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
62	61	fveq2d 6865	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
63	44, 62	eqtrd 2765	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
64	32, 36, 63	3brtr4d 5142	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))
65	19	rehalfcld 12436	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / 2) ∈ ℝ)
66	65, 10, 16	redivcld 12017	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ)
67		reflcl 13765	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ∈ ℝ)
68	65, 67	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
69	48	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ⁺)
70	69, 15	rpexpcld 14219	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ⁺)
71		flle 13768	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
72	65, 71	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
73	68, 65, 70, 72	lediv1dd 13060	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁)))
74		flwordi 13781	. . . . 5 ⊢ ((((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ ∧ ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ ∧ ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
75	17, 66, 73, 74	syl3anc 1373	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
76		divdiv1 11900	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
77	45, 50, 53, 76	syl3an 1160	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
78	52	rpcnd 13004	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℂ)
79	78	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
80	11, 79	mulcomd 11202	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
81	11, 13, 15	expp1zd 14127	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
82	80, 81	eqtr4d 2768	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
83	82	oveq2d 7406	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2 · (2↑𝑁))) = (𝐴 / (2↑(𝑁 + 1))))
84	77, 83	eqtrd 2765	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2↑(𝑁 + 1))))
85	84	eqcomd 2736	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) = ((𝐴 / 2) / (2↑𝑁)))
86	85	fveq2d 6865	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((𝐴 / 2) / (2↑𝑁))))
87	75, 86	breqtrrd 5138	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
88		zgtp1leeq 48514	. . . 4 ⊢ (((⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ ∧ (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ) → ((((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∧ (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1))))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1))))))
89	88	imp 406	. . 3 ⊢ ((((⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ ∧ (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ) ∧ (((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∧ (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1)))))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
90	18, 29, 64, 87, 89	syl22anc 838	. 2 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
91	90	eqcomd 2736	1 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 class class class wbr 5110 ‘cfv 6514 (class class class)co 7390 ℂcc 11073 ℝcr 11074 0cc0 11075 1c1 11076 + caddc 11078 · cmul 11080 < clt 11215 ≤ cle 11216 − cmin 11412 / cdiv 11842 ℕcn 12193 2c2 12248 ℕ₀cn0 12449 ℤcz 12536 ℝ⁺crp 12958 ⌊cfl 13759 ↑cexp 14033

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9400 df-inf 9401 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-n0 12450 df-z 12537 df-uz 12801 df-rp 12959 df-fz 13476 df-fzo 13623 df-fl 13761 df-mod 13839 df-seq 13974 df-exp 14034

This theorem is referenced by: dignn0flhalf 48611

W3C validator