Theorem List for Intuitionistic Logic Explorer - 11001-11100 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | expnnval 11001 |
Value of exponentiation to positive integer powers. (Contributed by Mario
Carneiro, 4-Jun-2014.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ ×
{𝐴}))‘𝑁)) |
| |
| Theorem | exp0 11002 |
Value of a complex number raised to the 0th power. Note that under our
definition, 0↑0 = 1 (0exp0e1 11003) , 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 11003 |
The zeroth power of zero equals one. See comment of exp0 11002.
(Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (0↑0) = 1 |
| |
| Theorem | exp1 11004 |
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 11005 |
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 11006 |
Value of a complex number raised to a negative integer power.
(Contributed by Jim Kingdon, 8-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℕ0) → (𝐴↑ -𝑁) = (1 / (𝐴↑𝑁))) |
| |
| Theorem | expineg2 11007 |
Value of a complex number raised to a negative integer power.
(Contributed by Jim Kingdon, 8-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑁 ∈ ℂ ∧ -𝑁 ∈ ℕ0)) → (𝐴↑𝑁) = (1 / (𝐴↑ -𝑁))) |
| |
| Theorem | expn1ap0 11008 |
A number to the negative one power is the reciprocal. (Contributed by Jim
Kingdon, 8-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴↑ -1) = (1 / 𝐴)) |
| |
| Theorem | expcllem 11009* |
Lemma for proving nonnegative integer exponentiation closure laws.
(Contributed by NM, 14-Dec-2005.)
|
| ⊢ 𝐹 ⊆ ℂ & ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 · 𝑦) ∈ 𝐹)
& ⊢ 1 ∈ 𝐹 ⇒ ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐵 ∈ ℕ0) → (𝐴↑𝐵) ∈ 𝐹) |
| |
| Theorem | expcl2lemap 11010* |
Lemma for proving integer exponentiation closure laws. (Contributed by
Jim Kingdon, 8-Jun-2020.)
|
| ⊢ 𝐹 ⊆ ℂ & ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 · 𝑦) ∈ 𝐹)
& ⊢ 1 ∈ 𝐹
& ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑥 # 0) → (1 / 𝑥) ∈ 𝐹) ⇒ ⊢ ((𝐴 ∈ 𝐹 ∧ 𝐴 # 0 ∧ 𝐵 ∈ ℤ) → (𝐴↑𝐵) ∈ 𝐹) |
| |
| Theorem | nnexpcl 11011 |
Closure of exponentiation of nonnegative integers. (Contributed by NM,
16-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℕ) |
| |
| Theorem | nn0expcl 11012 |
Closure of exponentiation of nonnegative integers. (Contributed by NM,
14-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0)
→ (𝐴↑𝑁) ∈
ℕ0) |
| |
| Theorem | zexpcl 11013 |
Closure of exponentiation of integers. (Contributed by NM,
16-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℤ) |
| |
| Theorem | qexpcl 11014 |
Closure of exponentiation of rationals. (Contributed by NM,
16-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℚ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℚ) |
| |
| Theorem | reexpcl 11015 |
Closure of exponentiation of reals. (Contributed by NM,
14-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℝ) |
| |
| Theorem | expcl 11016 |
Closure law for nonnegative integer exponentiation. (Contributed by NM,
26-May-2005.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑𝑁) ∈ ℂ) |
| |
| Theorem | rpexpcl 11017 |
Closure law for exponentiation of positive reals. (Contributed by NM,
24-Feb-2008.) (Revised by Mario Carneiro, 9-Sep-2014.)
|
| ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈
ℝ+) |
| |
| Theorem | reexpclzap 11018 |
Closure of exponentiation of reals. (Contributed by Jim Kingdon,
9-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ) |
| |
| Theorem | qexpclz 11019 |
Closure of exponentiation of rational numbers. (Contributed by Mario
Carneiro, 9-Sep-2014.)
|
| ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℚ) |
| |
| Theorem | m1expcl2 11020 |
Closure of exponentiation of negative one. (Contributed by Mario
Carneiro, 18-Jun-2015.)
|
| ⊢ (𝑁 ∈ ℤ → ( -1↑𝑁) ∈ { -1,
1}) |
| |
| Theorem | m1expcl 11021 |
Closure of exponentiation of negative one. (Contributed by Mario
Carneiro, 18-Jun-2015.)
|
| ⊢ (𝑁 ∈ ℤ → ( -1↑𝑁) ∈
ℤ) |
| |
| Theorem | expclzaplem 11022* |
Closure law for integer exponentiation. Lemma for expclzap 11023 and
expap0i 11030. (Contributed by Jim Kingdon, 9-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ {𝑧 ∈ ℂ ∣ 𝑧 # 0}) |
| |
| Theorem | expclzap 11023 |
Closure law for integer exponentiation. (Contributed by Jim Kingdon,
9-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ) |
| |
| Theorem | nn0expcli 11024 |
Closure of exponentiation of nonnegative integers. (Contributed by
Mario Carneiro, 17-Apr-2015.)
|
| ⊢ 𝐴 ∈ ℕ0 & ⊢ 𝑁 ∈
ℕ0 ⇒ ⊢ (𝐴↑𝑁) ∈
ℕ0 |
| |
| Theorem | nn0sqcl 11025 |
The square of a nonnegative integer is a nonnegative integer.
(Contributed by Stefan O'Rear, 16-Oct-2014.)
|
| ⊢ (𝐴 ∈ ℕ0 → (𝐴↑2) ∈
ℕ0) |
| |
| Theorem | expm1t 11026 |
Exponentiation in terms of predecessor exponent. (Contributed by NM,
19-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = ((𝐴↑(𝑁 − 1)) · 𝐴)) |
| |
| Theorem | 1exp 11027 |
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 11028 |
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 11029 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 11029 |
Positive integer exponentiation is 0 iff its base is 0. (Contributed by
NM, 23-Feb-2005.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) = 0 ↔ 𝐴 = 0)) |
| |
| Theorem | expap0i 11030 |
Integer exponentiation is apart from zero if its base is apart from
zero. (Contributed by Jim Kingdon, 10-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) # 0) |
| |
| Theorem | expgt0 11031 |
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 11032 |
Value of a complex number raised to a negative power. (Contributed by
Mario Carneiro, 4-Jun-2014.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑ -𝑁) = (1 / (𝐴↑𝑁))) |
| |
| Theorem | 0exp 11033 |
Value of zero raised to a positive integer power. (Contributed by NM,
19-Aug-2004.)
|
| ⊢ (𝑁 ∈ ℕ → (0↑𝑁) = 0) |
| |
| Theorem | expge0 11034 |
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 11035 |
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 11036 |
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 11037 |
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 11038 |
Integer exponentiation of a product. (Contributed by Jim Kingdon,
10-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝑁 ∈ ℤ) → ((𝐴 · 𝐵)↑𝑁) = ((𝐴↑𝑁) · (𝐵↑𝑁))) |
| |
| Theorem | exprecap 11039 |
Integer exponentiation of a reciprocal. (Contributed by Jim Kingdon,
10-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → ((1 / 𝐴)↑𝑁) = (1 / (𝐴↑𝑁))) |
| |
| Theorem | expadd 11040 |
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 11041 |
Lemma for expaddzap 11042. (Contributed by Jim Kingdon, 10-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℝ ∧ -𝑀 ∈ ℕ) ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑀 + 𝑁)) = ((𝐴↑𝑀) · (𝐴↑𝑁))) |
| |
| Theorem | expaddzap 11042 |
Sum of exponents law for integer exponentiation. (Contributed by Jim
Kingdon, 10-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 + 𝑁)) = ((𝐴↑𝑀) · (𝐴↑𝑁))) |
| |
| Theorem | expmul 11043 |
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 11044 |
Product of exponents law for integer exponentiation. (Contributed by
Jim Kingdon, 11-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 · 𝑁)) = ((𝐴↑𝑀)↑𝑁)) |
| |
| Theorem | m1expeven 11045 |
Exponentiation of negative one to an even power. (Contributed by Scott
Fenton, 17-Jan-2018.)
|
| ⊢ (𝑁 ∈ ℤ → ( -1↑(2
· 𝑁)) =
1) |
| |
| Theorem | expsubap 11046 |
Exponent subtraction law for integer exponentiation. (Contributed by Jim
Kingdon, 11-Jun-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝐴↑(𝑀 − 𝑁)) = ((𝐴↑𝑀) / (𝐴↑𝑁))) |
| |
| Theorem | expp1zap 11047 |
Value of a nonzero complex number raised to an integer power plus one.
(Contributed by Jim Kingdon, 11-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
| |
| Theorem | expm1ap 11048 |
Value of a complex number raised to an integer power minus one.
(Contributed by Jim Kingdon, 11-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑(𝑁 − 1)) = ((𝐴↑𝑁) / 𝐴)) |
| |
| Theorem | expdivap 11049 |
Nonnegative integer exponentiation of a quotient. (Contributed by Jim
Kingdon, 11-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝑁 ∈ ℕ0) → ((𝐴 / 𝐵)↑𝑁) = ((𝐴↑𝑁) / (𝐵↑𝑁))) |
| |
| Theorem | ltexp2a 11050 |
Ordering relationship for exponentiation. (Contributed by NM,
2-Aug-2006.) (Revised by Mario Carneiro, 4-Jun-2014.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) < (𝐴↑𝑁)) |
| |
| Theorem | leexp2a 11051 |
Weak ordering relationship for exponentiation. (Contributed by NM,
14-Dec-2005.) (Revised by Mario Carneiro, 5-Jun-2014.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) |
| |
| Theorem | leexp2r 11052 |
Weak ordering relationship for exponentiation. (Contributed by Paul
Chapman, 14-Jan-2008.) (Revised by Mario Carneiro, 29-Apr-2014.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℕ0 ∧ 𝑁 ∈
(ℤ≥‘𝑀)) ∧ (0 ≤ 𝐴 ∧ 𝐴 ≤ 1)) → (𝐴↑𝑁) ≤ (𝐴↑𝑀)) |
| |
| Theorem | leexp1a 11053 |
Weak base ordering relationship for exponentiation. (Contributed by NM,
18-Dec-2005.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑁 ∈ ℕ0) ∧ (0 ≤
𝐴 ∧ 𝐴 ≤ 𝐵)) → (𝐴↑𝑁) ≤ (𝐵↑𝑁)) |
| |
| Theorem | exple1 11054 |
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 11055 |
An upper bound on 𝐴↑𝑁 when 2 ≤ 𝐴. (Contributed by NM,
19-Dec-2005.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0 ∧ 2 ≤
𝐴) → (𝐴↑𝑁) ≤ ((2↑𝑁) · ((𝐴 − 1)↑𝑁))) |
| |
| Theorem | sqval 11056 |
Value of the square of a complex number. (Contributed by Raph Levien,
10-Apr-2004.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴)) |
| |
| Theorem | sqneg 11057 |
The square of the negative of a number.) (Contributed by NM,
15-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℂ → ( -𝐴↑2) = (𝐴↑2)) |
| |
| Theorem | sqsubswap 11058 |
Swap the order of subtraction in a square. (Contributed by Scott Fenton,
10-Jun-2013.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵)↑2) = ((𝐵 − 𝐴)↑2)) |
| |
| Theorem | sqcl 11059 |
Closure of square. (Contributed by NM, 10-Aug-1999.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) |
| |
| Theorem | sqmul 11060 |
Distribution of square over multiplication. (Contributed by NM,
21-Mar-2008.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵)↑2) = ((𝐴↑2) · (𝐵↑2))) |
| |
| Theorem | sqeq0 11061 |
A number is zero iff its square is zero. (Contributed by NM,
11-Mar-2006.)
|
| ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) = 0 ↔ 𝐴 = 0)) |
| |
| Theorem | sqdivap 11062 |
Distribution of square over division. (Contributed by Jim Kingdon,
11-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵)↑2) = ((𝐴↑2) / (𝐵↑2))) |
| |
| Theorem | sqdividap 11063 |
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 11064 |
A number is nonzero iff its square is nonzero. See also sqap0 11065 which is
the same but with not equal changed to apart. (Contributed by NM,
11-Mar-2006.)
|
| ⊢ (𝐴 ∈ ℂ → ((𝐴↑2) ≠ 0 ↔ 𝐴 ≠ 0)) |
| |
| Theorem | sqap0 11065 |
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 11066 |
Closure of the square of a real number. (Contributed by NM,
18-Oct-1999.)
|
| ⊢ (𝐴 ∈ ℝ → (𝐴↑2) ∈ ℝ) |
| |
| Theorem | sqgt0ap 11067 |
The square of a nonzero real is positive. (Contributed by Jim Kingdon,
11-Jun-2020.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → 0 < (𝐴↑2)) |
| |
| Theorem | nnsqcl 11068 |
The naturals are closed under squaring. (Contributed by Scott Fenton,
29-Mar-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|
| ⊢ (𝐴 ∈ ℕ → (𝐴↑2) ∈ ℕ) |
| |
| Theorem | zsqcl 11069 |
Integers are closed under squaring. (Contributed by Scott Fenton,
18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|
| ⊢ (𝐴 ∈ ℤ → (𝐴↑2) ∈ ℤ) |
| |
| Theorem | qsqcl 11070 |
The square of a rational is rational. (Contributed by Stefan O'Rear,
15-Sep-2014.)
|
| ⊢ (𝐴 ∈ ℚ → (𝐴↑2) ∈ ℚ) |
| |
| Theorem | sq11 11071 |
The square function is one-to-one for nonnegative reals. Also see
sq11ap 11167 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 11072 |
The square function on nonnegative reals is strictly monotonic.
(Contributed by NM, 24-Feb-2006.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 < 𝐵 ↔ (𝐴↑2) < (𝐵↑2))) |
| |
| Theorem | le2sq 11073 |
The square function on nonnegative reals is monotonic. (Contributed by
NM, 18-Oct-1999.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 ≤ 𝐵 ↔ (𝐴↑2) ≤ (𝐵↑2))) |
| |
| Theorem | le2sq2 11074 |
The square of a 'less than or equal to' ordering. (Contributed by NM,
21-Mar-2008.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵)) → (𝐴↑2) ≤ (𝐵↑2)) |
| |
| Theorem | sqge0 11075 |
A square of a real is nonnegative. (Contributed by NM, 18-Oct-1999.)
|
| ⊢ (𝐴 ∈ ℝ → 0 ≤ (𝐴↑2)) |
| |
| Theorem | zsqcl2 11076 |
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 11077 |
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 11078 |
Value of square. Inference version. (Contributed by NM,
1-Aug-1999.)
|
| ⊢ 𝐴 ∈ ℂ
⇒ ⊢ (𝐴↑2) = (𝐴 · 𝐴) |
| |
| Theorem | sqcli 11079 |
Closure of square. (Contributed by NM, 2-Aug-1999.)
|
| ⊢ 𝐴 ∈ ℂ
⇒ ⊢ (𝐴↑2) ∈ ℂ |
| |
| Theorem | sqeq0i 11080 |
A number is zero iff its square is zero. (Contributed by NM,
2-Oct-1999.)
|
| ⊢ 𝐴 ∈ ℂ
⇒ ⊢ ((𝐴↑2) = 0 ↔ 𝐴 = 0) |
| |
| Theorem | sqmuli 11081 |
Distribution of square over multiplication. (Contributed by NM,
3-Sep-1999.)
|
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ ((𝐴 · 𝐵)↑2) = ((𝐴↑2) · (𝐵↑2)) |
| |
| Theorem | sqdivapi 11082 |
Distribution of square over division. (Contributed by Jim Kingdon,
12-Jun-2020.)
|
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐵 # 0
⇒ ⊢ ((𝐴 / 𝐵)↑2) = ((𝐴↑2) / (𝐵↑2)) |
| |
| Theorem | resqcli 11083 |
Closure of square in reals. (Contributed by NM, 2-Aug-1999.)
|
| ⊢ 𝐴 ∈ ℝ
⇒ ⊢ (𝐴↑2) ∈ ℝ |
| |
| Theorem | sqgt0api 11084 |
The square of a nonzero real is positive. (Contributed by Jim Kingdon,
12-Jun-2020.)
|
| ⊢ 𝐴 ∈ ℝ
⇒ ⊢ (𝐴 # 0 → 0 < (𝐴↑2)) |
| |
| Theorem | sqge0i 11085 |
A square of a real is nonnegative. (Contributed by NM, 3-Aug-1999.)
|
| ⊢ 𝐴 ∈ ℝ
⇒ ⊢ 0 ≤ (𝐴↑2) |
| |
| Theorem | lt2sqi 11086 |
The square function on nonnegative reals is strictly monotonic.
(Contributed by NM, 12-Sep-1999.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 < 𝐵 ↔ (𝐴↑2) < (𝐵↑2))) |
| |
| Theorem | le2sqi 11087 |
The square function on nonnegative reals is monotonic. (Contributed by
NM, 12-Sep-1999.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 ≤ 𝐵 ↔ (𝐴↑2) ≤ (𝐵↑2))) |
| |
| Theorem | sq11i 11088 |
The square function is one-to-one for nonnegative reals. (Contributed
by NM, 27-Oct-1999.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → ((𝐴↑2) = (𝐵↑2) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | sq0 11089 |
The square of 0 is 0. (Contributed by NM, 6-Jun-2006.)
|
| ⊢ (0↑2) = 0 |
| |
| Theorem | sq0i 11090 |
If a number is zero, its square is zero. (Contributed by FL,
10-Dec-2006.)
|
| ⊢ (𝐴 = 0 → (𝐴↑2) = 0) |
| |
| Theorem | sq0id 11091 |
If a number is zero, its square is zero. Deduction form of sq0i 11090.
Converse of sqeq0d 11132. (Contributed by David Moews, 28-Feb-2017.)
|
| ⊢ (𝜑 → 𝐴 = 0) ⇒ ⊢ (𝜑 → (𝐴↑2) = 0) |
| |
| Theorem | sq1 11092 |
The square of 1 is 1. (Contributed by NM, 22-Aug-1999.)
|
| ⊢ (1↑2) = 1 |
| |
| Theorem | neg1sqe1 11093 |
-1 squared is 1 (common case). (Contributed by David
A. Wheeler,
8-Dec-2018.)
|
| ⊢ ( -1↑2) = 1 |
| |
| Theorem | sq2 11094 |
The square of 2 is 4. (Contributed by NM, 22-Aug-1999.)
|
| ⊢ (2↑2) = 4 |
| |
| Theorem | sq3 11095 |
The square of 3 is 9. (Contributed by NM, 26-Apr-2006.)
|
| ⊢ (3↑2) = 9 |
| |
| Theorem | sq4e2t8 11096 |
The square of 4 is 2 times 8. (Contributed by AV, 20-Jul-2021.)
|
| ⊢ (4↑2) = (2 · 8) |
| |
| Theorem | cu2 11097 |
The cube of 2 is 8. (Contributed by NM, 2-Aug-2004.)
|
| ⊢ (2↑3) = 8 |
| |
| Theorem | irec 11098 |
The reciprocal of i. (Contributed by NM, 11-Oct-1999.)
|
| ⊢ (1 / i) = -i |
| |
| Theorem | i2 11099 |
i squared. (Contributed by NM, 6-May-1999.)
|
| ⊢ (i↑2) = -1 |
| |
| Theorem | i3 11100 |
i cubed. (Contributed by NM, 31-Jan-2007.)
|
| ⊢ (i↑3) = -i |