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 15795

Description: Lemma for nconstwlpo 15797. 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 9370	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 1 ∈ ℤ)
3		simprl 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℕ)
4	3	peano2nnd 9022	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝑥 + 1) ∈ ℕ)
5	4	nnzd 9464	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝑥 + 1) ∈ ℤ)
6	5, 2	zsubcld 9470	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((𝑥 + 1) − 1) ∈ ℤ)
7	2, 6	fzfigd 10540	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) ∈ Fin)
8		elfznn 10146	. . . . . . 7 ⊢ (𝑖 ∈ (1...((𝑥 + 1) − 1)) → 𝑖 ∈ ℕ)
9		2rp 9750	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ⁺
10	9	a1i 9	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 2 ∈ ℝ⁺)
11		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ ℕ)
12	11	nnzd 9464	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ ℤ)
13	10, 12	rpexpcld 10806	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (2↑𝑖) ∈ ℝ⁺)
14	13	rpreccld 9799	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (1 / (2↑𝑖)) ∈ ℝ⁺)
15	14	rpred 9788	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (1 / (2↑𝑖)) ∈ ℝ)
16		0re 8043	. . . . . . . . . 10 ⊢ 0 ∈ ℝ
17		1re 8042	. . . . . . . . . 10 ⊢ 1 ∈ ℝ
18		prssi 3781	. . . . . . . . . 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 5701	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (𝐺‘𝑖) ∈ {0, 1})
23	19, 22	sselid 3182	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → (𝐺‘𝑖) ∈ ℝ)
24	15, 23	remulcld 8074	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
25	8, 24	sylan2 286	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1...((𝑥 + 1) − 1))) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
26	7, 25	fsumrecl 11583	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
27		eqid 2196	. . . . . 6 ⊢ (ℤ_≥‘(𝑥 + 1)) = (ℤ_≥‘(𝑥 + 1))
28		eqid 2196	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛))) = (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))
29		oveq2 5933	. . . . . . . . 9 ⊢ (𝑛 = 𝑖 → (2↑𝑛) = (2↑𝑖))
30	29	oveq2d 5941	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → (1 / (2↑𝑛)) = (1 / (2↑𝑖)))
31		fveq2 5561	. . . . . . . 8 ⊢ (𝑛 = 𝑖 → (𝐺‘𝑛) = (𝐺‘𝑖))
32	30, 31	oveq12d 5943	. . . . . . 7 ⊢ (𝑛 = 𝑖 → ((1 / (2↑𝑛)) · (𝐺‘𝑛)) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
33		eluznn 9691	. . . . . . . 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 5658	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
37	20, 28	trilpolemclim 15767	. . . . . . . 8 ⊢ (𝜑 → seq1( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ )
38	37	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → seq1( + , (𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))) ∈ dom ⇝ )
39		nnuz 9654	. . . . . . . 8 ⊢ ℕ = (ℤ_≥‘1)
40	28, 32, 11, 24	fvmptd3 5658	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) = ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
41	24	recnd 8072	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℂ)
42	40, 41	eqeltrd 2273	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ ((1 / (2↑𝑛)) · (𝐺‘𝑛)))‘𝑖) ∈ ℂ)
43	39, 4, 42	iserex 11521	. . . . . . 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 11611	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
46	3	nnzd 9464	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℤ)
47		fzofig 10541	. . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ 𝑥 ∈ ℤ) → (1..^𝑥) ∈ Fin)
48	2, 46, 47	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1..^𝑥) ∈ Fin)
49		elfzo1 10283	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (1..^𝑥) ↔ (𝑖 ∈ ℕ ∧ 𝑥 ∈ ℕ ∧ 𝑖 < 𝑥))
50	49	simp1bi 1014	. . . . . . . . . 10 ⊢ (𝑖 ∈ (1..^𝑥) → 𝑖 ∈ ℕ)
51	50, 24	sylan2 286	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
52	48, 51	fsumrecl 11583	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℝ)
53	9	a1i 9	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 2 ∈ ℝ⁺)
54	53, 46	rpexpcld 10806	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (2↑𝑥) ∈ ℝ⁺)
55	54	rpreccld 9799	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℝ⁺)
56	55	rpred 9788	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℝ)
57	20	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝐺:ℕ⟶{0, 1})
58	57, 3	ffvelcdmd 5701	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) ∈ {0, 1})
59	19, 58	sselid 3182	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) ∈ ℝ)
60	56, 59	remulcld 8074	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) ∈ ℝ)
61	14	rpge0d 9792	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ (1 / (2↑𝑖)))
62		0le0 9096	. . . . . . . . . . . . 13 ⊢ 0 ≤ 0
63		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 0) → (𝐺‘𝑖) = 0)
64	62, 63	breqtrrid 4072	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 0) → 0 ≤ (𝐺‘𝑖))
65		0le1 8525	. . . . . . . . . . . . 13 ⊢ 0 ≤ 1
66		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 1) → (𝐺‘𝑖) = 1)
67	65, 66	breqtrrid 4072	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) ∧ (𝐺‘𝑖) = 1) → 0 ≤ (𝐺‘𝑖))
68		elpri 3646	. . . . . . . . . . . . 13 ⊢ ((𝐺‘𝑖) ∈ {0, 1} → ((𝐺‘𝑖) = 0 ∨ (𝐺‘𝑖) = 1))
69	22, 68	syl 14	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → ((𝐺‘𝑖) = 0 ∨ (𝐺‘𝑖) = 1))
70	64, 67, 69	mpjaodan 799	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ (𝐺‘𝑖))
71	15, 23, 61, 70	mulge0d 8665	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ ℕ) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
72	50, 71	sylan2 286	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
73	48, 51, 72	fsumge0 11641	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 ≤ Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)))
74	55	rpgt0d 9791	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (1 / (2↑𝑥)))
75		simprr 531	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (𝐺‘𝑥) = 1)
76	75	oveq2d 5941	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) = ((1 / (2↑𝑥)) · 1))
77	56	recnd 8072	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1 / (2↑𝑥)) ∈ ℂ)
78	77	mulridd 8060	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · 1) = (1 / (2↑𝑥)))
79	76, 78	eqtrd 2229	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) = (1 / (2↑𝑥)))
80	74, 79	breqtrrd 4062	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < ((1 / (2↑𝑥)) · (𝐺‘𝑥)))
81	52, 60, 73, 80	addgegt0d 8563	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) + ((1 / (2↑𝑥)) · (𝐺‘𝑥))))
82		nfv 1542	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1))
83		nfcv 2339	. . . . . . . 8 ⊢ Ⅎ𝑖((1 / (2↑𝑥)) · (𝐺‘𝑥))
84		fzonel 10253	. . . . . . . . 9 ⊢ ¬ 𝑥 ∈ (1..^𝑥)
85	84	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ¬ 𝑥 ∈ (1..^𝑥))
86	50, 41	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (1..^𝑥)) → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) ∈ ℂ)
87		oveq2 5933	. . . . . . . . . 10 ⊢ (𝑖 = 𝑥 → (2↑𝑖) = (2↑𝑥))
88	87	oveq2d 5941	. . . . . . . . 9 ⊢ (𝑖 = 𝑥 → (1 / (2↑𝑖)) = (1 / (2↑𝑥)))
89		fveq2 5561	. . . . . . . . 9 ⊢ (𝑖 = 𝑥 → (𝐺‘𝑖) = (𝐺‘𝑥))
90	88, 89	oveq12d 5943	. . . . . . . 8 ⊢ (𝑖 = 𝑥 → ((1 / (2↑𝑖)) · (𝐺‘𝑖)) = ((1 / (2↑𝑥)) · (𝐺‘𝑥)))
91	60	recnd 8072	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((1 / (2↑𝑥)) · (𝐺‘𝑥)) ∈ ℂ)
92	82, 83, 48, 3, 85, 86, 90, 91	fsumsplitsn 11592	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)) = (Σ𝑖 ∈ (1..^𝑥)((1 / (2↑𝑖)) · (𝐺‘𝑖)) + ((1 / (2↑𝑥)) · (𝐺‘𝑥))))
93	81, 92	breqtrrd 4062	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)))
94	3	nncnd 9021	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ ℂ)
95		1cnd 8059	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 1 ∈ ℂ)
96	94, 95	pncand 8355	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → ((𝑥 + 1) − 1) = 𝑥)
97	96	oveq2d 5941	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) = (1...𝑥))
98	3, 39	eleqtrdi 2289	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 𝑥 ∈ (ℤ_≥‘1))
99		fzisfzounsn 10329	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℤ_≥‘1) → (1...𝑥) = ((1..^𝑥) ∪ {𝑥}))
100	98, 99	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...𝑥) = ((1..^𝑥) ∪ {𝑥}))
101	97, 100	eqtrd 2229	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → (1...((𝑥 + 1) − 1)) = ((1..^𝑥) ∪ {𝑥}))
102	101	sumeq1d 11548	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) = Σ𝑖 ∈ ((1..^𝑥) ∪ {𝑥})((1 / (2↑𝑖)) · (𝐺‘𝑖)))
103	93, 102	breqtrrd 4062	. . . . 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 9792	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ (1 / (2↑𝑖)))
108	34, 70	syldan 282	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ (𝐺‘𝑖))
109	104, 105, 107, 108	mulge0d 8665	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) ∧ 𝑖 ∈ (ℤ_≥‘(𝑥 + 1))) → 0 ≤ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
110	27, 5, 36, 35, 44, 109	isumge0 11612	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 ≤ Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)))
111	26, 45, 103, 110	addgtge0d 8564	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < (Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) + Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖))))
112	39, 27, 4, 40, 41, 38	isumsplit 11673	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖)) = (Σ𝑖 ∈ (1...((𝑥 + 1) − 1))((1 / (2↑𝑖)) · (𝐺‘𝑖)) + Σ𝑖 ∈ (ℤ_≥‘(𝑥 + 1))((1 / (2↑𝑖)) · (𝐺‘𝑖))))
113	111, 112	breqtrrd 4062	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖)))
114		nconstwlpolem0.a	. . 3 ⊢ 𝐴 = Σ𝑖 ∈ ℕ ((1 / (2↑𝑖)) · (𝐺‘𝑖))
115	113, 114	breqtrrdi 4076	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ ℕ ∧ (𝐺‘𝑥) = 1)) → 0 < 𝐴)
116	1, 115	rexlimddv 2619	1 ⊢ (𝜑 → 0 < 𝐴)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 709 = wceq 1364 ∈ wcel 2167 ∃wrex 2476 ∪ cun 3155 ⊆ wss 3157 {csn 3623 {cpr 3624 class class class wbr 4034 ↦ cmpt 4095 dom cdm 4664 ⟶wf 5255 ‘cfv 5259 (class class class)co 5925 Fincfn 6808 ℂcc 7894 ℝcr 7895 0cc0 7896 1c1 7897 + caddc 7899 · cmul 7901 < clt 8078 ≤ cle 8079 − cmin 8214 / cdiv 8716 ℕcn 9007 2c2 9058 ℤcz 9343 ℤ_≥cuz 9618 ℝ⁺crp 9745 ...cfz 10100 ..^cfzo 10234 seqcseq 10556 ↑cexp 10647 ⇝ cli 11460 Σcsu 11535

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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-mulrcl 7995 ax-addcom 7996 ax-mulcom 7997 ax-addass 7998 ax-mulass 7999 ax-distr 8000 ax-i2m1 8001 ax-0lt1 8002 ax-1rid 8003 ax-0id 8004 ax-rnegex 8005 ax-precex 8006 ax-cnre 8007 ax-pre-ltirr 8008 ax-pre-ltwlin 8009 ax-pre-lttrn 8010 ax-pre-apti 8011 ax-pre-ltadd 8012 ax-pre-mulgt0 8013 ax-pre-mulext 8014 ax-arch 8015 ax-caucvg 8016

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-frec 6458 df-1o 6483 df-oadd 6487 df-er 6601 df-en 6809 df-dom 6810 df-fin 6811 df-pnf 8080 df-mnf 8081 df-xr 8082 df-ltxr 8083 df-le 8084 df-sub 8216 df-neg 8217 df-reap 8619 df-ap 8626 df-div 8717 df-inn 9008 df-2 9066 df-3 9067 df-4 9068 df-n0 9267 df-z 9344 df-uz 9619 df-q 9711 df-rp 9746 df-ico 9986 df-fz 10101 df-fzo 10235 df-seqfrec 10557 df-exp 10648 df-ihash 10885 df-cj 11024 df-re 11025 df-im 11026 df-rsqrt 11180 df-abs 11181 df-clim 11461 df-sumdc 11536

This theorem is referenced by: nconstwlpolem 15796

W3C validator