nconstwlpolemgt0 - Mathbox for Jim Kingdon

	Mathbox for Jim Kingdon		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > Mathboxes > nconstwlpolemgt0		GIF version

Theorem nconstwlpolemgt0 16720

Description: Lemma for nconstwlpo 16722. If one of the terms of series is positive, so is the sum. (Contributed by Jim Kingdon, 26-Jul-2024.)

**Hypotheses**
Ref	Expression
nconstwlpolem0.g	⊢ (𝜑 → 𝐺:ℕ⟶{0, 1})
nconstwlpolem0.a	⊢ 𝐴 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖))
nconstwlpolemgt0.0	⊢ (𝜑 → ∃𝑥 ∈ ℕ (𝐺‘𝑥) = 1)

**Assertion**
Ref	Expression
nconstwlpolemgt0	⊢ (𝜑 → 0 < 𝐴)

Distinct variable groups: 𝑥,𝐴 𝑖,𝐺 𝜑,𝑖,𝑥 Allowed substitution hints: 𝐴(𝑖) 𝐺(𝑥)

Proof of Theorem nconstwlpolemgt0 Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nconstwlpolemgt0.0	. 2 ⊢ (𝜑 → ∃𝑥 ∈ ℕ (𝐺‘𝑥) = 1)
2		1zzd 9506	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 1 ∈ ℤ)
3		simprl 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℕ)
4	3	peano2nnd 9158	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝑥 + 1) ∈ ℕ)
5	4	nnzd 9601	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝑥 + 1) ∈ ℤ)
6	5, 2	zsubcld 9607	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((𝑥 + 1) − 1) ∈ ℤ)
7	2, 6	fzfigd 10694	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) ∈ Fin)
8		elfznn 10289	. . . . . . 7 ⊢ (𝑖 ∈ (1...((𝑥 + 1) − 1)) → 𝑖 ∈ ℕ)
9		2rp 9893	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ⁺
10	9	a1i 9	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 2 ∈ ℝ⁺)
11		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ ℕ)
12	11	nnzd 9601	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ ℤ)
13	10, 12	rpexpcld 10960	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (2↑𝑖) ∈ ℝ⁺)
14	13	rpreccld 9942	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (1 / (2↑𝑖)) ∈ ℝ⁺)
15	14	rpred 9931	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (1 / (2↑𝑖)) ∈ ℝ)
16		0re 8179	. . . . . . . . . 10 ⊢ 0 ∈ ℝ
17		1re 8178	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
18		prssi 3831	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ) → {0, 1} ⊆ ℝ)
19	16, 17, 18	mp2an 426	. . . . . . . . 9 ⊢ {0, 1} ⊆ ℝ
20		nconstwlpolem0.g	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:ℕ⟶{0, 1})
21	20	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 𝐺:ℕ⟶{0, 1})
22	21, 11	ffvelcdmd 5783	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (𝐺‘𝑖) ∈ {0, 1})
23	19, 22	sselid 3225	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (𝐺‘𝑖) ∈ ℝ)
24	15, 23	remulcld 8210	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
25	8, 24	sylan2 286	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1...((𝑥 + 1) − 1))) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
26	7, 25	fsumrecl 11980	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
27		eqid 2231	. . . . . 6 ⊢ (ℤ_≥‘(𝑥 + 1)) = (ℤ_≥‘(𝑥 + 1))
28		eqid 2231	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛))) = (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))
29		oveq2 6026	. . . . . . . . 9 ⊢ (𝑛 = 𝑖 → (2↑𝑛) = (2↑𝑖))
30	29	oveq2d 6034	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → (1 / (2↑𝑛)) = (1 / (2↑𝑖)))
31		fveq2 5639	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → (𝐺‘𝑛) = (𝐺‘𝑖))
32	30, 31	oveq12d 6036	. . . . . . 7 ⊢ (𝑛 = 𝑖 → ((1 / (2↑𝑛)) · (𝐺‘𝑛)) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
33		eluznn 9834	. . . . . . . 8 ⊢ (((𝑥 + 1) ∈ ℕ ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 𝑖 ∈ ℕ)
34	4, 33	sylan 283	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 𝑖 ∈ ℕ)
35	34, 24	syldan 282	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
36	28, 32, 34, 35	fvmptd3 5740	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
37	20, 28	trilpolemclim 16691	. . . . . . . 8 ⊢ (𝜑 → seq1( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ )
38	37	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → seq1( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ )
39		nnuz 9792	. . . . . . . 8 ⊢ ℕ = (ℤ_≥‘1)
40	28, 32, 11, 24	fvmptd3 5740	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
41	24	recnd 8208	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℂ)
42	40, 41	eqeltrd 2308	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) ∈ ℂ)
43	39, 4, 42	iserex 11917	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (seq1( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ ↔ seq(𝑥 + 1)( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ ))
44	38, 43	mpbid 147	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → seq(𝑥 + 1)( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ )
45	27, 5, 36, 35, 44	isumrecl 12008	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
46	3	nnzd 9601	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℤ)
47		fzofig 10695	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (1..^𝑥) ∈ Fin)
48	2, 46, 47	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1..^𝑥) ∈ Fin)
49		elfzo1 10431	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (1..^𝑥) ↔ (𝑖 ∈ ℕ ∧ 𝑥 ∈ ℕ ∧ 𝑖 < 𝑥))
50	49	simp1bi 1038	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1..^𝑥) → 𝑖 ∈ ℕ)
51	50, 24	sylan2 286	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
52	48, 51	fsumrecl 11980	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
53	9	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 2 ∈ ℝ⁺)
54	53, 46	rpexpcld 10960	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (2↑𝑥) ∈ ℝ⁺)
55	54	rpreccld 9942	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℝ⁺)
56	55	rpred 9931	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℝ)
57	20	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝐺:ℕ⟶{0, 1})
58	57, 3	ffvelcdmd 5783	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) ∈ {0, 1})
59	19, 58	sselid 3225	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) ∈ ℝ)
60	56, 59	remulcld 8210	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) ∈ ℝ)
61	14	rpge0d 9935	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ (1 / (2↑𝑖)))
62		0le0 9232	. . . . . . . . . . . . 13 ⊢ 0 ≤ 0
63		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 0) → (𝐺‘𝑖) = 0)
64	62, 63	breqtrrid 4126	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 0) → 0 ≤ (𝐺‘𝑖))
65		0le1 8661	. . . . . . . . . . . . 13 ⊢ 0 ≤ 1
66		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 1) → (𝐺‘𝑖) = 1)
67	65, 66	breqtrrid 4126	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 1) → 0 ≤ (𝐺‘𝑖))
68		elpri 3692	. . . . . . . . . . . . 13 ⊢ ((𝐺‘𝑖) ∈ {0, 1} → ((𝐺‘𝑖) = 0 ∨ (𝐺‘𝑖) = 1))
69	22, 68	syl 14	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝐺‘𝑖) = 0 ∨ (𝐺‘𝑖) = 1))
70	64, 67, 69	mpjaodan 805	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ (𝐺‘𝑖))
71	15, 23, 61, 70	mulge0d 8801	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
72	50, 71	sylan2 286	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
73	48, 51, 72	fsumge0 12038	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 ≤ Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)))
74	55	rpgt0d 9934	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (1 / (2↑𝑥)))
75		simprr 533	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) = 1)
76	75	oveq2d 6034	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) = ((1 / (2↑𝑥)) · 1))
77	56	recnd 8208	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℂ)
78	77	mulridd 8196	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · 1) = (1 / (2↑𝑥)))
79	76, 78	eqtrd 2264	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) = (1 / (2↑𝑥)))
80	74, 79	breqtrrd 4116	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < ((1 / (2↑𝑥)) · (𝐺‘𝑥)))
81	52, 60, 73, 80	addgegt0d 8699	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) + ((1 / (2↑𝑥)) · (𝐺‘𝑥))))
82		nfv 1576	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1))
83		nfcv 2374	. . . . . . . 8 ⊢ Ⅎ𝑖((1 / (2↑𝑥)) · (𝐺‘𝑥))
84		fzonel 10396	. . . . . . . . 9 ⊢ ¬ 𝑥 ∈ (1..^𝑥)
85	84	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ¬ 𝑥 ∈ (1..^𝑥))
86	50, 41	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℂ)
87		oveq2 6026	. . . . . . . . . 10 ⊢ (𝑖 = 𝑥 → (2↑𝑖) = (2↑𝑥))
88	87	oveq2d 6034	. . . . . . . . 9 ⊢ (𝑖 = 𝑥 → (1 / (2↑𝑖)) = (1 / (2↑𝑥)))
89		fveq2 5639	. . . . . . . . 9 ⊢ (𝑖 = 𝑥 → (𝐺‘𝑖) = (𝐺‘𝑥))
90	88, 89	oveq12d 6036	. . . . . . . 8 ⊢ (𝑖 = 𝑥 → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) = ((1 / (2↑𝑥)) · (𝐺‘𝑥)))
91	60	recnd 8208	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) ∈ ℂ)
92	82, 83, 48, 3, 85, 86, 90, 91	fsumsplitsn 11989	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)) = (Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) + ((1 / (2↑𝑥)) · (𝐺‘𝑥))))
93	81, 92	breqtrrd 4116	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)))
94	3	nncnd 9157	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℂ)
95		1cnd 8195	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 1 ∈ ℂ)
96	94, 95	pncand 8491	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((𝑥 + 1) − 1) = 𝑥)
97	96	oveq2d 6034	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) = (1...𝑥))
98	3, 39	eleqtrdi 2324	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ (ℤ_≥‘1))
99		fzisfzounsn 10483	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℤ_≥‘1) → (1...𝑥) = ((1..^𝑥) ∪ {𝑥}))
100	98, 99	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...𝑥) = ((1..^𝑥) ∪ {𝑥}))
101	97, 100	eqtrd 2264	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) = ((1..^𝑥) ∪ {𝑥}))
102	101	sumeq1d 11944	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) = Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)))
103	93, 102	breqtrrd 4116	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)))
104	34, 15	syldan 282	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → (1 / (2↑𝑖)) ∈ ℝ)
105	34, 23	syldan 282	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → (𝐺‘𝑖) ∈ ℝ)
106	34, 14	syldan 282	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → (1 / (2↑𝑖)) ∈ ℝ⁺)
107	106	rpge0d 9935	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ (1 / (2↑𝑖)))
108	34, 70	syldan 282	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ (𝐺‘𝑖))
109	104, 105, 107, 108	mulge0d 8801	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
110	27, 5, 36, 35, 44, 109	isumge0 12009	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 ≤ Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)))
111	26, 45, 103, 110	addgtge0d 8700	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) + Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖))))
112	39, 27, 4, 40, 41, 38	isumsplit 12070	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖)) = (Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) + Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖))))
113	111, 112	breqtrrd 4116	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
114		nconstwlpolem0.a	. . 3 ⊢ 𝐴 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖))
115	113, 114	breqtrrdi 4130	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < 𝐴)
116	1, 115	rexlimddv 2655	1 ⊢ (𝜑 → 0 < 𝐴)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 715 = wceq 1397 ∈ wcel 2202 ∃wrex 2511 ∪ cun 3198 ⊆ wss 3200 {csn 3669 {cpr 3670 class class class wbr 4088 ↦ cmpt 4150 dom cdm 4725 ⟶wf 5322 ‘cfv 5326 (class class class)co 6018 Fincfn 6909 ℂcc 8030 ℝcr 8031 0cc0 8032 1c1 8033 + caddc 8035 · cmul 8037 < clt 8214 ≤ cle 8215 − cmin 8350 / cdiv 8852 ℕcn 9143 2c2 9194 ℤcz 9479 ℤ_≥cuz 9755 ℝ⁺crp 9888 ...cfz 10243 ..^cfzo 10377 seqcseq 10710 ↑cexp 10801 ⇝ cli 11856 Σcsu 11931

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 ax-caucvg 8152

This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-isom 5335 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-irdg 6536 df-frec 6557 df-1o 6582 df-oadd 6586 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-ico 10129 df-fz 10244 df-fzo 10378 df-seqfrec 10711 df-exp 10802 df-ihash 11039 df-cj 11420 df-re 11421 df-im 11422 df-rsqrt 11576 df-abs 11577 df-clim 11857 df-sumdc 11932

This theorem is referenced by: nconstwlpolem 16721

W3C validator