aaliou3lem7 - Metamath Proof Explorer

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

Theorem aaliou3lem7 26733

Description: Lemma for aaliou3 26735. (Contributed by Stefan O'Rear, 16-Nov-2014.)

**Hypotheses**
Ref	Expression
aaliou3lem.c	⊢ 𝐹 = (𝑎 ∈ ℕ ↦ (2↑ -(!‘𝑎)))
aaliou3lem.d	⊢ 𝐿 = Σ𝑏 ∈ ℕ (𝐹‘𝑏)
aaliou3lem.e	⊢ 𝐻 = (𝑐 ∈ ℕ ↦ Σ𝑏 ∈ (1...𝑐)(𝐹‘𝑏))

**Assertion**
Ref	Expression
aaliou3lem7	⊢ (𝐴 ∈ ℕ → ((𝐻‘𝐴) ≠ 𝐿 ∧ (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))

Distinct variable groups: 𝑎,𝑏,𝑐 𝐹,𝑏,𝑐 𝐿,𝑐 𝐴,𝑎,𝑏,𝑐 Allowed substitution hints: 𝐹(𝑎) 𝐻(𝑎, 𝑏, 𝑐) 𝐿(𝑎, 𝑏)

**Proof of Theorem aaliou3lem7**
Step	Hyp	Ref	Expression
1		peano2nn 12387	. . 3 ⊢ (𝐴 ∈ ℕ → (𝐴 + 1) ∈ ℕ)
2		eqid 2763	. . . 4 ⊢ (𝑐 ∈ (ℤ_≥‘(𝐴 + 1)) ↦ ((2↑ -(!‘(𝐴 + 1))) · ((1 / 2)↑(𝑐 − (𝐴 + 1))))) = (𝑐 ∈ (ℤ_≥‘(𝐴 + 1)) ↦ ((2↑ -(!‘(𝐴 + 1))) · ((1 / 2)↑(𝑐 − (𝐴 + 1)))))
3		aaliou3lem.c	. . . 4 ⊢ 𝐹 = (𝑎 ∈ ℕ ↦ (2↑ -(!‘𝑎)))
4	2, 3	aaliou3lem3 26728	. . 3 ⊢ ((𝐴 + 1) ∈ ℕ → (seq(𝐴 + 1)( + , 𝐹) ∈ dom ⇝ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))
5		3simpc 1168	. . 3 ⊢ ((seq(𝐴 + 1)( + , 𝐹) ∈ dom ⇝ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))) → (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))
6	1, 4, 5	3syl 19	. 2 ⊢ (𝐴 ∈ ℕ → (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))
7		nncn 12383	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
8		ax-1cn 11297	. . . . . . . . . . . 12 ⊢ 1 ∈ ℂ
9		pncan 11602	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 1) − 1) = 𝐴)
10	7, 8, 9	sylancl 598	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → ((𝐴 + 1) − 1) = 𝐴)
11	10	oveq2d 7467	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → (1...((𝐴 + 1) − 1)) = (1...𝐴))
12	11	sumeq1d 15911	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → Σ𝑏 ∈ (1...((𝐴 + 1) − 1))(𝐹‘𝑏) = Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏))
13	12	oveq1d 7466	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → (Σ𝑏 ∈ (1...((𝐴 + 1) − 1))(𝐹‘𝑏) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)) = (Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)))
14		nnuz 13044	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
15		eqid 2763	. . . . . . . . 9 ⊢ (ℤ_≥‘(𝐴 + 1)) = (ℤ_≥‘(𝐴 + 1))
16		eqidd 2764	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑏 ∈ ℕ) → (𝐹‘𝑏) = (𝐹‘𝑏))
17		fveq2 6916	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑏 → (!‘𝑎) = (!‘𝑏))
18	17	negeqd 11590	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑏 → -(!‘𝑎) = -(!‘𝑏))
19	18	oveq2d 7467	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑏 → (2↑ -(!‘𝑎)) = (2↑ -(!‘𝑏)))
20		ovex 7484	. . . . . . . . . . . 12 ⊢ (2↑ -(!‘𝑏)) ∈ V
21	19, 3, 20	fvmpt 7024	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ℕ → (𝐹‘𝑏) = (2↑ -(!‘𝑏)))
22		2rp 13165	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℝ⁺
23		nnnn0 12653	. . . . . . . . . . . . . . . 16 ⊢ (𝑏 ∈ ℕ → 𝑏 ∈ ℕ₀)
24		faccl 14468	. . . . . . . . . . . . . . . 16 ⊢ (𝑏 ∈ ℕ₀ → (!‘𝑏) ∈ ℕ)
25	23, 24	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑏 ∈ ℕ → (!‘𝑏) ∈ ℕ)
26	25	nnzd 12759	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ ℕ → (!‘𝑏) ∈ ℤ)
27	26	znegcld 12845	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ ℕ → -(!‘𝑏) ∈ ℤ)
28		rpexpcl 14263	. . . . . . . . . . . . 13 ⊢ ((2 ∈ ℝ⁺ ∧ -(!‘𝑏) ∈ ℤ) → (2↑ -(!‘𝑏)) ∈ ℝ⁺)
29	22, 27, 28	sylancr 599	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ℕ → (2↑ -(!‘𝑏)) ∈ ℝ⁺)
30	29	rpcnd 13206	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ℕ → (2↑ -(!‘𝑏)) ∈ ℂ)
31	21, 30	eqeltrd 2864	. . . . . . . . . 10 ⊢ (𝑏 ∈ ℕ → (𝐹‘𝑏) ∈ ℂ)
32	31	adantl 487	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑏 ∈ ℕ) → (𝐹‘𝑏) ∈ ℂ)
33		1nn 12386	. . . . . . . . . 10 ⊢ 1 ∈ ℕ
34		eqid 2763	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ (ℤ_≥‘1) ↦ ((2↑ -(!‘1)) · ((1 / 2)↑(𝑐 − 1)))) = (𝑐 ∈ (ℤ_≥‘1) ↦ ((2↑ -(!‘1)) · ((1 / 2)↑(𝑐 − 1))))
35	34, 3	aaliou3lem3 26728	. . . . . . . . . . 11 ⊢ (1 ∈ ℕ → (seq1( + , 𝐹) ∈ dom ⇝ ∧ Σ𝑏 ∈ (ℤ_≥‘1)(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘1)(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘1)))))
36	35	simp1d 1160	. . . . . . . . . 10 ⊢ (1 ∈ ℕ → seq1( + , 𝐹) ∈ dom ⇝ )
37	33, 36	mp1i 14	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → seq1( + , 𝐹) ∈ dom ⇝ )
38	14, 15, 1, 16, 32, 37	isumsplit 16053	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → Σ𝑏 ∈ ℕ (𝐹‘𝑏) = (Σ𝑏 ∈ (1...((𝐴 + 1) − 1))(𝐹‘𝑏) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)))
39		oveq2 7459	. . . . . . . . . . 11 ⊢ (𝑐 = 𝐴 → (1...𝑐) = (1...𝐴))
40	39	sumeq1d 15911	. . . . . . . . . 10 ⊢ (𝑐 = 𝐴 → Σ𝑏 ∈ (1...𝑐)(𝐹‘𝑏) = Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏))
41		aaliou3lem.e	. . . . . . . . . 10 ⊢ 𝐻 = (𝑐 ∈ ℕ ↦ Σ𝑏 ∈ (1...𝑐)(𝐹‘𝑏))
42		sumex 15899	. . . . . . . . . 10 ⊢ Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏) ∈ V
43	40, 41, 42	fvmpt 7024	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → (𝐻‘𝐴) = Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏))
44	43	oveq1d 7466	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((𝐻‘𝐴) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)) = (Σ𝑏 ∈ (1...𝐴)(𝐹‘𝑏) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)))
45	13, 38, 44	3eqtr4rd 2809	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → ((𝐻‘𝐴) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)) = Σ𝑏 ∈ ℕ (𝐹‘𝑏))
46		aaliou3lem.d	. . . . . . 7 ⊢ 𝐿 = Σ𝑏 ∈ ℕ (𝐹‘𝑏)
47	45, 46	eqtr4di 2816	. . . . . 6 ⊢ (𝐴 ∈ ℕ → ((𝐻‘𝐴) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)) = 𝐿)
48	3, 46, 41	aaliou3lem4 26730	. . . . . . . . 9 ⊢ 𝐿 ∈ ℝ
49	48	recni 11362	. . . . . . . 8 ⊢ 𝐿 ∈ ℂ
50	49	a1i 11	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → 𝐿 ∈ ℂ)
51	3, 46, 41	aaliou3lem5 26731	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → (𝐻‘𝐴) ∈ ℝ)
52	51	recnd 11376	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝐻‘𝐴) ∈ ℂ)
53	4	simp2d 1161	. . . . . . . . 9 ⊢ ((𝐴 + 1) ∈ ℕ → Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺)
54	1, 53	syl 18	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺)
55	54	rpcnd 13206	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℂ)
56	50, 52, 55	subaddd 11726	. . . . . 6 ⊢ (𝐴 ∈ ℕ → ((𝐿 − (𝐻‘𝐴)) = Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ↔ ((𝐻‘𝐴) + Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏)) = 𝐿))
57	47, 56	mpbird 260	. . . . 5 ⊢ (𝐴 ∈ ℕ → (𝐿 − (𝐻‘𝐴)) = Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏))
58	57	eqcomd 2769	. . . 4 ⊢ (𝐴 ∈ ℕ → Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) = (𝐿 − (𝐻‘𝐴)))
59		eleq1 2852	. . . . 5 ⊢ (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) = (𝐿 − (𝐻‘𝐴)) → (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ↔ (𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺))
60		breq1 5111	. . . . 5 ⊢ (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) = (𝐿 − (𝐻‘𝐴)) → (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))) ↔ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))
61	59, 60	anbi12d 644	. . . 4 ⊢ (Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) = (𝐿 − (𝐻‘𝐴)) → ((Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))) ↔ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))))
62	58, 61	syl 18	. . 3 ⊢ (𝐴 ∈ ℕ → ((Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))) ↔ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))))
63	51	adantr 486	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (𝐻‘𝐴) ∈ ℝ)
64		simprl 783	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺)
65		difrp 13200	. . . . . . . 8 ⊢ (((𝐻‘𝐴) ∈ ℝ ∧ 𝐿 ∈ ℝ) → ((𝐻‘𝐴) < 𝐿 ↔ (𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺))
66	63, 48, 65	sylancl 598	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) < 𝐿 ↔ (𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺))
67	64, 66	mpbird 260	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (𝐻‘𝐴) < 𝐿)
68	63, 67	ltned 11485	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (𝐻‘𝐴) ≠ 𝐿)
69		nnnn0 12653	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 + 1) ∈ ℕ → (𝐴 + 1) ∈ ℕ₀)
70		faccl 14468	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 + 1) ∈ ℕ₀ → (!‘(𝐴 + 1)) ∈ ℕ)
71	1, 69, 70	3syl 19	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℕ → (!‘(𝐴 + 1)) ∈ ℕ)
72	71	nnzd 12759	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℕ → (!‘(𝐴 + 1)) ∈ ℤ)
73	72	znegcld 12845	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → -(!‘(𝐴 + 1)) ∈ ℤ)
74		rpexpcl 14263	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℝ⁺ ∧ -(!‘(𝐴 + 1)) ∈ ℤ) → (2↑ -(!‘(𝐴 + 1))) ∈ ℝ⁺)
75	22, 73, 74	sylancr 599	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → (2↑ -(!‘(𝐴 + 1))) ∈ ℝ⁺)
76		rpmulcl 13185	. . . . . . . . . . 11 ⊢ ((2 ∈ ℝ⁺ ∧ (2↑ -(!‘(𝐴 + 1))) ∈ ℝ⁺) → (2 · (2↑ -(!‘(𝐴 + 1)))) ∈ ℝ⁺)
77	22, 75, 76	sylancr 599	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → (2 · (2↑ -(!‘(𝐴 + 1)))) ∈ ℝ⁺)
78	77	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (2 · (2↑ -(!‘(𝐴 + 1)))) ∈ ℝ⁺)
79	78	rpred 13204	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (2 · (2↑ -(!‘(𝐴 + 1)))) ∈ ℝ)
80	63, 79	resubcld 11783	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) − (2 · (2↑ -(!‘(𝐴 + 1))))) ∈ ℝ)
81	48	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → 𝐿 ∈ ℝ)
82	63, 78	ltsubrpd 13236	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) − (2 · (2↑ -(!‘(𝐴 + 1))))) < (𝐻‘𝐴))
83	80, 63, 81, 82, 67	lttrd 11510	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) − (2 · (2↑ -(!‘(𝐴 + 1))))) < 𝐿)
84	80, 81, 83	ltled 11497	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) − (2 · (2↑ -(!‘(𝐴 + 1))))) ≤ 𝐿)
85		simprr 785	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))
86	81, 63, 79	lesubadd2d 11955	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))) ↔ 𝐿 ≤ ((𝐻‘𝐴) + (2 · (2↑ -(!‘(𝐴 + 1)))))))
87	85, 86	mpbid 235	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → 𝐿 ≤ ((𝐻‘𝐴) + (2 · (2↑ -(!‘(𝐴 + 1))))))
88	81, 63, 79	absdifled 15648	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))) ↔ (((𝐻‘𝐴) − (2 · (2↑ -(!‘(𝐴 + 1))))) ≤ 𝐿 ∧ 𝐿 ≤ ((𝐻‘𝐴) + (2 · (2↑ -(!‘(𝐴 + 1))))))))
89	84, 87, 88	mpbir2and 726	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))
90	68, 89	jca 521	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ ((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))) → ((𝐻‘𝐴) ≠ 𝐿 ∧ (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))
91	90	ex 418	. . 3 ⊢ (𝐴 ∈ ℕ → (((𝐿 − (𝐻‘𝐴)) ∈ ℝ⁺ ∧ (𝐿 − (𝐻‘𝐴)) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))) → ((𝐻‘𝐴) ≠ 𝐿 ∧ (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))))
92	62, 91	sylbid 243	. 2 ⊢ (𝐴 ∈ ℕ → ((Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ∈ ℝ⁺ ∧ Σ𝑏 ∈ (ℤ_≥‘(𝐴 + 1))(𝐹‘𝑏) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))) → ((𝐻‘𝐴) ≠ 𝐿 ∧ (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1)))))))
93	6, 92	mpd 16	1 ⊢ (𝐴 ∈ ℕ → ((𝐻‘𝐴) ≠ 𝐿 ∧ (abs‘(𝐿 − (𝐻‘𝐴))) ≤ (2 · (2↑ -(!‘(𝐴 + 1))))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ↦ cmpt 5192 dom cdm 5658 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 1c1 11240 + caddc 11242 · cmul 11244 < clt 11382 ≤ cle 11383 − cmin 11580 -cneg 11581 / cdiv 12013 ℕcn 12375 2c2 12437 ℕ₀cn0 12646 ℤcz 12733 ℤ_≥cuz 13005 ℝ⁺crp 13160 ...cfz 13679 seqcseq 14184 ↑cexp 14244 !cfa 14458 abscabs 15444 ⇝ cli 15695 Σcsu 15897

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-ioc 13521 df-ico 13522 df-fz 13680 df-fzo 13829 df-fl 13972 df-seq 14185 df-exp 14245 df-fac 14459 df-hash 14516 df-shft 15263 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-limsup 15682 df-clim 15699 df-rlim 15700 df-sum 15898

This theorem is used by: aaliou3lem9 26734

W3C validator