Theorem List for Intuitionistic Logic Explorer - 11001-11100 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | absi 11001 |
The absolute value of the imaginary unit. (Contributed by NM,
26-Mar-2005.)
|
⊢ (abs‘i) = 1 |
|
Theorem | absge0 11002 |
Absolute value is nonnegative. (Contributed by NM, 20-Nov-2004.)
(Revised by Mario Carneiro, 29-May-2016.)
|
⊢ (𝐴 ∈ ℂ → 0 ≤
(abs‘𝐴)) |
|
Theorem | absrpclap 11003 |
The absolute value of a number apart from zero is a positive real.
(Contributed by Jim Kingdon, 11-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (abs‘𝐴) ∈
ℝ+) |
|
Theorem | abs00ap 11004 |
The absolute value of a number is apart from zero iff the number is apart
from zero. (Contributed by Jim Kingdon, 11-Aug-2021.)
|
⊢ (𝐴 ∈ ℂ → ((abs‘𝐴) # 0 ↔ 𝐴 # 0)) |
|
Theorem | absext 11005 |
Strong extensionality for absolute value. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘𝐴) # (abs‘𝐵) → 𝐴 # 𝐵)) |
|
Theorem | abs00 11006 |
The absolute value of a number is zero iff the number is zero. Also see
abs00ap 11004 which is similar but for apartness.
Proposition 10-3.7(c) of
[Gleason] p. 133. (Contributed by NM,
26-Sep-2005.) (Proof shortened by
Mario Carneiro, 29-May-2016.)
|
⊢ (𝐴 ∈ ℂ → ((abs‘𝐴) = 0 ↔ 𝐴 = 0)) |
|
Theorem | abs00ad 11007 |
A complex number is zero iff its absolute value is zero. Deduction form
of abs00 11006. (Contributed by David Moews, 28-Feb-2017.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ)
⇒ ⊢ (𝜑 → ((abs‘𝐴) = 0 ↔ 𝐴 = 0)) |
|
Theorem | abs00bd 11008 |
If a complex number is zero, its absolute value is zero. (Contributed
by David Moews, 28-Feb-2017.)
|
⊢ (𝜑 → 𝐴 = 0) ⇒ ⊢ (𝜑 → (abs‘𝐴) = 0) |
|
Theorem | absreimsq 11009 |
Square of the absolute value of a number that has been decomposed into
real and imaginary parts. (Contributed by NM, 1-Feb-2007.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘(𝐴 + (i · 𝐵)))↑2) = ((𝐴↑2) + (𝐵↑2))) |
|
Theorem | absreim 11010 |
Absolute value of a number that has been decomposed into real and
imaginary parts. (Contributed by NM, 14-Jan-2006.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (abs‘(𝐴 + (i · 𝐵))) = (√‘((𝐴↑2) + (𝐵↑2)))) |
|
Theorem | absmul 11011 |
Absolute value distributes over multiplication. Proposition 10-3.7(f) of
[Gleason] p. 133. (Contributed by NM,
11-Oct-1999.) (Revised by Mario
Carneiro, 29-May-2016.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (abs‘(𝐴 · 𝐵)) = ((abs‘𝐴) · (abs‘𝐵))) |
|
Theorem | absdivap 11012 |
Absolute value distributes over division. (Contributed by Jim Kingdon,
11-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (abs‘(𝐴 / 𝐵)) = ((abs‘𝐴) / (abs‘𝐵))) |
|
Theorem | absid 11013 |
A nonnegative number is its own absolute value. (Contributed by NM,
11-Oct-1999.) (Revised by Mario Carneiro, 29-May-2016.)
|
⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) |
|
Theorem | abs1 11014 |
The absolute value of 1. Common special case. (Contributed by David A.
Wheeler, 16-Jul-2016.)
|
⊢ (abs‘1) = 1 |
|
Theorem | absnid 11015 |
A negative number is the negative of its own absolute value. (Contributed
by NM, 27-Feb-2005.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) |
|
Theorem | leabs 11016 |
A real number is less than or equal to its absolute value. (Contributed
by NM, 27-Feb-2005.)
|
⊢ (𝐴 ∈ ℝ → 𝐴 ≤ (abs‘𝐴)) |
|
Theorem | qabsor 11017 |
The absolute value of a rational number is either that number or its
negative. (Contributed by Jim Kingdon, 8-Nov-2021.)
|
⊢ (𝐴 ∈ ℚ → ((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴)) |
|
Theorem | qabsord 11018 |
The absolute value of a rational number is either that number or its
negative. (Contributed by Jim Kingdon, 8-Nov-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℚ)
⇒ ⊢ (𝜑 → ((abs‘𝐴) = 𝐴 ∨ (abs‘𝐴) = -𝐴)) |
|
Theorem | absre 11019 |
Absolute value of a real number. (Contributed by NM, 17-Mar-2005.)
|
⊢ (𝐴 ∈ ℝ → (abs‘𝐴) = (√‘(𝐴↑2))) |
|
Theorem | absresq 11020 |
Square of the absolute value of a real number. (Contributed by NM,
16-Jan-2006.)
|
⊢ (𝐴 ∈ ℝ → ((abs‘𝐴)↑2) = (𝐴↑2)) |
|
Theorem | absexp 11021 |
Absolute value of positive integer exponentiation. (Contributed by NM,
5-Jan-2006.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) →
(abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)) |
|
Theorem | absexpzap 11022 |
Absolute value of integer exponentiation. (Contributed by Jim Kingdon,
11-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0 ∧ 𝑁 ∈ ℤ) → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)) |
|
Theorem | abssq 11023 |
Square can be moved in and out of absolute value. (Contributed by Scott
Fenton, 18-Apr-2014.) (Proof shortened by Mario Carneiro,
29-May-2016.)
|
⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑2) = (abs‘(𝐴↑2))) |
|
Theorem | sqabs 11024 |
The squares of two reals are equal iff their absolute values are equal.
(Contributed by NM, 6-Mar-2009.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴↑2) = (𝐵↑2) ↔ (abs‘𝐴) = (abs‘𝐵))) |
|
Theorem | absrele 11025 |
The absolute value of a complex number is greater than or equal to the
absolute value of its real part. (Contributed by NM, 1-Apr-2005.)
|
⊢ (𝐴 ∈ ℂ →
(abs‘(ℜ‘𝐴)) ≤ (abs‘𝐴)) |
|
Theorem | absimle 11026 |
The absolute value of a complex number is greater than or equal to the
absolute value of its imaginary part. (Contributed by NM, 17-Mar-2005.)
(Proof shortened by Mario Carneiro, 29-May-2016.)
|
⊢ (𝐴 ∈ ℂ →
(abs‘(ℑ‘𝐴)) ≤ (abs‘𝐴)) |
|
Theorem | nn0abscl 11027 |
The absolute value of an integer is a nonnegative integer. (Contributed
by NM, 27-Feb-2005.)
|
⊢ (𝐴 ∈ ℤ → (abs‘𝐴) ∈
ℕ0) |
|
Theorem | zabscl 11028 |
The absolute value of an integer is an integer. (Contributed by Stefan
O'Rear, 24-Sep-2014.)
|
⊢ (𝐴 ∈ ℤ → (abs‘𝐴) ∈
ℤ) |
|
Theorem | ltabs 11029 |
A number which is less than its absolute value is negative. (Contributed
by Jim Kingdon, 12-Aug-2021.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < (abs‘𝐴)) → 𝐴 < 0) |
|
Theorem | abslt 11030 |
Absolute value and 'less than' relation. (Contributed by NM, 6-Apr-2005.)
(Revised by Mario Carneiro, 29-May-2016.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) < 𝐵 ↔ (-𝐵 < 𝐴 ∧ 𝐴 < 𝐵))) |
|
Theorem | absle 11031 |
Absolute value and 'less than or equal to' relation. (Contributed by NM,
6-Apr-2005.) (Revised by Mario Carneiro, 29-May-2016.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((abs‘𝐴) ≤ 𝐵 ↔ (-𝐵 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵))) |
|
Theorem | abssubap0 11032 |
If the absolute value of a complex number is less than a real, its
difference from the real is apart from zero. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ (abs‘𝐴) < 𝐵) → (𝐵 − 𝐴) # 0) |
|
Theorem | abssubne0 11033 |
If the absolute value of a complex number is less than a real, its
difference from the real is nonzero. See also abssubap0 11032 which is the
same with not equal changed to apart. (Contributed by NM, 2-Nov-2007.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℝ ∧ (abs‘𝐴) < 𝐵) → (𝐵 − 𝐴) ≠ 0) |
|
Theorem | absdiflt 11034 |
The absolute value of a difference and 'less than' relation. (Contributed
by Paul Chapman, 18-Sep-2007.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((abs‘(𝐴 − 𝐵)) < 𝐶 ↔ ((𝐵 − 𝐶) < 𝐴 ∧ 𝐴 < (𝐵 + 𝐶)))) |
|
Theorem | absdifle 11035 |
The absolute value of a difference and 'less than or equal to' relation.
(Contributed by Paul Chapman, 18-Sep-2007.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((abs‘(𝐴 − 𝐵)) ≤ 𝐶 ↔ ((𝐵 − 𝐶) ≤ 𝐴 ∧ 𝐴 ≤ (𝐵 + 𝐶)))) |
|
Theorem | elicc4abs 11036 |
Membership in a symmetric closed real interval. (Contributed by Stefan
O'Rear, 16-Nov-2014.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 ∈ ((𝐴 − 𝐵)[,](𝐴 + 𝐵)) ↔ (abs‘(𝐶 − 𝐴)) ≤ 𝐵)) |
|
Theorem | lenegsq 11037 |
Comparison to a nonnegative number based on comparison to squares.
(Contributed by NM, 16-Jan-2006.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) → ((𝐴 ≤ 𝐵 ∧ -𝐴 ≤ 𝐵) ↔ (𝐴↑2) ≤ (𝐵↑2))) |
|
Theorem | releabs 11038 |
The real part of a number is less than or equal to its absolute value.
Proposition 10-3.7(d) of [Gleason] p. 133.
(Contributed by NM,
1-Apr-2005.)
|
⊢ (𝐴 ∈ ℂ → (ℜ‘𝐴) ≤ (abs‘𝐴)) |
|
Theorem | recvalap 11039 |
Reciprocal expressed with a real denominator. (Contributed by Jim
Kingdon, 13-Aug-2021.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / 𝐴) = ((∗‘𝐴) / ((abs‘𝐴)↑2))) |
|
Theorem | absidm 11040 |
The absolute value function is idempotent. (Contributed by NM,
20-Nov-2004.)
|
⊢ (𝐴 ∈ ℂ →
(abs‘(abs‘𝐴))
= (abs‘𝐴)) |
|
Theorem | absgt0ap 11041 |
The absolute value of a number apart from zero is positive. (Contributed
by Jim Kingdon, 13-Aug-2021.)
|
⊢ (𝐴 ∈ ℂ → (𝐴 # 0 ↔ 0 < (abs‘𝐴))) |
|
Theorem | nnabscl 11042 |
The absolute value of a nonzero integer is a positive integer.
(Contributed by Paul Chapman, 21-Mar-2011.) (Proof shortened by Andrew
Salmon, 25-May-2011.)
|
⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (abs‘𝑁) ∈
ℕ) |
|
Theorem | abssub 11043 |
Swapping order of subtraction doesn't change the absolute value.
(Contributed by NM, 1-Oct-1999.) (Proof shortened by Mario Carneiro,
29-May-2016.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (abs‘(𝐴 − 𝐵)) = (abs‘(𝐵 − 𝐴))) |
|
Theorem | abssubge0 11044 |
Absolute value of a nonnegative difference. (Contributed by NM,
14-Feb-2008.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (abs‘(𝐵 − 𝐴)) = (𝐵 − 𝐴)) |
|
Theorem | abssuble0 11045 |
Absolute value of a nonpositive difference. (Contributed by FL,
3-Jan-2008.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (abs‘(𝐴 − 𝐵)) = (𝐵 − 𝐴)) |
|
Theorem | abstri 11046 |
Triangle inequality for absolute value. Proposition 10-3.7(h) of
[Gleason] p. 133. (Contributed by NM,
7-Mar-2005.) (Proof shortened by
Mario Carneiro, 29-May-2016.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (abs‘(𝐴 + 𝐵)) ≤ ((abs‘𝐴) + (abs‘𝐵))) |
|
Theorem | abs3dif 11047 |
Absolute value of differences around common element. (Contributed by FL,
9-Oct-2006.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (abs‘(𝐴 − 𝐵)) ≤ ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵)))) |
|
Theorem | abs2dif 11048 |
Difference of absolute values. (Contributed by Paul Chapman,
7-Sep-2007.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((abs‘𝐴) − (abs‘𝐵)) ≤ (abs‘(𝐴 − 𝐵))) |
|
Theorem | abs2dif2 11049 |
Difference of absolute values. (Contributed by Mario Carneiro,
14-Apr-2016.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (abs‘(𝐴 − 𝐵)) ≤ ((abs‘𝐴) + (abs‘𝐵))) |
|
Theorem | abs2difabs 11050 |
Absolute value of difference of absolute values. (Contributed by Paul
Chapman, 7-Sep-2007.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) →
(abs‘((abs‘𝐴)
− (abs‘𝐵)))
≤ (abs‘(𝐴 −
𝐵))) |
|
Theorem | recan 11051* |
Cancellation law involving the real part of a complex number.
(Contributed by NM, 12-May-2005.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∀𝑥 ∈ ℂ
(ℜ‘(𝑥 ·
𝐴)) = (ℜ‘(𝑥 · 𝐵)) ↔ 𝐴 = 𝐵)) |
|
Theorem | absf 11052 |
Mapping domain and codomain of the absolute value function.
(Contributed by NM, 30-Aug-2007.) (Revised by Mario Carneiro,
7-Nov-2013.)
|
⊢ abs:ℂ⟶ℝ |
|
Theorem | abs3lem 11053 |
Lemma involving absolute value of differences. (Contributed by NM,
2-Oct-1999.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℝ)) →
(((abs‘(𝐴 −
𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2)) → (abs‘(𝐴 − 𝐵)) < 𝐷)) |
|
Theorem | fzomaxdiflem 11054 |
Lemma for fzomaxdif 11055. (Contributed by Stefan O'Rear,
6-Sep-2015.)
|
⊢ (((𝐴 ∈ (𝐶..^𝐷) ∧ 𝐵 ∈ (𝐶..^𝐷)) ∧ 𝐴 ≤ 𝐵) → (abs‘(𝐵 − 𝐴)) ∈ (0..^(𝐷 − 𝐶))) |
|
Theorem | fzomaxdif 11055 |
A bound on the separation of two points in a half-open range.
(Contributed by Stefan O'Rear, 6-Sep-2015.)
|
⊢ ((𝐴 ∈ (𝐶..^𝐷) ∧ 𝐵 ∈ (𝐶..^𝐷)) → (abs‘(𝐴 − 𝐵)) ∈ (0..^(𝐷 − 𝐶))) |
|
Theorem | cau3lem 11056* |
Lemma for cau3 11057. (Contributed by Mario Carneiro,
15-Feb-2014.)
(Revised by Mario Carneiro, 1-May-2014.)
|
⊢ 𝑍 ⊆ ℤ & ⊢ (𝜏 → 𝜓)
& ⊢ ((𝐹‘𝑘) = (𝐹‘𝑗) → (𝜓 ↔ 𝜒)) & ⊢ ((𝐹‘𝑘) = (𝐹‘𝑚) → (𝜓 ↔ 𝜃)) & ⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → (𝐺‘((𝐹‘𝑗)𝐷(𝐹‘𝑘))) = (𝐺‘((𝐹‘𝑘)𝐷(𝐹‘𝑗)))) & ⊢ ((𝜑 ∧ 𝜃 ∧ 𝜒) → (𝐺‘((𝐹‘𝑚)𝐷(𝐹‘𝑗))) = (𝐺‘((𝐹‘𝑗)𝐷(𝐹‘𝑚)))) & ⊢ ((𝜑 ∧ (𝜓 ∧ 𝜃) ∧ (𝜒 ∧ 𝑥 ∈ ℝ)) → (((𝐺‘((𝐹‘𝑘)𝐷(𝐹‘𝑗))) < (𝑥 / 2) ∧ (𝐺‘((𝐹‘𝑗)𝐷(𝐹‘𝑚))) < (𝑥 / 2)) → (𝐺‘((𝐹‘𝑘)𝐷(𝐹‘𝑚))) < 𝑥)) ⇒ ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜏 ∧ (𝐺‘((𝐹‘𝑘)𝐷(𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜏 ∧ ∀𝑚 ∈ (ℤ≥‘𝑘)(𝐺‘((𝐹‘𝑘)𝐷(𝐹‘𝑚))) < 𝑥))) |
|
Theorem | cau3 11057* |
Convert between three-quantifier and four-quantifier versions of the
Cauchy criterion. (In particular, the four-quantifier version has no
occurrence of 𝑗 in the assertion, so it can be used
with rexanuz 10930
and friends.) (Contributed by Mario Carneiro, 15-Feb-2014.)
|
⊢ 𝑍 = (ℤ≥‘𝑀)
⇒ ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ ∀𝑚 ∈
(ℤ≥‘𝑘)(abs‘((𝐹‘𝑘) − (𝐹‘𝑚))) < 𝑥)) |
|
Theorem | cau4 11058* |
Change the base of a Cauchy criterion. (Contributed by Mario
Carneiro, 18-Mar-2014.)
|
⊢ 𝑍 = (ℤ≥‘𝑀) & ⊢ 𝑊 =
(ℤ≥‘𝑁) ⇒ ⊢ (𝑁 ∈ 𝑍 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑊 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))) |
|
Theorem | caubnd2 11059* |
A Cauchy sequence of complex numbers is eventually bounded.
(Contributed by Mario Carneiro, 14-Feb-2014.)
|
⊢ 𝑍 = (ℤ≥‘𝑀)
⇒ ⊢ (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑦 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘(𝐹‘𝑘)) < 𝑦) |
|
Theorem | amgm2 11060 |
Arithmetic-geometric mean inequality for 𝑛 = 2. (Contributed by
Mario Carneiro, 2-Jul-2014.)
|
⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (√‘(𝐴 · 𝐵)) ≤ ((𝐴 + 𝐵) / 2)) |
|
Theorem | sqrtthi 11061 |
Square root theorem. Theorem I.35 of [Apostol]
p. 29. (Contributed by
NM, 26-May-1999.) (Revised by Mario Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → ((√‘𝐴) · (√‘𝐴)) = 𝐴) |
|
Theorem | sqrtcli 11062 |
The square root of a nonnegative real is a real. (Contributed by NM,
26-May-1999.) (Revised by Mario Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → (√‘𝐴) ∈ ℝ) |
|
Theorem | sqrtgt0i 11063 |
The square root of a positive real is positive. (Contributed by NM,
26-May-1999.) (Revised by Mario Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 < 𝐴 → 0 < (√‘𝐴)) |
|
Theorem | sqrtmsqi 11064 |
Square root of square. (Contributed by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → (√‘(𝐴 · 𝐴)) = 𝐴) |
|
Theorem | sqrtsqi 11065 |
Square root of square. (Contributed by NM, 11-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → (√‘(𝐴↑2)) = 𝐴) |
|
Theorem | sqsqrti 11066 |
Square of square root. (Contributed by NM, 11-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → ((√‘𝐴)↑2) = 𝐴) |
|
Theorem | sqrtge0i 11067 |
The square root of a nonnegative real is nonnegative. (Contributed by
NM, 26-May-1999.) (Revised by Mario Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → 0 ≤ (√‘𝐴)) |
|
Theorem | absidi 11068 |
A nonnegative number is its own absolute value. (Contributed by NM,
2-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 ≤ 𝐴 → (abs‘𝐴) = 𝐴) |
|
Theorem | absnidi 11069 |
A negative number is the negative of its own absolute value.
(Contributed by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (𝐴 ≤ 0 → (abs‘𝐴) = -𝐴) |
|
Theorem | leabsi 11070 |
A real number is less than or equal to its absolute value. (Contributed
by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ 𝐴 ≤ (abs‘𝐴) |
|
Theorem | absrei 11071 |
Absolute value of a real number. (Contributed by NM, 3-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (abs‘𝐴) = (√‘(𝐴↑2)) |
|
Theorem | sqrtpclii 11072 |
The square root of a positive real is a real. (Contributed by Mario
Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 0 < 𝐴 ⇒ ⊢ (√‘𝐴) ∈
ℝ |
|
Theorem | sqrtgt0ii 11073 |
The square root of a positive real is positive. (Contributed by NM,
26-May-1999.) (Revised by Mario Carneiro, 6-Sep-2013.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 0 < 𝐴 ⇒ ⊢ 0 < (√‘𝐴) |
|
Theorem | sqrt11i 11074 |
The square root function is one-to-one. (Contributed by NM,
27-Jul-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → ((√‘𝐴) = (√‘𝐵) ↔ 𝐴 = 𝐵)) |
|
Theorem | sqrtmuli 11075 |
Square root distributes over multiplication. (Contributed by NM,
30-Jul-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (√‘(𝐴 · 𝐵)) = ((√‘𝐴) · (√‘𝐵))) |
|
Theorem | sqrtmulii 11076 |
Square root distributes over multiplication. (Contributed by NM,
30-Jul-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ & ⊢ 0 ≤ 𝐴 & ⊢ 0 ≤ 𝐵 ⇒ ⊢ (√‘(𝐴 · 𝐵)) = ((√‘𝐴) · (√‘𝐵)) |
|
Theorem | sqrtmsq2i 11077 |
Relationship between square root and squares. (Contributed by NM,
31-Jul-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → ((√‘𝐴) = 𝐵 ↔ 𝐴 = (𝐵 · 𝐵))) |
|
Theorem | sqrtlei 11078 |
Square root is monotonic. (Contributed by NM, 3-Aug-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 ≤ 𝐵 ↔ (√‘𝐴) ≤ (√‘𝐵))) |
|
Theorem | sqrtlti 11079 |
Square root is strictly monotonic. (Contributed by Roy F. Longton,
8-Aug-2005.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → (𝐴 < 𝐵 ↔ (√‘𝐴) < (√‘𝐵))) |
|
Theorem | abslti 11080 |
Absolute value and 'less than' relation. (Contributed by NM,
6-Apr-2005.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((abs‘𝐴) < 𝐵 ↔ (-𝐵 < 𝐴 ∧ 𝐴 < 𝐵)) |
|
Theorem | abslei 11081 |
Absolute value and 'less than or equal to' relation. (Contributed by
NM, 6-Apr-2005.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((abs‘𝐴) ≤ 𝐵 ↔ (-𝐵 ≤ 𝐴 ∧ 𝐴 ≤ 𝐵)) |
|
Theorem | absvalsqi 11082 |
Square of value of absolute value function. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ ((abs‘𝐴)↑2) = (𝐴 · (∗‘𝐴)) |
|
Theorem | absvalsq2i 11083 |
Square of value of absolute value function. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ ((abs‘𝐴)↑2) = (((ℜ‘𝐴)↑2) +
((ℑ‘𝐴)↑2)) |
|
Theorem | abscli 11084 |
Real closure of absolute value. (Contributed by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ (abs‘𝐴) ∈ ℝ |
|
Theorem | absge0i 11085 |
Absolute value is nonnegative. (Contributed by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ 0 ≤ (abs‘𝐴) |
|
Theorem | absval2i 11086 |
Value of absolute value function. Definition 10.36 of [Gleason] p. 133.
(Contributed by NM, 2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ (abs‘𝐴) = (√‘(((ℜ‘𝐴)↑2) +
((ℑ‘𝐴)↑2))) |
|
Theorem | abs00i 11087 |
The absolute value of a number is zero iff the number is zero.
Proposition 10-3.7(c) of [Gleason] p.
133. (Contributed by NM,
28-Jul-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ ((abs‘𝐴) = 0 ↔ 𝐴 = 0) |
|
Theorem | absgt0api 11088 |
The absolute value of a nonzero number is positive. Remark in [Apostol]
p. 363. (Contributed by NM, 1-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ (𝐴 # 0 ↔ 0 < (abs‘𝐴)) |
|
Theorem | absnegi 11089 |
Absolute value of negative. (Contributed by NM, 2-Aug-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ (abs‘-𝐴) = (abs‘𝐴) |
|
Theorem | abscji 11090 |
The absolute value of a number and its conjugate are the same.
Proposition 10-3.7(b) of [Gleason] p.
133. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢
(abs‘(∗‘𝐴)) = (abs‘𝐴) |
|
Theorem | releabsi 11091 |
The real part of a number is less than or equal to its absolute value.
Proposition 10-3.7(d) of [Gleason] p.
133. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ
⇒ ⊢ (ℜ‘𝐴) ≤ (abs‘𝐴) |
|
Theorem | abssubi 11092 |
Swapping order of subtraction doesn't change the absolute value.
Example of [Apostol] p. 363.
(Contributed by NM, 1-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ (abs‘(𝐴 − 𝐵)) = (abs‘(𝐵 − 𝐴)) |
|
Theorem | absmuli 11093 |
Absolute value distributes over multiplication. Proposition 10-3.7(f)
of [Gleason] p. 133. (Contributed by
NM, 1-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ (abs‘(𝐴 · 𝐵)) = ((abs‘𝐴) · (abs‘𝐵)) |
|
Theorem | sqabsaddi 11094 |
Square of absolute value of sum. Proposition 10-3.7(g) of [Gleason]
p. 133. (Contributed by NM, 2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ ((abs‘(𝐴 + 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) + (2 ·
(ℜ‘(𝐴 ·
(∗‘𝐵))))) |
|
Theorem | sqabssubi 11095 |
Square of absolute value of difference. (Contributed by Steve
Rodriguez, 20-Jan-2007.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ ((abs‘(𝐴 − 𝐵))↑2) = ((((abs‘𝐴)↑2) + ((abs‘𝐵)↑2)) − (2 ·
(ℜ‘(𝐴 ·
(∗‘𝐵))))) |
|
Theorem | absdivapzi 11096 |
Absolute value distributes over division. (Contributed by Jim Kingdon,
13-Aug-2021.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ (𝐵 # 0 → (abs‘(𝐴 / 𝐵)) = ((abs‘𝐴) / (abs‘𝐵))) |
|
Theorem | abstrii 11097 |
Triangle inequality for absolute value. Proposition 10-3.7(h) of
[Gleason] p. 133. This is Metamath 100
proof #91. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈
ℂ ⇒ ⊢ (abs‘(𝐴 + 𝐵)) ≤ ((abs‘𝐴) + (abs‘𝐵)) |
|
Theorem | abs3difi 11098 |
Absolute value of differences around common element. (Contributed by
NM, 2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐶 ∈
ℂ ⇒ ⊢ (abs‘(𝐴 − 𝐵)) ≤ ((abs‘(𝐴 − 𝐶)) + (abs‘(𝐶 − 𝐵))) |
|
Theorem | abs3lemi 11099 |
Lemma involving absolute value of differences. (Contributed by NM,
2-Oct-1999.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐶 ∈ ℂ & ⊢ 𝐷 ∈
ℝ ⇒ ⊢ (((abs‘(𝐴 − 𝐶)) < (𝐷 / 2) ∧ (abs‘(𝐶 − 𝐵)) < (𝐷 / 2)) → (abs‘(𝐴 − 𝐵)) < 𝐷) |
|
Theorem | rpsqrtcld 11100 |
The square root of a positive real is positive. (Contributed by Mario
Carneiro, 29-May-2016.)
|
⊢ (𝜑 → 𝐴 ∈
ℝ+) ⇒ ⊢ (𝜑 → (√‘𝐴) ∈
ℝ+) |