Metamath Proof Explorer


Theorem bernneq

Description: Bernoulli's inequality, due to Johan Bernoulli (1667-1748). (Contributed by NM, 21-Feb-2005)

Ref Expression
Assertion bernneq ⊢ A ∈ ℝ ∧ N ∈ ℕ 0 ∧ − 1 ≤ A → 1 + A ⋅ N ≤ 1 + A N

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ j = 0 → A ⁢ j = A ⋅ 0
2 1 oveq2d ⊢ j = 0 → 1 + A ⁢ j = 1 + A ⋅ 0
3 oveq2 ⊢ j = 0 → 1 + A j = 1 + A 0
4 2 3 breq12d ⊢ j = 0 → 1 + A ⁢ j ≤ 1 + A j ↔ 1 + A ⋅ 0 ≤ 1 + A 0
5 4 imbi2d ⊢ j = 0 → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ j ≤ 1 + A j ↔ A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⋅ 0 ≤ 1 + A 0
6 oveq2 ⊢ j = k → A ⁢ j = A ⁢ k
7 6 oveq2d ⊢ j = k → 1 + A ⁢ j = 1 + A ⁢ k
8 oveq2 ⊢ j = k → 1 + A j = 1 + A k
9 7 8 breq12d ⊢ j = k → 1 + A ⁢ j ≤ 1 + A j ↔ 1 + A ⁢ k ≤ 1 + A k
10 9 imbi2d ⊢ j = k → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ j ≤ 1 + A j ↔ A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ k ≤ 1 + A k
11 oveq2 ⊢ j = k + 1 → A ⁢ j = A ⁢ k + 1
12 11 oveq2d ⊢ j = k + 1 → 1 + A ⁢ j = 1 + A ⁢ k + 1
13 oveq2 ⊢ j = k + 1 → 1 + A j = 1 + A k + 1
14 12 13 breq12d ⊢ j = k + 1 → 1 + A ⁢ j ≤ 1 + A j ↔ 1 + A ⁢ k + 1 ≤ 1 + A k + 1
15 14 imbi2d ⊢ j = k + 1 → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ j ≤ 1 + A j ↔ A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
16 oveq2 ⊢ j = N → A ⁢ j = A ⋅ N
17 16 oveq2d ⊢ j = N → 1 + A ⁢ j = 1 + A ⋅ N
18 oveq2 ⊢ j = N → 1 + A j = 1 + A N
19 17 18 breq12d ⊢ j = N → 1 + A ⁢ j ≤ 1 + A j ↔ 1 + A ⋅ N ≤ 1 + A N
20 19 imbi2d ⊢ j = N → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ j ≤ 1 + A j ↔ A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⋅ N ≤ 1 + A N
21 recn ⊢ A ∈ ℝ → A ∈ ℂ
22 mul01 ⊢ A ∈ ℂ → A ⋅ 0 = 0
23 22 oveq2d ⊢ A ∈ ℂ → 1 + A ⋅ 0 = 1 + 0
24 1p0e1 ⊢ 1 + 0 = 1
25 23 24 eqtrdi ⊢ A ∈ ℂ → 1 + A ⋅ 0 = 1
26 1le1 ⊢ 1 ≤ 1
27 ax-1cn ⊢ 1 ∈ ℂ
28 addcl ⊢ 1 ∈ ℂ ∧ A ∈ ℂ → 1 + A ∈ ℂ
29 27 28 mpan ⊢ A ∈ ℂ → 1 + A ∈ ℂ
30 exp0 ⊢ 1 + A ∈ ℂ → 1 + A 0 = 1
31 29 30 syl ⊢ A ∈ ℂ → 1 + A 0 = 1
32 26 31 breqtrrid ⊢ A ∈ ℂ → 1 ≤ 1 + A 0
33 25 32 eqbrtrd ⊢ A ∈ ℂ → 1 + A ⋅ 0 ≤ 1 + A 0
34 21 33 syl ⊢ A ∈ ℝ → 1 + A ⋅ 0 ≤ 1 + A 0
35 34 adantr ⊢ A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⋅ 0 ≤ 1 + A 0
36 1re ⊢ 1 ∈ ℝ
37 nn0re ⊢ k ∈ ℕ 0 → k ∈ ℝ
38 remulcl ⊢ A ∈ ℝ ∧ k ∈ ℝ → A ⁢ k ∈ ℝ
39 37 38 sylan2 ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A ⁢ k ∈ ℝ
40 readdcl ⊢ 1 ∈ ℝ ∧ A ⁢ k ∈ ℝ → 1 + A ⁢ k ∈ ℝ
41 36 39 40 sylancr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k ∈ ℝ
42 simpl ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A ∈ ℝ
43 readdcl ⊢ 1 + A ⁢ k ∈ ℝ ∧ A ∈ ℝ → 1 + A ⁢ k + A ∈ ℝ
44 41 42 43 syl2anc ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k + A ∈ ℝ
45 44 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + A ∈ ℝ
46 readdcl ⊢ 1 ∈ ℝ ∧ A ∈ ℝ → 1 + A ∈ ℝ
47 36 46 mpan ⊢ A ∈ ℝ → 1 + A ∈ ℝ
48 47 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ∈ ℝ
49 41 48 remulcld ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k ⁢ 1 + A ∈ ℝ
50 49 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k ⁢ 1 + A ∈ ℝ
51 reexpcl ⊢ 1 + A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A k ∈ ℝ
52 47 51 sylan ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A k ∈ ℝ
53 52 48 remulcld ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A k ⁢ 1 + A ∈ ℝ
54 53 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A k ⁢ 1 + A ∈ ℝ
55 remulcl ⊢ A ∈ ℝ ∧ A ∈ ℝ → A ⁢ A ∈ ℝ
56 55 anidms ⊢ A ∈ ℝ → A ⁢ A ∈ ℝ
57 msqge0 ⊢ A ∈ ℝ → 0 ≤ A ⁢ A
58 56 57 jca ⊢ A ∈ ℝ → A ⁢ A ∈ ℝ ∧ 0 ≤ A ⁢ A
59 nn0ge0 ⊢ k ∈ ℕ 0 → 0 ≤ k
60 37 59 jca ⊢ k ∈ ℕ 0 → k ∈ ℝ ∧ 0 ≤ k
61 mulge0 ⊢ A ⁢ A ∈ ℝ ∧ 0 ≤ A ⁢ A ∧ k ∈ ℝ ∧ 0 ≤ k → 0 ≤ A ⁢ A ⁢ k
62 58 60 61 syl2an ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 0 ≤ A ⁢ A ⁢ k
63 21 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A ∈ ℂ
64 nn0cn ⊢ k ∈ ℕ 0 → k ∈ ℂ
65 64 adantl ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → k ∈ ℂ
66 63 63 65 mul32d ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A ⁢ A ⁢ k = A ⁢ k ⁢ A
67 62 66 breqtrd ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 0 ≤ A ⁢ k ⁢ A
68 simpl ⊢ A ∈ ℝ ∧ k ∈ ℝ → A ∈ ℝ
69 38 68 remulcld ⊢ A ∈ ℝ ∧ k ∈ ℝ → A ⁢ k ⁢ A ∈ ℝ
70 37 69 sylan2 ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A ⁢ k ⁢ A ∈ ℝ
71 44 70 addge01d ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 0 ≤ A ⁢ k ⁢ A ↔ 1 + A ⁢ k + A ≤ 1 + A ⁢ k + A + A ⁢ k ⁢ A
72 67 71 mpbid ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k + A ≤ 1 + A ⁢ k + A + A ⁢ k ⁢ A
73 mulcl ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⁢ k ∈ ℂ
74 addcl ⊢ 1 ∈ ℂ ∧ A ⁢ k ∈ ℂ → 1 + A ⁢ k ∈ ℂ
75 27 73 74 sylancr ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k ∈ ℂ
76 simpl ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ∈ ℂ
77 73 76 mulcld ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⁢ k ⁢ A ∈ ℂ
78 75 76 77 addassd ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k + A + A ⁢ k ⁢ A = 1 + A ⁢ k + A + A ⁢ k ⁢ A
79 muladd11 ⊢ A ⁢ k ∈ ℂ ∧ A ∈ ℂ → 1 + A ⁢ k ⁢ 1 + A = 1 + A ⁢ k + A + A ⁢ k ⁢ A
80 73 76 79 syl2anc ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k ⁢ 1 + A = 1 + A ⁢ k + A + A ⁢ k ⁢ A
81 78 80 eqtr4d ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k + A + A ⁢ k ⁢ A = 1 + A ⁢ k ⁢ 1 + A
82 21 64 81 syl2an ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k + A + A ⁢ k ⁢ A = 1 + A ⁢ k ⁢ 1 + A
83 72 82 breqtrd ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k + A ≤ 1 + A ⁢ k ⁢ 1 + A
84 83 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + A ≤ 1 + A ⁢ k ⁢ 1 + A
85 41 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k ∈ ℝ
86 52 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A k ∈ ℝ
87 48 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ∈ ℝ
88 neg1rr ⊢ − 1 ∈ ℝ
89 leadd2 ⊢ − 1 ∈ ℝ ∧ A ∈ ℝ ∧ 1 ∈ ℝ → − 1 ≤ A ↔ 1 + -1 ≤ 1 + A
90 88 36 89 mp3an13 ⊢ A ∈ ℝ → − 1 ≤ A ↔ 1 + -1 ≤ 1 + A
91 1pneg1e0 ⊢ 1 + -1 = 0
92 91 breq1i ⊢ 1 + -1 ≤ 1 + A ↔ 0 ≤ 1 + A
93 90 92 bitrdi ⊢ A ∈ ℝ → − 1 ≤ A ↔ 0 ≤ 1 + A
94 93 biimpa ⊢ A ∈ ℝ ∧ − 1 ≤ A → 0 ≤ 1 + A
95 94 ad2ant2r ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 0 ≤ 1 + A
96 simprr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k ≤ 1 + A k
97 85 86 87 95 96 lemul1ad ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k ⁢ 1 + A ≤ 1 + A k ⁢ 1 + A
98 45 50 54 84 97 letrd ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + A ≤ 1 + A k ⁢ 1 + A
99 adddi ⊢ A ∈ ℂ ∧ k ∈ ℂ ∧ 1 ∈ ℂ → A ⁢ k + 1 = A ⁢ k + A ⋅ 1
100 27 99 mp3an3 ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⁢ k + 1 = A ⁢ k + A ⋅ 1
101 mulrid ⊢ A ∈ ℂ → A ⋅ 1 = A
102 101 adantr ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⋅ 1 = A
103 102 oveq2d ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⁢ k + A ⋅ 1 = A ⁢ k + A
104 100 103 eqtrd ⊢ A ∈ ℂ ∧ k ∈ ℂ → A ⁢ k + 1 = A ⁢ k + A
105 104 oveq2d ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k + 1 = 1 + A ⁢ k + A
106 addass ⊢ 1 ∈ ℂ ∧ A ⁢ k ∈ ℂ ∧ A ∈ ℂ → 1 + A ⁢ k + A = 1 + A ⁢ k + A
107 27 73 76 106 mp3an2i ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k + A = 1 + A ⁢ k + A
108 105 107 eqtr4d ⊢ A ∈ ℂ ∧ k ∈ ℂ → 1 + A ⁢ k + 1 = 1 + A ⁢ k + A
109 21 64 108 syl2an ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A ⁢ k + 1 = 1 + A ⁢ k + A
110 109 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + 1 = 1 + A ⁢ k + A
111 27 21 28 sylancr ⊢ A ∈ ℝ → 1 + A ∈ ℂ
112 expp1 ⊢ 1 + A ∈ ℂ ∧ k ∈ ℕ 0 → 1 + A k + 1 = 1 + A k ⁢ 1 + A
113 111 112 sylan ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → 1 + A k + 1 = 1 + A k ⁢ 1 + A
114 113 adantr ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A k + 1 = 1 + A k ⁢ 1 + A
115 98 110 114 3brtr4d ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ − 1 ≤ A ∧ 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
116 115 exp43 ⊢ A ∈ ℝ → k ∈ ℕ 0 → − 1 ≤ A → 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
117 116 com12 ⊢ k ∈ ℕ 0 → A ∈ ℝ → − 1 ≤ A → 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
118 117 impd ⊢ k ∈ ℕ 0 → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ k ≤ 1 + A k → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
119 118 a2d ⊢ k ∈ ℕ 0 → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ k ≤ 1 + A k → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⁢ k + 1 ≤ 1 + A k + 1
120 5 10 15 20 35 119 nn0ind ⊢ N ∈ ℕ 0 → A ∈ ℝ ∧ − 1 ≤ A → 1 + A ⋅ N ≤ 1 + A N
121 120 expd ⊢ N ∈ ℕ 0 → A ∈ ℝ → − 1 ≤ A → 1 + A ⋅ N ≤ 1 + A N
122 121 3imp21 ⊢ A ∈ ℝ ∧ N ∈ ℕ 0 ∧ − 1 ≤ A → 1 + A ⋅ N ≤ 1 + A N