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 49546

Description: Lemma 2 for dignn0flhalf 49548. (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 12619	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ)
2	1	rehalfcld 12515	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 / 2) ∈ ℝ)
3	2	flcld 13859	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℤ)
4	3	zred 12725	. . . . . 6 ⊢ (𝐴 ∈ ℤ → (⌊‘(𝐴 / 2)) ∈ ℝ)
5	4	3ad2ant1 1151	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
6		2re 12339	. . . . . . . 8 ⊢ 2 ∈ ℝ
7	6	a1i 11	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ)
8		id 23	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℕ₀)
9	7, 8	reexpcld 14227	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ)
10	9	3ad2ant3 1153	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ)
11		2cnd 12343	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℂ)
12		2ne0 12371	. . . . . . 7 ⊢ 2 ≠ 0
13	12	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ≠ 0)
14		nn0z 12639	. . . . . . 7 ⊢ (𝑁 ∈ ℕ₀ → 𝑁 ∈ ℤ)
15	14	3ad2ant3 1153	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℤ)
16	11, 13, 15	expne0d 14216	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ≠ 0)
17	5, 10, 16	redivcld 12067	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ)
18	17	flcld 13859	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ)
19	1	3ad2ant1 1151	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝐴 ∈ ℝ)
20	6	a1i 11	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ)
21		simp3 1156	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 𝑁 ∈ ℕ₀)
22		1nn0 12544	. . . . . . . 8 ⊢ 1 ∈ ℕ₀
23	22	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℕ₀)
24	21, 23	nn0addcld 12593	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℕ₀)
25	20, 24	reexpcld 14227	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ∈ ℝ)
26	15	peano2zd 12728	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝑁 + 1) ∈ ℤ)
27	11, 13, 26	expne0d 14216	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) ≠ 0)
28	19, 25, 27	redivcld 12067	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) ∈ ℝ)
29	28	flcld 13859	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ)
30		nn0p1nn 12567	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (𝑁 + 1) ∈ ℕ)
31		dignn0flhalflem1 49545	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ (𝑁 + 1) ∈ ℕ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
32	30, 31	syl3an3 1183	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) < (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
33		1zzd 12649	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 1 ∈ ℤ)
34		flsubz 49452	. . . . . 6 ⊢ (((𝐴 / (2↑(𝑁 + 1))) ∈ ℝ ∧ 1 ∈ ℤ) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
35	28, 33, 34	syl2anc 596	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)) = ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1))
36	35	eqcomd 2766	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) = (⌊‘((𝐴 / (2↑(𝑁 + 1))) − 1)))
37		nnz 12636	. . . . . . . . . 10 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 − 1) / 2) ∈ ℤ)
38		zob 16449	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℤ → (((𝐴 + 1) / 2) ∈ ℤ ↔ ((𝐴 − 1) / 2) ∈ ℤ))
39	37, 38	imbitrrid 249	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → (((𝐴 − 1) / 2) ∈ ℕ → ((𝐴 + 1) / 2) ∈ ℤ))
40	39	imp 412	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → ((𝐴 + 1) / 2) ∈ ℤ)
41		zofldiv2 49461	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 + 1) / 2) ∈ ℤ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
42	40, 41	syldan 603	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
43	42	3adant3 1150	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) = ((𝐴 − 1) / 2))
44	43	fvoveq1d 7435	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))))
45		zcn 12620	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
46		1cnd 11226	. . . . . . . . 9 ⊢ (𝐴 ∈ ℤ → 1 ∈ ℂ)
47	45, 46	subcld 11593	. . . . . . . 8 ⊢ (𝐴 ∈ ℤ → (𝐴 − 1) ∈ ℂ)
48		2rp 13047	. . . . . . . . . 10 ⊢ 2 ∈ ℝ⁺
49	48	a1i 11	. . . . . . . . 9 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → 2 ∈ ℝ⁺)
50	49	rpcnne0d 13095	. . . . . . . 8 ⊢ (((𝐴 − 1) / 2) ∈ ℕ → (2 ∈ ℂ ∧ 2 ≠ 0))
51	48	a1i 11	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ₀ → 2 ∈ ℝ⁺)
52	51, 14	rpexpcld 14311	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℝ⁺)
53	52	rpcnne0d 13095	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0))
54		divdiv1 11950	. . . . . . . 8 ⊢ (((𝐴 − 1) ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
55	47, 50, 53, 54	syl3an 1178	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2 · (2↑𝑁))))
56	10	recnd 11261	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
57	11, 56	mulcomd 11254	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
58	11, 21	expp1d 14211	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
59	57, 58	eqtr4d 2798	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
60	59	oveq2d 7429	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 − 1) / (2 · (2↑𝑁))) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
61	55, 60	eqtrd 2795	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (((𝐴 − 1) / 2) / (2↑𝑁)) = ((𝐴 − 1) / (2↑(𝑁 + 1))))
62	61	fveq2d 6882	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(((𝐴 − 1) / 2) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
63	44, 62	eqtrd 2795	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘((𝐴 − 1) / (2↑(𝑁 + 1)))))
64	32, 36, 63	3brtr4d 5137	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))
65	19	rehalfcld 12515	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / 2) ∈ ℝ)
66	65, 10, 16	redivcld 12067	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ)
67		reflcl 13857	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ∈ ℝ)
68	65, 67	syl 18	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ∈ ℝ)
69	48	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → 2 ∈ ℝ⁺)
70	69, 15	rpexpcld 14311	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℝ⁺)
71		flle 13860	. . . . . . 7 ⊢ ((𝐴 / 2) ∈ ℝ → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
72	65, 71	syl 18	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / 2)) ≤ (𝐴 / 2))
73	68, 65, 70, 72	lediv1dd 13144	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁)))
74		flwordi 13873	. . . . 5 ⊢ ((((⌊‘(𝐴 / 2)) / (2↑𝑁)) ∈ ℝ ∧ ((𝐴 / 2) / (2↑𝑁)) ∈ ℝ ∧ ((⌊‘(𝐴 / 2)) / (2↑𝑁)) ≤ ((𝐴 / 2) / (2↑𝑁))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
75	17, 66, 73, 74	syl3anc 1398	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘((𝐴 / 2) / (2↑𝑁))))
76		divdiv1 11950	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ ((2↑𝑁) ∈ ℂ ∧ (2↑𝑁) ≠ 0)) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
77	45, 50, 53, 76	syl3an 1178	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2 · (2↑𝑁))))
78	52	rpcnd 13088	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ₀ → (2↑𝑁) ∈ ℂ)
79	78	3ad2ant3 1153	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑𝑁) ∈ ℂ)
80	11, 79	mulcomd 11254	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = ((2↑𝑁) · 2))
81	11, 13, 15	expp1zd 14219	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2))
82	80, 81	eqtr4d 2798	. . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (2 · (2↑𝑁)) = (2↑(𝑁 + 1)))
83	82	oveq2d 7429	. . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2 · (2↑𝑁))) = (𝐴 / (2↑(𝑁 + 1))))
84	77, 83	eqtrd 2795	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → ((𝐴 / 2) / (2↑𝑁)) = (𝐴 / (2↑(𝑁 + 1))))
85	84	eqcomd 2766	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (𝐴 / (2↑(𝑁 + 1))) = ((𝐴 / 2) / (2↑𝑁)))
86	85	fveq2d 6882	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((𝐴 / 2) / (2↑𝑁))))
87	75, 86	breqtrrd 5133	. . 3 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
88		zgtp1leeq 49451	. . . 4 ⊢ (((⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∈ ℤ ∧ (⌊‘(𝐴 / (2↑(𝑁 + 1)))) ∈ ℤ) → ((((⌊‘(𝐴 / (2↑(𝑁 + 1)))) − 1) < (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ∧ (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) ≤ (⌊‘(𝐴 / (2↑(𝑁 + 1))))) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1))))))
89	88	imp 412	. . 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 852	. 2 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))) = (⌊‘(𝐴 / (2↑(𝑁 + 1)))))
91	90	eqcomd 2766	1 ⊢ ((𝐴 ∈ ℤ ∧ ((𝐴 − 1) / 2) ∈ ℕ ∧ 𝑁 ∈ ℕ₀) → (⌊‘(𝐴 / (2↑(𝑁 + 1)))) = (⌊‘((⌊‘(𝐴 / 2)) / (2↑𝑁))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 ℂcc 11122 ℝcr 11123 0cc0 11124 1c1 11125 + caddc 11127 · cmul 11129 < clt 11267 ≤ cle 11268 − cmin 11465 / cdiv 11895 ℕcn 12257 2c2 12319 ℕ₀cn0 12528 ℤcz 12615 ℝ⁺crp 13042 ⌊cfl 13851 ↑cexp 14125

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202

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 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-fz 13562 df-fzo 13710 df-fl 13853 df-mod 13931 df-seq 14066 df-exp 14126

This theorem is used by: dignn0flhalf 49548

W3C validator