climcndslem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > climcndslem2		Structured version Visualization version GIF version

Theorem climcndslem2 15823

Description: Lemma for climcnds 15824: bound the condensed series by the original series. (Contributed by Mario Carneiro, 18-Jul-2014.) (Proof shortened by AV, 10-Jul-2022.)

**Hypotheses**
Ref	Expression
climcnds.1	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℝ)
climcnds.2	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐹‘𝑘))
climcnds.3	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
climcnds.4	⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))))

**Assertion**
Ref	Expression
climcndslem2	⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → (seq1( + , 𝐺)‘𝑁) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑁))))

Distinct variable groups: 𝑘,𝑛,𝐹 𝑘,𝐺,𝑛 𝜑,𝑘,𝑛 Allowed substitution hints: 𝑁(𝑘,𝑛)

Proof of Theorem climcndslem2 Dummy variables 𝑗 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6861	. . . . 5 ⊢ (𝑥 = 1 → (seq1( + , 𝐺)‘𝑥) = (seq1( + , 𝐺)‘1))
2		oveq2 7398	. . . . . . . 8 ⊢ (𝑥 = 1 → (2↑𝑥) = (2↑1))
3		2cn 12268	. . . . . . . . 9 ⊢ 2 ∈ ℂ
4		exp1 14039	. . . . . . . . 9 ⊢ (2 ∈ ℂ → (2↑1) = 2)
5	3, 4	ax-mp 5	. . . . . . . 8 ⊢ (2↑1) = 2
6	2, 5	eqtrdi 2781	. . . . . . 7 ⊢ (𝑥 = 1 → (2↑𝑥) = 2)
7	6	fveq2d 6865	. . . . . 6 ⊢ (𝑥 = 1 → (seq1( + , 𝐹)‘(2↑𝑥)) = (seq1( + , 𝐹)‘2))
8	7	oveq2d 7406	. . . . 5 ⊢ (𝑥 = 1 → (2 · (seq1( + , 𝐹)‘(2↑𝑥))) = (2 · (seq1( + , 𝐹)‘2)))
9	1, 8	breq12d 5123	. . . 4 ⊢ (𝑥 = 1 → ((seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥))) ↔ (seq1( + , 𝐺)‘1) ≤ (2 · (seq1( + , 𝐹)‘2))))
10	9	imbi2d 340	. . 3 ⊢ (𝑥 = 1 → ((𝜑 → (seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥)))) ↔ (𝜑 → (seq1( + , 𝐺)‘1) ≤ (2 · (seq1( + , 𝐹)‘2)))))
11		fveq2 6861	. . . . 5 ⊢ (𝑥 = 𝑗 → (seq1( + , 𝐺)‘𝑥) = (seq1( + , 𝐺)‘𝑗))
12		oveq2 7398	. . . . . . 7 ⊢ (𝑥 = 𝑗 → (2↑𝑥) = (2↑𝑗))
13	12	fveq2d 6865	. . . . . 6 ⊢ (𝑥 = 𝑗 → (seq1( + , 𝐹)‘(2↑𝑥)) = (seq1( + , 𝐹)‘(2↑𝑗)))
14	13	oveq2d 7406	. . . . 5 ⊢ (𝑥 = 𝑗 → (2 · (seq1( + , 𝐹)‘(2↑𝑥))) = (2 · (seq1( + , 𝐹)‘(2↑𝑗))))
15	11, 14	breq12d 5123	. . . 4 ⊢ (𝑥 = 𝑗 → ((seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥))) ↔ (seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗)))))
16	15	imbi2d 340	. . 3 ⊢ (𝑥 = 𝑗 → ((𝜑 → (seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥)))) ↔ (𝜑 → (seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))))))
17		fveq2 6861	. . . . 5 ⊢ (𝑥 = (𝑗 + 1) → (seq1( + , 𝐺)‘𝑥) = (seq1( + , 𝐺)‘(𝑗 + 1)))
18		oveq2 7398	. . . . . . 7 ⊢ (𝑥 = (𝑗 + 1) → (2↑𝑥) = (2↑(𝑗 + 1)))
19	18	fveq2d 6865	. . . . . 6 ⊢ (𝑥 = (𝑗 + 1) → (seq1( + , 𝐹)‘(2↑𝑥)) = (seq1( + , 𝐹)‘(2↑(𝑗 + 1))))
20	19	oveq2d 7406	. . . . 5 ⊢ (𝑥 = (𝑗 + 1) → (2 · (seq1( + , 𝐹)‘(2↑𝑥))) = (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))))
21	17, 20	breq12d 5123	. . . 4 ⊢ (𝑥 = (𝑗 + 1) → ((seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥))) ↔ (seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1))))))
22	21	imbi2d 340	. . 3 ⊢ (𝑥 = (𝑗 + 1) → ((𝜑 → (seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥)))) ↔ (𝜑 → (seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))))))
23		fveq2 6861	. . . . 5 ⊢ (𝑥 = 𝑁 → (seq1( + , 𝐺)‘𝑥) = (seq1( + , 𝐺)‘𝑁))
24		oveq2 7398	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (2↑𝑥) = (2↑𝑁))
25	24	fveq2d 6865	. . . . . 6 ⊢ (𝑥 = 𝑁 → (seq1( + , 𝐹)‘(2↑𝑥)) = (seq1( + , 𝐹)‘(2↑𝑁)))
26	25	oveq2d 7406	. . . . 5 ⊢ (𝑥 = 𝑁 → (2 · (seq1( + , 𝐹)‘(2↑𝑥))) = (2 · (seq1( + , 𝐹)‘(2↑𝑁))))
27	23, 26	breq12d 5123	. . . 4 ⊢ (𝑥 = 𝑁 → ((seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥))) ↔ (seq1( + , 𝐺)‘𝑁) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑁)))))
28	27	imbi2d 340	. . 3 ⊢ (𝑥 = 𝑁 → ((𝜑 → (seq1( + , 𝐺)‘𝑥) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑥)))) ↔ (𝜑 → (seq1( + , 𝐺)‘𝑁) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑁))))))
29		fveq2 6861	. . . . . . . 8 ⊢ (𝑘 = 1 → (𝐹‘𝑘) = (𝐹‘1))
30	29	breq2d 5122	. . . . . . 7 ⊢ (𝑘 = 1 → (0 ≤ (𝐹‘𝑘) ↔ 0 ≤ (𝐹‘1)))
31		climcnds.2	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐹‘𝑘))
32	31	ralrimiva 3126	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ ℕ 0 ≤ (𝐹‘𝑘))
33		1nn 12204	. . . . . . . 8 ⊢ 1 ∈ ℕ
34	33	a1i 11	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℕ)
35	30, 32, 34	rspcdva 3592	. . . . . 6 ⊢ (𝜑 → 0 ≤ (𝐹‘1))
36		fveq2 6861	. . . . . . . . 9 ⊢ (𝑘 = 2 → (𝐹‘𝑘) = (𝐹‘2))
37	36	eleq1d 2814	. . . . . . . 8 ⊢ (𝑘 = 2 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘2) ∈ ℝ))
38		climcnds.1	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℝ)
39	38	ralrimiva 3126	. . . . . . . 8 ⊢ (𝜑 → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℝ)
40		2nn 12266	. . . . . . . . 9 ⊢ 2 ∈ ℕ
41	40	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℕ)
42	37, 39, 41	rspcdva 3592	. . . . . . 7 ⊢ (𝜑 → (𝐹‘2) ∈ ℝ)
43	29	eleq1d 2814	. . . . . . . 8 ⊢ (𝑘 = 1 → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘1) ∈ ℝ))
44	43, 39, 34	rspcdva 3592	. . . . . . 7 ⊢ (𝜑 → (𝐹‘1) ∈ ℝ)
45	42, 44	addge02d 11774	. . . . . 6 ⊢ (𝜑 → (0 ≤ (𝐹‘1) ↔ (𝐹‘2) ≤ ((𝐹‘1) + (𝐹‘2))))
46	35, 45	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝐹‘2) ≤ ((𝐹‘1) + (𝐹‘2)))
47	44, 42	readdcld 11210	. . . . . 6 ⊢ (𝜑 → ((𝐹‘1) + (𝐹‘2)) ∈ ℝ)
48	41	nnrpd 13000	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℝ⁺)
49	42, 47, 48	lemul2d 13046	. . . . 5 ⊢ (𝜑 → ((𝐹‘2) ≤ ((𝐹‘1) + (𝐹‘2)) ↔ (2 · (𝐹‘2)) ≤ (2 · ((𝐹‘1) + (𝐹‘2)))))
50	46, 49	mpbid 232	. . . 4 ⊢ (𝜑 → (2 · (𝐹‘2)) ≤ (2 · ((𝐹‘1) + (𝐹‘2))))
51		1z 12570	. . . . 5 ⊢ 1 ∈ ℤ
52		fveq2 6861	. . . . . . 7 ⊢ (𝑛 = 1 → (𝐺‘𝑛) = (𝐺‘1))
53		oveq2 7398	. . . . . . . . 9 ⊢ (𝑛 = 1 → (2↑𝑛) = (2↑1))
54	53, 5	eqtrdi 2781	. . . . . . . 8 ⊢ (𝑛 = 1 → (2↑𝑛) = 2)
55	54	fveq2d 6865	. . . . . . . 8 ⊢ (𝑛 = 1 → (𝐹‘(2↑𝑛)) = (𝐹‘2))
56	54, 55	oveq12d 7408	. . . . . . 7 ⊢ (𝑛 = 1 → ((2↑𝑛) · (𝐹‘(2↑𝑛))) = (2 · (𝐹‘2)))
57	52, 56	eqeq12d 2746	. . . . . 6 ⊢ (𝑛 = 1 → ((𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))) ↔ (𝐺‘1) = (2 · (𝐹‘2))))
58		climcnds.4	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))))
59	58	ralrimiva 3126	. . . . . 6 ⊢ (𝜑 → ∀𝑛 ∈ ℕ₀ (𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))))
60		1nn0 12465	. . . . . . 7 ⊢ 1 ∈ ℕ₀
61	60	a1i 11	. . . . . 6 ⊢ (𝜑 → 1 ∈ ℕ₀)
62	57, 59, 61	rspcdva 3592	. . . . 5 ⊢ (𝜑 → (𝐺‘1) = (2 · (𝐹‘2)))
63	51, 62	seq1i 13987	. . . 4 ⊢ (𝜑 → (seq1( + , 𝐺)‘1) = (2 · (𝐹‘2)))
64		nnuz 12843	. . . . . 6 ⊢ ℕ = (ℤ_≥‘1)
65		df-2 12256	. . . . . 6 ⊢ 2 = (1 + 1)
66		eqidd 2731	. . . . . . 7 ⊢ (𝜑 → (𝐹‘1) = (𝐹‘1))
67	51, 66	seq1i 13987	. . . . . 6 ⊢ (𝜑 → (seq1( + , 𝐹)‘1) = (𝐹‘1))
68		eqidd 2731	. . . . . 6 ⊢ (𝜑 → (𝐹‘2) = (𝐹‘2))
69	64, 34, 65, 67, 68	seqp1d 13990	. . . . 5 ⊢ (𝜑 → (seq1( + , 𝐹)‘2) = ((𝐹‘1) + (𝐹‘2)))
70	69	oveq2d 7406	. . . 4 ⊢ (𝜑 → (2 · (seq1( + , 𝐹)‘2)) = (2 · ((𝐹‘1) + (𝐹‘2))))
71	50, 63, 70	3brtr4d 5142	. . 3 ⊢ (𝜑 → (seq1( + , 𝐺)‘1) ≤ (2 · (seq1( + , 𝐹)‘2)))
72		fveq2 6861	. . . . . . . . . . 11 ⊢ (𝑛 = (𝑗 + 1) → (𝐺‘𝑛) = (𝐺‘(𝑗 + 1)))
73		oveq2 7398	. . . . . . . . . . . 12 ⊢ (𝑛 = (𝑗 + 1) → (2↑𝑛) = (2↑(𝑗 + 1)))
74	73	fveq2d 6865	. . . . . . . . . . . 12 ⊢ (𝑛 = (𝑗 + 1) → (𝐹‘(2↑𝑛)) = (𝐹‘(2↑(𝑗 + 1))))
75	73, 74	oveq12d 7408	. . . . . . . . . . 11 ⊢ (𝑛 = (𝑗 + 1) → ((2↑𝑛) · (𝐹‘(2↑𝑛))) = ((2↑(𝑗 + 1)) · (𝐹‘(2↑(𝑗 + 1)))))
76	72, 75	eqeq12d 2746	. . . . . . . . . 10 ⊢ (𝑛 = (𝑗 + 1) → ((𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))) ↔ (𝐺‘(𝑗 + 1)) = ((2↑(𝑗 + 1)) · (𝐹‘(2↑(𝑗 + 1))))))
77	59	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ∀𝑛 ∈ ℕ₀ (𝐺‘𝑛) = ((2↑𝑛) · (𝐹‘(2↑𝑛))))
78		peano2nn 12205	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ℕ → (𝑗 + 1) ∈ ℕ)
79	78	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝑗 + 1) ∈ ℕ)
80	79	nnnn0d 12510	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝑗 + 1) ∈ ℕ₀)
81	76, 77, 80	rspcdva 3592	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐺‘(𝑗 + 1)) = ((2↑(𝑗 + 1)) · (𝐹‘(2↑(𝑗 + 1)))))
82		nnnn0 12456	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ ℕ → 𝑗 ∈ ℕ₀)
83	82	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝑗 ∈ ℕ₀)
84		expp1 14040	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℂ ∧ 𝑗 ∈ ℕ₀) → (2↑(𝑗 + 1)) = ((2↑𝑗) · 2))
85	3, 83, 84	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) = ((2↑𝑗) · 2))
86		nnexpcl 14046	. . . . . . . . . . . . . . 15 ⊢ ((2 ∈ ℕ ∧ 𝑗 ∈ ℕ₀) → (2↑𝑗) ∈ ℕ)
87	40, 82, 86	sylancr 587	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ ℕ → (2↑𝑗) ∈ ℕ)
88	87	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ ℕ)
89	88	nncnd 12209	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ ℂ)
90		mulcom 11161	. . . . . . . . . . . 12 ⊢ (((2↑𝑗) ∈ ℂ ∧ 2 ∈ ℂ) → ((2↑𝑗) · 2) = (2 · (2↑𝑗)))
91	89, 3, 90	sylancl 586	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · 2) = (2 · (2↑𝑗)))
92	85, 91	eqtrd 2765	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) = (2 · (2↑𝑗)))
93	92	oveq1d 7405	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑(𝑗 + 1)) · (𝐹‘(2↑(𝑗 + 1)))) = ((2 · (2↑𝑗)) · (𝐹‘(2↑(𝑗 + 1)))))
94	3	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 2 ∈ ℂ)
95		fveq2 6861	. . . . . . . . . . . . 13 ⊢ (𝑘 = (2↑(𝑗 + 1)) → (𝐹‘𝑘) = (𝐹‘(2↑(𝑗 + 1))))
96	95	eleq1d 2814	. . . . . . . . . . . 12 ⊢ (𝑘 = (2↑(𝑗 + 1)) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(2↑(𝑗 + 1))) ∈ ℝ))
97	39	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℝ)
98		nnexpcl 14046	. . . . . . . . . . . . 13 ⊢ ((2 ∈ ℕ ∧ (𝑗 + 1) ∈ ℕ₀) → (2↑(𝑗 + 1)) ∈ ℕ)
99	40, 80, 98	sylancr 587	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) ∈ ℕ)
100	96, 97, 99	rspcdva 3592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐹‘(2↑(𝑗 + 1))) ∈ ℝ)
101	100	recnd 11209	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐹‘(2↑(𝑗 + 1))) ∈ ℂ)
102	94, 89, 101	mulassd 11204	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2 · (2↑𝑗)) · (𝐹‘(2↑(𝑗 + 1)))) = (2 · ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1))))))
103	81, 93, 102	3eqtrd 2769	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐺‘(𝑗 + 1)) = (2 · ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1))))))
104	88	nnnn0d 12510	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ ℕ₀)
105		hashfz1 14318	. . . . . . . . . . . . . . 15 ⊢ ((2↑𝑗) ∈ ℕ₀ → (♯‘(1...(2↑𝑗))) = (2↑𝑗))
106	104, 105	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(1...(2↑𝑗))) = (2↑𝑗))
107	106, 89	eqeltrd 2829	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(1...(2↑𝑗))) ∈ ℂ)
108		fzfid 13945	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (((2↑𝑗) + 1)...(2↑(𝑗 + 1))) ∈ Fin)
109		hashcl 14328	. . . . . . . . . . . . . . 15 ⊢ ((((2↑𝑗) + 1)...(2↑(𝑗 + 1))) ∈ Fin → (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∈ ℕ₀)
110	108, 109	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∈ ℕ₀)
111	110	nn0cnd 12512	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∈ ℂ)
112		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝑗 ∈ ℕ)
113	112	nnzd 12563	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝑗 ∈ ℤ)
114		uzid 12815	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 ∈ ℤ → 𝑗 ∈ (ℤ_≥‘𝑗))
115		peano2uz 12867	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 ∈ (ℤ_≥‘𝑗) → (𝑗 + 1) ∈ (ℤ_≥‘𝑗))
116		2re 12267	. . . . . . . . . . . . . . . . . . 19 ⊢ 2 ∈ ℝ
117		1le2 12397	. . . . . . . . . . . . . . . . . . 19 ⊢ 1 ≤ 2
118		leexp2a 14144	. . . . . . . . . . . . . . . . . . 19 ⊢ ((2 ∈ ℝ ∧ 1 ≤ 2 ∧ (𝑗 + 1) ∈ (ℤ_≥‘𝑗)) → (2↑𝑗) ≤ (2↑(𝑗 + 1)))
119	116, 117, 118	mp3an12 1453	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑗 + 1) ∈ (ℤ_≥‘𝑗) → (2↑𝑗) ≤ (2↑(𝑗 + 1)))
120	113, 114, 115, 119	4syl 19	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ≤ (2↑(𝑗 + 1)))
121	88, 64	eleqtrdi 2839	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ (ℤ_≥‘1))
122	99	nnzd 12563	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) ∈ ℤ)
123		elfz5 13484	. . . . . . . . . . . . . . . . . 18 ⊢ (((2↑𝑗) ∈ (ℤ_≥‘1) ∧ (2↑(𝑗 + 1)) ∈ ℤ) → ((2↑𝑗) ∈ (1...(2↑(𝑗 + 1))) ↔ (2↑𝑗) ≤ (2↑(𝑗 + 1))))
124	121, 122, 123	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) ∈ (1...(2↑(𝑗 + 1))) ↔ (2↑𝑗) ≤ (2↑(𝑗 + 1))))
125	120, 124	mpbird 257	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ (1...(2↑(𝑗 + 1))))
126		fzsplit 13518	. . . . . . . . . . . . . . . 16 ⊢ ((2↑𝑗) ∈ (1...(2↑(𝑗 + 1))) → (1...(2↑(𝑗 + 1))) = ((1...(2↑𝑗)) ∪ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))))
127	125, 126	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (1...(2↑(𝑗 + 1))) = ((1...(2↑𝑗)) ∪ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))))
128	127	fveq2d 6865	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(1...(2↑(𝑗 + 1)))) = (♯‘((1...(2↑𝑗)) ∪ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))))))
129	89	times2d 12433	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · 2) = ((2↑𝑗) + (2↑𝑗)))
130	85, 129	eqtrd 2765	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) = ((2↑𝑗) + (2↑𝑗)))
131	99	nnnn0d 12510	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) ∈ ℕ₀)
132		hashfz1 14318	. . . . . . . . . . . . . . . 16 ⊢ ((2↑(𝑗 + 1)) ∈ ℕ₀ → (♯‘(1...(2↑(𝑗 + 1)))) = (2↑(𝑗 + 1)))
133	131, 132	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(1...(2↑(𝑗 + 1)))) = (2↑(𝑗 + 1)))
134	106	oveq1d 7405	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((♯‘(1...(2↑𝑗))) + (2↑𝑗)) = ((2↑𝑗) + (2↑𝑗)))
135	130, 133, 134	3eqtr4d 2775	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘(1...(2↑(𝑗 + 1)))) = ((♯‘(1...(2↑𝑗))) + (2↑𝑗)))
136		fzfid 13945	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (1...(2↑𝑗)) ∈ Fin)
137	88	nnred 12208	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) ∈ ℝ)
138	137	ltp1d 12120	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) < ((2↑𝑗) + 1))
139		fzdisj 13519	. . . . . . . . . . . . . . . 16 ⊢ ((2↑𝑗) < ((2↑𝑗) + 1) → ((1...(2↑𝑗)) ∩ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) = ∅)
140	138, 139	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((1...(2↑𝑗)) ∩ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) = ∅)
141		hashun 14354	. . . . . . . . . . . . . . 15 ⊢ (((1...(2↑𝑗)) ∈ Fin ∧ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))) ∈ Fin ∧ ((1...(2↑𝑗)) ∩ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) = ∅) → (♯‘((1...(2↑𝑗)) ∪ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))))) = ((♯‘(1...(2↑𝑗))) + (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1))))))
142	136, 108, 140, 141	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (♯‘((1...(2↑𝑗)) ∪ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))))) = ((♯‘(1...(2↑𝑗))) + (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1))))))
143	128, 135, 142	3eqtr3d 2773	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((♯‘(1...(2↑𝑗))) + (2↑𝑗)) = ((♯‘(1...(2↑𝑗))) + (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1))))))
144	107, 89, 111, 143	addcanad 11386	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑𝑗) = (♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))))
145	144	oveq1d 7405	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1)))) = ((♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) · (𝐹‘(2↑(𝑗 + 1)))))
146		fsumconst 15763	. . . . . . . . . . . 12 ⊢ (((((2↑𝑗) + 1)...(2↑(𝑗 + 1))) ∈ Fin ∧ (𝐹‘(2↑(𝑗 + 1))) ∈ ℂ) → Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))) = ((♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) · (𝐹‘(2↑(𝑗 + 1)))))
147	108, 101, 146	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))) = ((♯‘(((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) · (𝐹‘(2↑(𝑗 + 1)))))
148	145, 147	eqtr4d 2768	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1)))) = Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))))
149	100	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (𝐹‘(2↑(𝑗 + 1))) ∈ ℝ)
150		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝜑)
151		peano2nn 12205	. . . . . . . . . . . . . 14 ⊢ ((2↑𝑗) ∈ ℕ → ((2↑𝑗) + 1) ∈ ℕ)
152	88, 151	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) + 1) ∈ ℕ)
153		elfzuz 13488	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))) → 𝑘 ∈ (ℤ_≥‘((2↑𝑗) + 1)))
154		eluznn 12884	. . . . . . . . . . . . 13 ⊢ ((((2↑𝑗) + 1) ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘((2↑𝑗) + 1))) → 𝑘 ∈ ℕ)
155	152, 153, 154	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → 𝑘 ∈ ℕ)
156	150, 155, 38	syl2an2r 685	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (𝐹‘𝑘) ∈ ℝ)
157		elfzuz3 13489	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))) → (2↑(𝑗 + 1)) ∈ (ℤ_≥‘𝑛))
158	157	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (2↑(𝑗 + 1)) ∈ (ℤ_≥‘𝑛))
159		simplll 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...(2↑(𝑗 + 1)))) → 𝜑)
160		elfzuz 13488	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1))) → 𝑛 ∈ (ℤ_≥‘((2↑𝑗) + 1)))
161		eluznn 12884	. . . . . . . . . . . . . . . . 17 ⊢ ((((2↑𝑗) + 1) ∈ ℕ ∧ 𝑛 ∈ (ℤ_≥‘((2↑𝑗) + 1))) → 𝑛 ∈ ℕ)
162	152, 160, 161	syl2an 596	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → 𝑛 ∈ ℕ)
163		elfzuz 13488	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑛...(2↑(𝑗 + 1))) → 𝑘 ∈ (ℤ_≥‘𝑛))
164		eluznn 12884	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘𝑛)) → 𝑘 ∈ ℕ)
165	162, 163, 164	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...(2↑(𝑗 + 1)))) → 𝑘 ∈ ℕ)
166	159, 165, 38	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...(2↑(𝑗 + 1)))) → (𝐹‘𝑘) ∈ ℝ)
167		simplll 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...((2↑(𝑗 + 1)) − 1))) → 𝜑)
168		elfzuz 13488	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑛...((2↑(𝑗 + 1)) − 1)) → 𝑘 ∈ (ℤ_≥‘𝑛))
169	162, 168, 164	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...((2↑(𝑗 + 1)) − 1))) → 𝑘 ∈ ℕ)
170		climcnds.3	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
171	167, 169, 170	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) ∧ 𝑘 ∈ (𝑛...((2↑(𝑗 + 1)) − 1))) → (𝐹‘(𝑘 + 1)) ≤ (𝐹‘𝑘))
172	158, 166, 171	monoord2 14005	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑛))
173	172	ralrimiva 3126	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ∀𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑛))
174		fveq2 6861	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
175	174	breq2d 5122	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑘 → ((𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑛) ↔ (𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑘)))
176	175	rspccva 3590	. . . . . . . . . . . 12 ⊢ ((∀𝑛 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑛) ∧ 𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑘))
177	173, 176	sylan 580	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))) → (𝐹‘(2↑(𝑗 + 1))) ≤ (𝐹‘𝑘))
178	108, 149, 156, 177	fsumle 15772	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘(2↑(𝑗 + 1))) ≤ Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))
179	148, 178	eqbrtrd 5132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1)))) ≤ Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))
180	137, 100	remulcld 11211	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1)))) ∈ ℝ)
181	108, 156	fsumrecl 15707	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘) ∈ ℝ)
182		2rp 12963	. . . . . . . . . . 11 ⊢ 2 ∈ ℝ⁺
183	182	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 2 ∈ ℝ⁺)
184	180, 181, 183	lemul2d 13046	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1)))) ≤ Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘) ↔ (2 · ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1))))) ≤ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))))
185	179, 184	mpbid 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · ((2↑𝑗) · (𝐹‘(2↑(𝑗 + 1))))) ≤ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))
186	103, 185	eqbrtrd 5132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐺‘(𝑗 + 1)) ≤ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))
187		1zzd 12571	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
188		nnnn0 12456	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
189		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → 𝑛 ∈ ℕ₀)
190		nnexpcl 14046	. . . . . . . . . . . . . . 15 ⊢ ((2 ∈ ℕ ∧ 𝑛 ∈ ℕ₀) → (2↑𝑛) ∈ ℕ)
191	40, 189, 190	sylancr 587	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (2↑𝑛) ∈ ℕ)
192	191	nnred 12208	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (2↑𝑛) ∈ ℝ)
193		fveq2 6861	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = (2↑𝑛) → (𝐹‘𝑘) = (𝐹‘(2↑𝑛)))
194	193	eleq1d 2814	. . . . . . . . . . . . . 14 ⊢ (𝑘 = (2↑𝑛) → ((𝐹‘𝑘) ∈ ℝ ↔ (𝐹‘(2↑𝑛)) ∈ ℝ))
195	39	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → ∀𝑘 ∈ ℕ (𝐹‘𝑘) ∈ ℝ)
196	194, 195, 191	rspcdva 3592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐹‘(2↑𝑛)) ∈ ℝ)
197	192, 196	remulcld 11211	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → ((2↑𝑛) · (𝐹‘(2↑𝑛))) ∈ ℝ)
198	58, 197	eqeltrd 2829	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ₀) → (𝐺‘𝑛) ∈ ℝ)
199	188, 198	sylan2 593	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐺‘𝑛) ∈ ℝ)
200	64, 187, 199	serfre 14003	. . . . . . . . 9 ⊢ (𝜑 → seq1( + , 𝐺):ℕ⟶ℝ)
201	200	ffvelcdmda 7059	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (seq1( + , 𝐺)‘𝑗) ∈ ℝ)
202	72	eleq1d 2814	. . . . . . . . 9 ⊢ (𝑛 = (𝑗 + 1) → ((𝐺‘𝑛) ∈ ℝ ↔ (𝐺‘(𝑗 + 1)) ∈ ℝ))
203	199	ralrimiva 3126	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐺‘𝑛) ∈ ℝ)
204	203	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ∀𝑛 ∈ ℕ (𝐺‘𝑛) ∈ ℝ)
205	202, 204, 79	rspcdva 3592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (𝐺‘(𝑗 + 1)) ∈ ℝ)
206	64, 187, 38	serfre 14003	. . . . . . . . . 10 ⊢ (𝜑 → seq1( + , 𝐹):ℕ⟶ℝ)
207		ffvelcdm 7056	. . . . . . . . . 10 ⊢ ((seq1( + , 𝐹):ℕ⟶ℝ ∧ (2↑𝑗) ∈ ℕ) → (seq1( + , 𝐹)‘(2↑𝑗)) ∈ ℝ)
208	206, 87, 207	syl2an 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (seq1( + , 𝐹)‘(2↑𝑗)) ∈ ℝ)
209		remulcl 11160	. . . . . . . . 9 ⊢ ((2 ∈ ℝ ∧ (seq1( + , 𝐹)‘(2↑𝑗)) ∈ ℝ) → (2 · (seq1( + , 𝐹)‘(2↑𝑗))) ∈ ℝ)
210	116, 208, 209	sylancr 587	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · (seq1( + , 𝐹)‘(2↑𝑗))) ∈ ℝ)
211		remulcl 11160	. . . . . . . . 9 ⊢ ((2 ∈ ℝ ∧ Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘) ∈ ℝ) → (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)) ∈ ℝ)
212	116, 181, 211	sylancr 587	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)) ∈ ℝ)
213		le2add 11667	. . . . . . . 8 ⊢ ((((seq1( + , 𝐺)‘𝑗) ∈ ℝ ∧ (𝐺‘(𝑗 + 1)) ∈ ℝ) ∧ ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) ∈ ℝ ∧ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)) ∈ ℝ)) → (((seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))) ∧ (𝐺‘(𝑗 + 1)) ≤ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))) → ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))) ≤ ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))))
214	201, 205, 210, 212, 213	syl22anc 838	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (((seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))) ∧ (𝐺‘(𝑗 + 1)) ≤ (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))) → ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))) ≤ ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))))
215	186, 214	mpan2d 694	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))) → ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))) ≤ ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))))
216	112, 64	eleqtrdi 2839	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → 𝑗 ∈ (ℤ_≥‘1))
217		seqp1 13988	. . . . . . . 8 ⊢ (𝑗 ∈ (ℤ_≥‘1) → (seq1( + , 𝐺)‘(𝑗 + 1)) = ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))))
218	216, 217	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (seq1( + , 𝐺)‘(𝑗 + 1)) = ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))))
219		fzfid 13945	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (1...(2↑(𝑗 + 1))) ∈ Fin)
220		elfznn 13521	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1...(2↑(𝑗 + 1))) → 𝑘 ∈ ℕ)
221	38	recnd 11209	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℂ)
222	150, 220, 221	syl2an 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (1...(2↑(𝑗 + 1)))) → (𝐹‘𝑘) ∈ ℂ)
223	140, 127, 219, 222	fsumsplit 15714	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (1...(2↑(𝑗 + 1)))(𝐹‘𝑘) = (Σ𝑘 ∈ (1...(2↑𝑗))(𝐹‘𝑘) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))
224		eqidd 2731	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (1...(2↑(𝑗 + 1)))) → (𝐹‘𝑘) = (𝐹‘𝑘))
225	99, 64	eleqtrdi 2839	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2↑(𝑗 + 1)) ∈ (ℤ_≥‘1))
226	224, 225, 222	fsumser 15703	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (1...(2↑(𝑗 + 1)))(𝐹‘𝑘) = (seq1( + , 𝐹)‘(2↑(𝑗 + 1))))
227		eqidd 2731	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (1...(2↑𝑗))) → (𝐹‘𝑘) = (𝐹‘𝑘))
228		elfznn 13521	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (1...(2↑𝑗)) → 𝑘 ∈ ℕ)
229	150, 228, 221	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑗 ∈ ℕ) ∧ 𝑘 ∈ (1...(2↑𝑗))) → (𝐹‘𝑘) ∈ ℂ)
230	227, 121, 229	fsumser 15703	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (1...(2↑𝑗))(𝐹‘𝑘) = (seq1( + , 𝐹)‘(2↑𝑗)))
231	230	oveq1d 7405	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (Σ𝑘 ∈ (1...(2↑𝑗))(𝐹‘𝑘) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)) = ((seq1( + , 𝐹)‘(2↑𝑗)) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))
232	223, 226, 231	3eqtr3d 2773	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (seq1( + , 𝐹)‘(2↑(𝑗 + 1))) = ((seq1( + , 𝐹)‘(2↑𝑗)) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))
233	232	oveq2d 7406	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))) = (2 · ((seq1( + , 𝐹)‘(2↑𝑗)) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))))
234	208	recnd 11209	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (seq1( + , 𝐹)‘(2↑𝑗)) ∈ ℂ)
235	181	recnd 11209	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘) ∈ ℂ)
236	94, 234, 235	adddid 11205	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · ((seq1( + , 𝐹)‘(2↑𝑗)) + Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))) = ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))))
237	233, 236	eqtrd 2765	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))) = ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘))))
238	218, 237	breq12d 5123	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))) ↔ ((seq1( + , 𝐺)‘𝑗) + (𝐺‘(𝑗 + 1))) ≤ ((2 · (seq1( + , 𝐹)‘(2↑𝑗))) + (2 · Σ𝑘 ∈ (((2↑𝑗) + 1)...(2↑(𝑗 + 1)))(𝐹‘𝑘)))))
239	215, 238	sylibrd 259	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ ℕ) → ((seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))) → (seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1))))))
240	239	expcom 413	. . . 4 ⊢ (𝑗 ∈ ℕ → (𝜑 → ((seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗))) → (seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))))))
241	240	a2d 29	. . 3 ⊢ (𝑗 ∈ ℕ → ((𝜑 → (seq1( + , 𝐺)‘𝑗) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑗)))) → (𝜑 → (seq1( + , 𝐺)‘(𝑗 + 1)) ≤ (2 · (seq1( + , 𝐹)‘(2↑(𝑗 + 1)))))))
242	10, 16, 22, 28, 71, 241	nnind 12211	. 2 ⊢ (𝑁 ∈ ℕ → (𝜑 → (seq1( + , 𝐺)‘𝑁) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑁)))))
243	242	impcom 407	1 ⊢ ((𝜑 ∧ 𝑁 ∈ ℕ) → (seq1( + , 𝐺)‘𝑁) ≤ (2 · (seq1( + , 𝐹)‘(2↑𝑁))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3045 ∪ cun 3915 ∩ cin 3916 ∅c0 4299 class class class wbr 5110 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 Fincfn 8921 ℂcc 11073 ℝcr 11074 0cc0 11075 1c1 11076 + caddc 11078 · cmul 11080 < clt 11215 ≤ cle 11216 − cmin 11412 ℕcn 12193 2c2 12248 ℕ₀cn0 12449 ℤcz 12536 ℤ_≥cuz 12800 ℝ⁺crp 12958 ...cfz 13475 seqcseq 13973 ↑cexp 14033 ♯chash 14302 Σcsu 15659

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-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-inf2 9601 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-int 4914 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-se 5595 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-isom 6523 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-1o 8437 df-oadd 8441 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9400 df-oi 9470 df-dju 9861 df-card 9899 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-3 12257 df-n0 12450 df-z 12537 df-uz 12801 df-rp 12959 df-ico 13319 df-fz 13476 df-fzo 13623 df-seq 13974 df-exp 14034 df-hash 14303 df-cj 15072 df-re 15073 df-im 15074 df-sqrt 15208 df-abs 15209 df-clim 15461 df-sum 15660

This theorem is referenced by: climcnds 15824

W3C validator