Metamath Proof Explorer


Theorem aaliou3lem3

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

Ref Expression
Hypotheses aaliou3lem.a ⊢ G = c ∈ ℤ ≥ A ⟼ 2 − A ! ⁢ 1 2 c − A
aaliou3lem.b ⊢ F = a ∈ ℕ ⟼ 2 − a !
Assertion aaliou3lem3 ⊢ A ∈ ℕ → seq A + F ∈ dom ⁡ ⇝ ∧ ∑ b ∈ ℤ ≥ A F ⁡ b ∈ ℝ + ∧ ∑ b ∈ ℤ ≥ A F ⁡ b ≤ 2 ⁢ 2 − A !

Proof

Step Hyp Ref Expression
1 aaliou3lem.a ⊢ G = c ∈ ℤ ≥ A ⟼ 2 − A ! ⁢ 1 2 c − A
2 aaliou3lem.b ⊢ F = a ∈ ℕ ⟼ 2 − a !
3 eqid ⊢ ℤ ≥ A = ℤ ≥ A
4 nnz ⊢ A ∈ ℕ → A ∈ ℤ
5 uzid ⊢ A ∈ ℤ → A ∈ ℤ ≥ A
6 4 5 syl ⊢ A ∈ ℕ → A ∈ ℤ ≥ A
7 1 aaliou3lem1 ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → G ⁡ b ∈ ℝ
8 1 2 aaliou3lem2 ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ∈ 0 G ⁡ b
9 0xr ⊢ 0 ∈ ℝ *
10 elioc2 ⊢ 0 ∈ ℝ * ∧ G ⁡ b ∈ ℝ → F ⁡ b ∈ 0 G ⁡ b ↔ F ⁡ b ∈ ℝ ∧ 0 < F ⁡ b ∧ F ⁡ b ≤ G ⁡ b
11 9 7 10 sylancr ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ∈ 0 G ⁡ b ↔ F ⁡ b ∈ ℝ ∧ 0 < F ⁡ b ∧ F ⁡ b ≤ G ⁡ b
12 8 11 mpbid ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ∈ ℝ ∧ 0 < F ⁡ b ∧ F ⁡ b ≤ G ⁡ b
13 12 simp1d ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ∈ ℝ
14 halfcn ⊢ 1 2 ∈ ℂ
15 14 a1i ⊢ A ∈ ℕ → 1 2 ∈ ℂ
16 halfre ⊢ 1 2 ∈ ℝ
17 halfgt0 ⊢ 0 < 1 2
18 16 17 elrpii ⊢ 1 2 ∈ ℝ +
19 rprege0 ⊢ 1 2 ∈ ℝ + → 1 2 ∈ ℝ ∧ 0 ≤ 1 2
20 absid ⊢ 1 2 ∈ ℝ ∧ 0 ≤ 1 2 → 1 2 = 1 2
21 18 19 20 mp2b ⊢ 1 2 = 1 2
22 halflt1 ⊢ 1 2 < 1
23 21 22 eqbrtri ⊢ 1 2 < 1
24 23 a1i ⊢ A ∈ ℕ → 1 2 < 1
25 2rp ⊢ 2 ∈ ℝ +
26 nnnn0 ⊢ A ∈ ℕ → A ∈ ℕ 0
27 26 faccld ⊢ A ∈ ℕ → A ! ∈ ℕ
28 27 nnzd ⊢ A ∈ ℕ → A ! ∈ ℤ
29 28 znegcld ⊢ A ∈ ℕ → − A ! ∈ ℤ
30 rpexpcl ⊢ 2 ∈ ℝ + ∧ − A ! ∈ ℤ → 2 − A ! ∈ ℝ +
31 25 29 30 sylancr ⊢ A ∈ ℕ → 2 − A ! ∈ ℝ +
32 31 rpcnd ⊢ A ∈ ℕ → 2 − A ! ∈ ℂ
33 4 15 24 32 1 geolim3 ⊢ A ∈ ℕ → seq A + G ⇝ 2 − A ! 1 − 1 2
34 seqex ⊢ seq A + G ∈ V
35 ovex ⊢ 2 − A ! 1 − 1 2 ∈ V
36 34 35 breldm ⊢ seq A + G ⇝ 2 − A ! 1 − 1 2 → seq A + G ∈ dom ⁡ ⇝
37 33 36 syl ⊢ A ∈ ℕ → seq A + G ∈ dom ⁡ ⇝
38 12 simp2d ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → 0 < F ⁡ b
39 13 38 elrpd ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ∈ ℝ +
40 39 rpge0d ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → 0 ≤ F ⁡ b
41 12 simp3d ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b ≤ G ⁡ b
42 3 6 7 13 37 40 41 cvgcmp ⊢ A ∈ ℕ → seq A + F ∈ dom ⁡ ⇝
43 eqidd ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → F ⁡ b = F ⁡ b
44 3 3 6 43 39 42 isumrpcl ⊢ A ∈ ℕ → ∑ b ∈ ℤ ≥ A F ⁡ b ∈ ℝ +
45 eqidd ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → G ⁡ b = G ⁡ b
46 3 4 43 13 45 7 41 42 37 isumle ⊢ A ∈ ℕ → ∑ b ∈ ℤ ≥ A F ⁡ b ≤ ∑ b ∈ ℤ ≥ A G ⁡ b
47 7 recnd ⊢ A ∈ ℕ ∧ b ∈ ℤ ≥ A → G ⁡ b ∈ ℂ
48 3 4 45 47 33 isumclim ⊢ A ∈ ℕ → ∑ b ∈ ℤ ≥ A G ⁡ b = 2 − A ! 1 − 1 2
49 1mhlfehlf ⊢ 1 − 1 2 = 1 2
50 49 oveq2i ⊢ 2 − A ! 1 − 1 2 = 2 − A ! 1 2
51 2cn ⊢ 2 ∈ ℂ
52 mulcl ⊢ 2 − A ! ∈ ℂ ∧ 2 ∈ ℂ → 2 − A ! ⋅ 2 ∈ ℂ
53 32 51 52 sylancl ⊢ A ∈ ℕ → 2 − A ! ⋅ 2 ∈ ℂ
54 53 div1d ⊢ A ∈ ℕ → 2 − A ! ⋅ 2 1 = 2 − A ! ⋅ 2
55 1rp ⊢ 1 ∈ ℝ +
56 rpcnne0 ⊢ 1 ∈ ℝ + → 1 ∈ ℂ ∧ 1 ≠ 0
57 55 56 ax-mp ⊢ 1 ∈ ℂ ∧ 1 ≠ 0
58 2cnne0 ⊢ 2 ∈ ℂ ∧ 2 ≠ 0
59 divdiv2 ⊢ 2 − A ! ∈ ℂ ∧ 1 ∈ ℂ ∧ 1 ≠ 0 ∧ 2 ∈ ℂ ∧ 2 ≠ 0 → 2 − A ! 1 2 = 2 − A ! ⋅ 2 1
60 57 58 59 mp3an23 ⊢ 2 − A ! ∈ ℂ → 2 − A ! 1 2 = 2 − A ! ⋅ 2 1
61 32 60 syl ⊢ A ∈ ℕ → 2 − A ! 1 2 = 2 − A ! ⋅ 2 1
62 mulcom ⊢ 2 ∈ ℂ ∧ 2 − A ! ∈ ℂ → 2 ⁢ 2 − A ! = 2 − A ! ⋅ 2
63 51 32 62 sylancr ⊢ A ∈ ℕ → 2 ⁢ 2 − A ! = 2 − A ! ⋅ 2
64 54 61 63 3eqtr4d ⊢ A ∈ ℕ → 2 − A ! 1 2 = 2 ⁢ 2 − A !
65 50 64 eqtrid ⊢ A ∈ ℕ → 2 − A ! 1 − 1 2 = 2 ⁢ 2 − A !
66 48 65 eqtrd ⊢ A ∈ ℕ → ∑ b ∈ ℤ ≥ A G ⁡ b = 2 ⁢ 2 − A !
67 46 66 breqtrd ⊢ A ∈ ℕ → ∑ b ∈ ℤ ≥ A F ⁡ b ≤ 2 ⁢ 2 − A !
68 42 44 67 3jca ⊢ A ∈ ℕ → seq A + F ∈ dom ⁡ ⇝ ∧ ∑ b ∈ ℤ ≥ A F ⁡ b ∈ ℝ + ∧ ∑ b ∈ ℤ ≥ A F ⁡ b ≤ 2 ⁢ 2 − A !