| Intuitionistic Logic Explorer Theorem List (p. 109 of 168) | < Previous Next > | |
| Bad symbols? Try the
GIF version. |
||
|
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Theorem | ser0 10801 | The value of the partial sums in a zero-valued infinite series. (Contributed by Mario Carneiro, 31-Aug-2013.) (Revised by Mario Carneiro, 15-Dec-2014.) |
| ⊢ 𝑍 = (ℤ≥‘𝑀) ⇒ ⊢ (𝑁 ∈ 𝑍 → (seq𝑀( + , (𝑍 × {0}))‘𝑁) = 0) | ||
| Theorem | ser0f 10802 | A zero-valued infinite series is equal to the constant zero function. (Contributed by Mario Carneiro, 8-Feb-2014.) |
| ⊢ 𝑍 = (ℤ≥‘𝑀) ⇒ ⊢ (𝑀 ∈ ℤ → seq𝑀( + , (𝑍 × {0})) = (𝑍 × {0})) | ||
| Theorem | fser0const 10803* | Simplifying an expression which turns out just to be a constant zero sequence. (Contributed by Jim Kingdon, 16-Sep-2022.) |
| ⊢ 𝑍 = (ℤ≥‘𝑀) ⇒ ⊢ (𝑁 ∈ 𝑍 → (𝑛 ∈ 𝑍 ↦ if(𝑛 ≤ 𝑁, ((𝑍 × {0})‘𝑛), 0)) = (𝑍 × {0})) | ||
| Theorem | ser3ge0 10804* | A finite sum of nonnegative terms is nonnegative. (Contributed by Mario Carneiro, 8-Feb-2014.) (Revised by Mario Carneiro, 27-May-2014.) |
| ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) & ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℝ) & ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ≤ (𝐹‘𝑘)) ⇒ ⊢ (𝜑 → 0 ≤ (seq𝑀( + , 𝐹)‘𝑁)) | ||
| Theorem | ser3le 10805* | Comparison of partial sums of two infinite series of reals. (Contributed by NM, 27-Dec-2005.) (Revised by Jim Kingdon, 23-Apr-2023.) |
| ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) & ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ∈ ℝ) & ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑘) ∈ ℝ) & ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑀)) → (𝐹‘𝑘) ≤ (𝐺‘𝑘)) ⇒ ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁)) | ||
| Syntax | cexp 10806 | Extend class notation to include exponentiation of a complex number to an integer power. |
| class ↑ | ||
| Definition | df-exp 10807* |
Define exponentiation to nonnegative integer powers. For example,
(5↑2) = 25 (see ex-exp 16380).
This definition is not meant to be used directly; instead, exp0 10811 and expp1 10814 provide the standard recursive definition. The up-arrow notation is used by Donald Knuth for iterated exponentiation (Science 194, 1235-1242, 1976) and is convenient for us since we don't have superscripts. 10-Jun-2005: The definition was extended to include zero exponents, so that 0↑0 = 1 per the convention of Definition 10-4.1 of [Gleason] p. 134 (see 0exp0e1 10812). 4-Jun-2014: The definition was extended to include negative integer exponents. For example, (-3↑-2) = (1 / 9) (ex-exp 16380). The case 𝑥 = 0, 𝑦 < 0 gives the value (1 / 0), so we will avoid this case in our theorems. (Contributed by Raph Levien, 20-May-2004.) (Revised by NM, 15-Oct-2004.) |
| ⊢ ↑ = (𝑥 ∈ ℂ, 𝑦 ∈ ℤ ↦ if(𝑦 = 0, 1, if(0 < 𝑦, (seq1( · , (ℕ × {𝑥}))‘𝑦), (1 / (seq1( · , (ℕ × {𝑥}))‘-𝑦))))) | ||
| Theorem | exp3vallem 10808 | Lemma for exp3val 10809. If we take a complex number apart from zero and raise it to a positive integer power, the result is apart from zero. (Contributed by Jim Kingdon, 7-Jun-2020.) |
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 0) & ⊢ (𝜑 → 𝑁 ∈ ℕ) ⇒ ⊢ (𝜑 → (seq1( · , (ℕ × {𝐴}))‘𝑁) # 0) | ||
| Theorem | exp3val 10809 | Value of exponentiation to integer powers. (Contributed by Jim Kingdon, 7-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℤ ∧ (𝐴 # 0 ∨ 0 ≤ 𝑁)) → (𝐴↑𝑁) = if(𝑁 = 0, 1, if(0 < 𝑁, (seq1( · , (ℕ × {𝐴}))‘𝑁), (1 / (seq1( · , (ℕ × {𝐴}))‘-𝑁))))) | ||
| Theorem | expnnval 10810 | Value of exponentiation to positive integer powers. (Contributed by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) | ||
| Theorem | exp0 10811 | Value of a complex number raised to the 0th power. Note that under our definition, 0↑0 = 1 (0exp0e1 10812) , following the convention used by Gleason. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2004.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) | ||
| Theorem | 0exp0e1 10812 | The zeroth power of zero equals one. See comment of exp0 10811. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (0↑0) = 1 | ||
| Theorem | exp1 10813 | Value of a complex number raised to the first power. (Contributed by NM, 20-Oct-2004.) (Revised by Mario Carneiro, 2-Jul-2013.) |
| ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | ||
| Theorem | expp1 10814 | Value of a complex number raised to a nonnegative integer power plus one. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2005.) (Revised by Mario Carneiro, 2-Jul-2013.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) | ||
| Theorem | expnegap0 10815 | Value of a complex number raised to a negative integer power. (Contributed by Jim Kingdon, 8-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℕ0) → (𝐴↑-𝑁) = (1 / (𝐴↑𝑁))) | ||
| Theorem | expineg2 10816 | Value of a complex number raised to a negative integer power. (Contributed by Jim Kingdon, 8-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0)) → (𝐴↑𝑁) = (1 / (𝐴↑-𝑁))) | ||
| Theorem | expn1ap0 10817 | A number to the negative one power is the reciprocal. (Contributed by Jim Kingdon, 8-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴↑-1) = (1 / 𝐴)) | ||
| Theorem | expcllem 10818* | Lemma for proving nonnegative integer exponentiation closure laws. (Contributed by NM, 14-Dec-2005.) |
| ⊢ 𝐹 ⊆ ℂ & ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 · 𝑦) ∈ 𝐹) & ⊢ 1 ∈ 𝐹 ⇒ ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ ℕ0) → (𝐴↑𝐵) ∈ 𝐹) | ||
| Theorem | expcl2lemap 10819* | Lemma for proving integer exponentiation closure laws. (Contributed by Jim Kingdon, 8-Jun-2020.) |
| ⊢ 𝐹 ⊆ ℂ & ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 · 𝑦) ∈ 𝐹) & ⊢ 1 ∈ 𝐹 & ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑥 # 0) → (1 / 𝑥) ∈ 𝐹) ⇒ ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐴 # 0 ∧ 𝐵 ∈ ℤ) → (𝐴↑𝐵) ∈ 𝐹) | ||
| Theorem | nnexpcl 10820 | Closure of exponentiation of nonnegative integers. (Contributed by NM, 16-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℕ) | ||
| Theorem | nn0expcl 10821 | Closure of exponentiation of nonnegative integers. (Contributed by NM, 14-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℕ0) | ||
| Theorem | zexpcl 10822 | Closure of exponentiation of integers. (Contributed by NM, 16-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℤ) | ||
| Theorem | qexpcl 10823 | Closure of exponentiation of rationals. (Contributed by NM, 16-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℚ) | ||
| Theorem | reexpcl 10824 | Closure of exponentiation of reals. (Contributed by NM, 14-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℝ) | ||
| Theorem | expcl 10825 | Closure law for nonnegative integer exponentiation. (Contributed by NM, 26-May-2005.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℂ) | ||
| Theorem | rpexpcl 10826 | Closure law for exponentiation of positive reals. (Contributed by NM, 24-Feb-2008.) (Revised by Mario Carneiro, 9-Sep-2014.) |
| ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ+) | ||
| Theorem | reexpclzap 10827 | Closure of exponentiation of reals. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ) | ||
| Theorem | qexpclz 10828 | Closure of exponentiation of rational numbers. (Contributed by Mario Carneiro, 9-Sep-2014.) |
| ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) | ||
| Theorem | m1expcl2 10829 | Closure of exponentiation of negative one. (Contributed by Mario Carneiro, 18-Jun-2015.) |
| ⊢ (𝑁 ∈ ℤ → (-1↑𝑁) ∈ {-1, 1}) | ||
| Theorem | m1expcl 10830 | Closure of exponentiation of negative one. (Contributed by Mario Carneiro, 18-Jun-2015.) |
| ⊢ (𝑁 ∈ ℤ → (-1↑𝑁) ∈ ℤ) | ||
| Theorem | expclzaplem 10831* | Closure law for integer exponentiation. Lemma for expclzap 10832 and expap0i 10839. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) | ||
| Theorem | expclzap 10832 | Closure law for integer exponentiation. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ) | ||
| Theorem | nn0expcli 10833 | Closure of exponentiation of nonnegative integers. (Contributed by Mario Carneiro, 17-Apr-2015.) |
| ⊢ 𝐴 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝐴↑𝑁) ∈ ℕ0 | ||
| Theorem | nn0sqcl 10834 | The square of a nonnegative integer is a nonnegative integer. (Contributed by Stefan O'Rear, 16-Oct-2014.) |
| ⊢ (𝐴 ∈ ℕ0 → (𝐴↑2) ∈ ℕ0) | ||
| Theorem | expm1t 10835 | Exponentiation in terms of predecessor exponent. (Contributed by NM, 19-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = ((𝐴↑(𝑁 − 1)) · 𝐴)) | ||
| Theorem | 1exp 10836 | Value of one raised to a nonnegative integer power. (Contributed by NM, 15-Dec-2005.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ (𝑁 ∈ ℤ → (1↑𝑁) = 1) | ||
| Theorem | expap0 10837 | Positive integer exponentiation is apart from zero iff its base is apart from zero. That it is easier to prove this first, and then prove expeq0 10838 in terms of it, rather than the other way around, is perhaps an illustration of the maxim "In constructive analysis, the apartness is more basic [ than ] equality." (Remark of [Geuvers], p. 1). (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) # 0 ↔ 𝐴 # 0)) | ||
| Theorem | expeq0 10838 | Positive integer exponentiation is 0 iff its base is 0. (Contributed by NM, 23-Feb-2005.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) = 0 ↔ 𝐴 = 0)) | ||
| Theorem | expap0i 10839 | Integer exponentiation is apart from zero if its base is apart from zero. (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) # 0) | ||
| Theorem | expgt0 10840 | A positive real raised to an integer power is positive. (Contributed by NM, 16-Dec-2005.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 0 < 𝐴) → 0 < (𝐴↑𝑁)) | ||
| Theorem | expnegzap 10841 | Value of a complex number raised to a negative power. (Contributed by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑-𝑁) = (1 / (𝐴↑𝑁))) | ||
| Theorem | 0exp 10842 | Value of zero raised to a positive integer power. (Contributed by NM, 19-Aug-2004.) |
| ⊢ (𝑁 ∈ ℕ → (0↑𝑁) = 0) | ||
| Theorem | expge0 10843 | A nonnegative real raised to a nonnegative integer is nonnegative. (Contributed by NM, 16-Dec-2005.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0 ∧ 0 ≤ 𝐴) → 0 ≤ (𝐴↑𝑁)) | ||
| Theorem | expge1 10844 | A real greater than or equal to 1 raised to a nonnegative integer is greater than or equal to 1. (Contributed by NM, 21-Feb-2005.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0 ∧ 1 ≤ 𝐴) → 1 ≤ (𝐴↑𝑁)) | ||
| Theorem | expgt1 10845 | A real greater than 1 raised to a positive integer is greater than 1. (Contributed by NM, 13-Feb-2005.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ ∧ 1 < 𝐴) → 1 < (𝐴↑𝑁)) | ||
| Theorem | mulexp 10846 | Nonnegative integer exponentiation of a product. Proposition 10-4.2(c) of [Gleason] p. 135, restricted to nonnegative integer exponents. (Contributed by NM, 13-Feb-2005.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝐴 · 𝐵)↑𝑁) = ((𝐴↑𝑁) · (𝐵↑𝑁))) | ||
| Theorem | mulexpzap 10847 | Integer exponentiation of a product. (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝑁 ∈ ℤ) → ((𝐴 · 𝐵)↑𝑁) = ((𝐴↑𝑁) · (𝐵↑𝑁))) | ||
| Theorem | exprecap 10848 | Integer exponentiation of a reciprocal. (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → ((1 / 𝐴)↑𝑁) = (1 / (𝐴↑𝑁))) | ||
| Theorem | expadd 10849 | Sum of exponents law for nonnegative integer exponentiation. Proposition 10-4.2(a) of [Gleason] p. 135. (Contributed by NM, 30-Nov-2004.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑀 + 𝑁)) = ((𝐴↑𝑀) · (𝐴↑𝑁))) | ||
| Theorem | expaddzaplem 10850 | Lemma for expaddzap 10851. (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℝ ∧ -𝑀 ∈ ℕ) ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑀 + 𝑁)) = ((𝐴↑𝑀) · (𝐴↑𝑁))) | ||
| Theorem | expaddzap 10851 | Sum of exponents law for integer exponentiation. (Contributed by Jim Kingdon, 10-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 + 𝑁)) = ((𝐴↑𝑀) · (𝐴↑𝑁))) | ||
| Theorem | expmul 10852 | Product of exponents law for nonnegative integer exponentiation. Proposition 10-4.2(b) of [Gleason] p. 135, restricted to nonnegative integer exponents. (Contributed by NM, 4-Jan-2006.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑀 · 𝑁)) = ((𝐴↑𝑀)↑𝑁)) | ||
| Theorem | expmulzap 10853 | Product of exponents law for integer exponentiation. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 · 𝑁)) = ((𝐴↑𝑀)↑𝑁)) | ||
| Theorem | m1expeven 10854 | Exponentiation of negative one to an even power. (Contributed by Scott Fenton, 17-Jan-2018.) |
| ⊢ (𝑁 ∈ ℤ → (-1↑(2 · 𝑁)) = 1) | ||
| Theorem | expsubap 10855 | Exponent subtraction law for integer exponentiation. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 − 𝑁)) = ((𝐴↑𝑀) / (𝐴↑𝑁))) | ||
| Theorem | expp1zap 10856 | Value of a nonzero complex number raised to an integer power plus one. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) | ||
| Theorem | expm1ap 10857 | Value of a complex number raised to an integer power minus one. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑(𝑁 − 1)) = ((𝐴↑𝑁) / 𝐴)) | ||
| Theorem | expdivap 10858 | Nonnegative integer exponentiation of a quotient. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝑁 ∈ ℕ0) → ((𝐴 / 𝐵)↑𝑁) = ((𝐴↑𝑁) / (𝐵↑𝑁))) | ||
| Theorem | ltexp2a 10859 | Ordering relationship for exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 4-Jun-2014.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) < (𝐴↑𝑁)) | ||
| Theorem | leexp2a 10860 | Weak ordering relationship for exponentiation. (Contributed by NM, 14-Dec-2005.) (Revised by Mario Carneiro, 5-Jun-2014.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) | ||
| Theorem | leexp2r 10861 | Weak ordering relationship for exponentiation. (Contributed by Paul Chapman, 14-Jan-2008.) (Revised by Mario Carneiro, 29-Apr-2014.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) ∧ (0 ≤ 𝐴 ∧ 𝐴 ≤ 1)) → (𝐴↑𝑁) ≤ (𝐴↑𝑀)) | ||
| Theorem | leexp1a 10862 | Weak base ordering relationship for exponentiation. (Contributed by NM, 18-Dec-2005.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑁 ∈ ℕ0) ∧ (0 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)) → (𝐴↑𝑁) ≤ (𝐵↑𝑁)) | ||
| Theorem | exple1 10863 | A real between 0 and 1 inclusive raised to a nonnegative integer is less than or equal to 1. (Contributed by Paul Chapman, 29-Dec-2007.) (Revised by Mario Carneiro, 5-Jun-2014.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴 ∧ 𝐴 ≤ 1) ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ≤ 1) | ||
| Theorem | expubnd 10864 | An upper bound on 𝐴↑𝑁 when 2 ≤ 𝐴. (Contributed by NM, 19-Dec-2005.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0 ∧ 2 ≤ 𝐴) → (𝐴↑𝑁) ≤ ((2↑𝑁) · ((𝐴 − 1)↑𝑁))) | ||
| Theorem | sqval 10865 | Value of the square of a complex number. (Contributed by Raph Levien, 10-Apr-2004.) |
| ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴)) | ||
| Theorem | sqneg 10866 | The square of the negative of a number.) (Contributed by NM, 15-Jan-2006.) |
| ⊢ (𝐴 ∈ ℂ → (-𝐴↑2) = (𝐴↑2)) | ||
| Theorem | sqsubswap 10867 | Swap the order of subtraction in a square. (Contributed by Scott Fenton, 10-Jun-2013.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵)↑2) = ((𝐵 − 𝐴)↑2)) | ||
| Theorem | sqcl 10868 | Closure of square. (Contributed by NM, 10-Aug-1999.) |
| ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | ||
| Theorem | sqmul 10869 | Distribution of square over multiplication. (Contributed by NM, 21-Mar-2008.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵)↑2) = ((𝐴↑2) · (𝐵↑2))) | ||
| Theorem | sqeq0 10870 | A number is zero iff its square is zero. (Contributed by NM, 11-Mar-2006.) |
| ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 0 ↔ 𝐴 = 0)) | ||
| Theorem | sqdivap 10871 | Distribution of square over division. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵)↑2) = ((𝐴↑2) / (𝐵↑2))) | ||
| Theorem | sqdividap 10872 | The square of a complex number apart from zero divided by itself equals that number. (Contributed by AV, 19-Jul-2021.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → ((𝐴↑2) / 𝐴) = 𝐴) | ||
| Theorem | sqne0 10873 | A number is nonzero iff its square is nonzero. See also sqap0 10874 which is the same but with not equal changed to apart. (Contributed by NM, 11-Mar-2006.) |
| ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) ≠ 0 ↔ 𝐴 ≠ 0)) | ||
| Theorem | sqap0 10874 | A number is apart from zero iff its square is apart from zero. (Contributed by Jim Kingdon, 13-Aug-2021.) |
| ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) # 0 ↔ 𝐴 # 0)) | ||
| Theorem | resqcl 10875 | Closure of the square of a real number. (Contributed by NM, 18-Oct-1999.) |
| ⊢ (𝐴 ∈ ℝ → (𝐴↑2) ∈ ℝ) | ||
| Theorem | sqgt0ap 10876 | The square of a nonzero real is positive. (Contributed by Jim Kingdon, 11-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → 0 < (𝐴↑2)) | ||
| Theorem | nnsqcl 10877 | The naturals are closed under squaring. (Contributed by Scott Fenton, 29-Mar-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
| ⊢ (𝐴 ∈ ℕ → (𝐴↑2) ∈ ℕ) | ||
| Theorem | zsqcl 10878 | Integers are closed under squaring. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
| ⊢ (𝐴 ∈ ℤ → (𝐴↑2) ∈ ℤ) | ||
| Theorem | qsqcl 10879 | The square of a rational is rational. (Contributed by Stefan O'Rear, 15-Sep-2014.) |
| ⊢ (𝐴 ∈ ℚ → (𝐴↑2) ∈ ℚ) | ||
| Theorem | sq11 10880 | The square function is one-to-one for nonnegative reals. Also see sq11ap 10975 which would easily follow from this given excluded middle, but which for us is proved another way. (Contributed by NM, 8-Apr-2001.) (Proof shortened by Mario Carneiro, 28-May-2016.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵)) | ||
| Theorem | lt2sq 10881 | The square function on nonnegative reals is strictly monotonic. (Contributed by NM, 24-Feb-2006.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 < 𝐵 ↔ (𝐴↑2) < (𝐵↑2))) | ||
| Theorem | le2sq 10882 | The square function on nonnegative reals is monotonic. (Contributed by NM, 18-Oct-1999.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 ≤ 𝐵 ↔ (𝐴↑2) ≤ (𝐵↑2))) | ||
| Theorem | le2sq2 10883 | The square of a 'less than or equal to' ordering. (Contributed by NM, 21-Mar-2008.) |
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵)) → (𝐴↑2) ≤ (𝐵↑2)) | ||
| Theorem | sqge0 10884 | A square of a real is nonnegative. (Contributed by NM, 18-Oct-1999.) |
| ⊢ (𝐴 ∈ ℝ → 0 ≤ (𝐴↑2)) | ||
| Theorem | zsqcl2 10885 | The square of an integer is a nonnegative integer. (Contributed by Mario Carneiro, 18-Apr-2014.) (Revised by Mario Carneiro, 14-Jul-2014.) |
| ⊢ (𝐴 ∈ ℤ → (𝐴↑2) ∈ ℕ0) | ||
| Theorem | sumsqeq0 10886 | Two real numbers are equal to 0 iff their Euclidean norm is. (Contributed by NM, 29-Apr-2005.) (Revised by Stefan O'Rear, 5-Oct-2014.) (Proof shortened by Mario Carneiro, 28-May-2016.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 = 0 ∧ 𝐵 = 0) ↔ ((𝐴↑2) + (𝐵↑2)) = 0)) | ||
| Theorem | sqvali 10887 | Value of square. Inference version. (Contributed by NM, 1-Aug-1999.) |
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (𝐴↑2) = (𝐴 · 𝐴) | ||
| Theorem | sqcli 10888 | Closure of square. (Contributed by NM, 2-Aug-1999.) |
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (𝐴↑2) ∈ ℂ | ||
| Theorem | sqeq0i 10889 | A number is zero iff its square is zero. (Contributed by NM, 2-Oct-1999.) |
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ ((𝐴↑2) = 0 ↔ 𝐴 = 0) | ||
| Theorem | sqmuli 10890 | Distribution of square over multiplication. (Contributed by NM, 3-Sep-1999.) |
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ ⇒ ⊢ ((𝐴 · 𝐵)↑2) = ((𝐴↑2) · (𝐵↑2)) | ||
| Theorem | sqdivapi 10891 | Distribution of square over division. (Contributed by Jim Kingdon, 12-Jun-2020.) |
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐵 # 0 ⇒ ⊢ ((𝐴 / 𝐵)↑2) = ((𝐴↑2) / (𝐵↑2)) | ||
| Theorem | resqcli 10892 | Closure of square in reals. (Contributed by NM, 2-Aug-1999.) |
| ⊢ 𝐴 ∈ ℝ ⇒ ⊢ (𝐴↑2) ∈ ℝ | ||
| Theorem | sqgt0api 10893 | The square of a nonzero real is positive. (Contributed by Jim Kingdon, 12-Jun-2020.) |
| ⊢ 𝐴 ∈ ℝ ⇒ ⊢ (𝐴 # 0 → 0 < (𝐴↑2)) | ||
| Theorem | sqge0i 10894 | A square of a real is nonnegative. (Contributed by NM, 3-Aug-1999.) |
| ⊢ 𝐴 ∈ ℝ ⇒ ⊢ 0 ≤ (𝐴↑2) | ||
| Theorem | lt2sqi 10895 | The square function on nonnegative reals is strictly monotonic. (Contributed by NM, 12-Sep-1999.) |
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 < 𝐵 ↔ (𝐴↑2) < (𝐵↑2))) | ||
| Theorem | le2sqi 10896 | The square function on nonnegative reals is monotonic. (Contributed by NM, 12-Sep-1999.) |
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 ≤ 𝐵 ↔ (𝐴↑2) ≤ (𝐵↑2))) | ||
| Theorem | sq11i 10897 | The square function is one-to-one for nonnegative reals. (Contributed by NM, 27-Oct-1999.) |
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵)) | ||
| Theorem | sq0 10898 | The square of 0 is 0. (Contributed by NM, 6-Jun-2006.) |
| ⊢ (0↑2) = 0 | ||
| Theorem | sq0i 10899 | If a number is zero, its square is zero. (Contributed by FL, 10-Dec-2006.) |
| ⊢ (𝐴 = 0 → (𝐴↑2) = 0) | ||
| Theorem | sq0id 10900 | If a number is zero, its square is zero. Deduction form of sq0i 10899. Converse of sqeq0d 10940. (Contributed by David Moews, 28-Feb-2017.) |
| ⊢ (𝜑 → 𝐴 = 0) ⇒ ⊢ (𝜑 → (𝐴↑2) = 0) | ||
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |