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 42208

Description: Lemma 2 for dignn0flhalf 42210. (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 11258	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ)
2	1	rehalfcld 11156	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 / 2) ∈ ℝ)
3	2	flcld 12461	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℤ)
4	3	zred 11358	. . . . . 6 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℝ)
5	4	3ad2ant1 1075	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
6		2re 10967	. . . . . . . 8 ⊢ 2 ∈ ℝ
7	6	a1i 11	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ)
8		id 22	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℕ₀)
9	7, 8	reexpcld 12887	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ)
10	9	3ad2ant3 1077	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ)
11		2cnd 10970	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℂ)
12		2ne0 10990	. . . . . . 7 ⊢ 2 ≠ 0
13	12	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ≠ 0)
14		nn0z 11277	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
15	14	3ad2ant3 1077	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℤ)
16	11, 13, 15	expne0d 12876	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ≠ 0)
17	5, 10, 16	redivcld 10732	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ)
18	17	flcld 12461	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ)
19	1	3ad2ant1 1075	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝐴 ∈ ℝ)
20	6	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ)
21		simp3 1056	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℕ₀)
22		1nn0 11185	. . . . . . . 8 ⊢ 1 ∈ ℕ₀
23	22	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℕ₀)
24	21, 23	nn0addcld 11232	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℕ₀)
25	20, 24	reexpcld 12887	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ∈ ℝ)
26	15	peano2zd 11361	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℤ)
27	11, 13, 26	expne0d 12876	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ≠ 0)
28	19, 25, 27	redivcld 10732	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) ∈ ℝ)
29	28	flcld 12461	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ)
30		nn0p1nn 11209	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ)
31		dignn0flhalflem1 42207	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ (𝑁 + 1) ∈ ℕ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
32	30, 31	syl3an3 1353	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
33		1zzd 11285	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℤ)
34		flsubz 42106	. . . . . 6 ⊢ (((𝐴 / (2↑(𝑁 + 1))) ∈ ℝ ∧ 1 ∈ ℤ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
35	28, 33, 34	syl2anc 691	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
36	35	eqcomd 2616	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) = (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)))
37		nnz 11276	. . . . . . . . . . 11 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 − 1) / 2) ∈ ℤ)
38		zob 14921	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℤ → (((𝐴 + 1) / 2) ∈ ℤ ↔ ((𝐴 − 1) / 2) ∈ ℤ))
39	37, 38	syl5ibr 235	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℤ → (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 + 1) / 2) ∈ ℤ))
40	39	imp 444	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → ((𝐴 + 1) / 2) ∈ ℤ)
41		zofldiv2 42119	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 + 1) / 2) ∈ ℤ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
42	40, 41	syldan 486	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
43	42	3adant3 1074	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
44	43	oveq1d 6564	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) = (((𝐴 − 1) / 2) / (2↑𝑁)))
45	44	fveq2d 6107	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))))
46		zcn 11259	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
47		1cnd 9935	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 1 ∈ ℂ)
48	46, 47	subcld 10271	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 − 1) ∈ ℂ)
49		2rp 11713	. . . . . . . . . 10 ⊢ 2 ∈ ℝ⁺
50	49	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → 2 ∈ ℝ⁺)
51	50	rpcnne0d 11757	. . . . . . . 8 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → (2 ∈ ℂ ∧ 2 ≠ 0))
52	49	a1i 11	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ⁺)
53	52, 14	rpexpcld 12894	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ⁺)
54	53	rpcnne0d 11757	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0))
55		divdiv1 10615	. . . . . . . 8 ⊢ (((𝐴 − 1) ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
56	48, 51, 54, 55	syl3an 1360	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
57	10	recnd 9947	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
58	11, 57	mulcomd 9940	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
59	11, 21	expp1d 12871	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
60	58, 59	eqtr4d 2647	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
61	60	oveq2d 6565	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 − 1) / (2 · (2↑𝑁))) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
62	56, 61	eqtrd 2644	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
63	62	fveq2d 6107	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
64	45, 63	eqtrd 2644	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
65	32, 36, 64	3brtr4d 4615	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))
66	19	rehalfcld 11156	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / 2) ∈ ℝ)
67	66, 10, 16	redivcld 10732	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ)
68		reflcl 12459	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ∈ ℝ)
69	66, 68	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
70	49	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ⁺)
71	70, 15	rpexpcld 12894	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ⁺)
72		flle 12462	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
73	66, 72	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
74	69, 66, 71, 73	lediv1dd 11806	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁)))
75		flwordi 12475	. . . . 5 ⊢ ((((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ ∧ ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ ∧ ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
76	17, 67, 74, 75	syl3anc 1318	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
77		divdiv1 10615	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
78	46, 51, 54, 77	syl3an 1360	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
79	53	rpcnd 11750	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℂ)
80	79	3ad2ant3 1077	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
81	11, 80	mulcomd 9940	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
82	11, 13, 15	expp1zd 12879	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
83	81, 82	eqtr4d 2647	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
84	83	oveq2d 6565	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2 · (2↑𝑁))) = (𝐴 / (2↑(𝑁 + 1))))
85	78, 84	eqtrd 2644	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2↑(𝑁 + 1))))
86	85	eqcomd 2616	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) = ((𝐴 / 2) / (2↑𝑁)))
87	86	fveq2d 6107	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((𝐴 / 2) / (2↑𝑁))))
88	76, 87	breqtrrd 4611	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
89		zgtp1leeq 42105	. . . 4 ⊢ (((⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ ∧ (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ) → ((((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∧ (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1))))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1))))))
90	89	imp 444	. . 3 ⊢ ((((⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ ∧ (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ) ∧ (((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∧ (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1)))))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
91	18, 29, 65, 88, 90	syl22anc 1319	. 2 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
92	91	eqcomd 2616	1 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℕcn 10897 2c2 10947 ℕ₀cn0 11169 ℤcz 11254 ℝ⁺crp 11708 ⌊cfl 12453 ↑cexp 12722

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-sup 8231 df-inf 8232 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723

This theorem is referenced by: dignn0flhalf 42210

W3C validator