Theorem List for Intuitionistic Logic Explorer - 10101-10200 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | mul2lt0lgt0 10101 |
If the result of a multiplication is strictly negative, then
multiplicands are of different signs. (Contributed by Thierry Arnoux,
2-Oct-2018.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → (𝐴 · 𝐵) < 0) ⇒ ⊢ ((𝜑 ∧ 0 < 𝐴) → 𝐵 < 0) |
| |
| Theorem | mul2lt0np 10102 |
The product of multiplicands of different signs is negative.
(Contributed by Jim Kingdon, 25-Feb-2024.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 0) & ⊢ (𝜑 → 0 < 𝐵) ⇒ ⊢ (𝜑 → (𝐴 · 𝐵) < 0) |
| |
| Theorem | mul2lt0pn 10103 |
The product of multiplicands of different signs is negative.
(Contributed by Jim Kingdon, 25-Feb-2024.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 0) & ⊢ (𝜑 → 0 < 𝐵) ⇒ ⊢ (𝜑 → (𝐵 · 𝐴) < 0) |
| |
| Theorem | lt2mul2divd 10104 |
The ratio of nonnegative and positive numbers is nonnegative.
(Contributed by Mario Carneiro, 28-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ+) & ⊢ (𝜑 → 𝐶 ∈ ℝ) & ⊢ (𝜑 → 𝐷 ∈
ℝ+) ⇒ ⊢ (𝜑 → ((𝐴 · 𝐵) < (𝐶 · 𝐷) ↔ (𝐴 / 𝐷) < (𝐶 / 𝐵))) |
| |
| Theorem | nnledivrp 10105 |
Division of a positive integer by a positive number is less than or equal
to the integer iff the number is greater than or equal to 1. (Contributed
by AV, 19-Jun-2021.)
|
| ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℝ+) → (1 ≤
𝐵 ↔ (𝐴 / 𝐵) ≤ 𝐴)) |
| |
| Theorem | nn0ledivnn 10106 |
Division of a nonnegative integer by a positive integer is less than or
equal to the integer. (Contributed by AV, 19-Jun-2021.)
|
| ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ) → (𝐴 / 𝐵) ≤ 𝐴) |
| |
| Theorem | addlelt 10107 |
If the sum of a real number and a positive real number is less than or
equal to a third real number, the first real number is less than the third
real number. (Contributed by AV, 1-Jul-2021.)
|
| ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝐴 ∈ ℝ+) → ((𝑀 + 𝐴) ≤ 𝑁 → 𝑀 < 𝑁)) |
| |
| 4.5.2 Infinity and the extended real number
system (cont.)
|
| |
| Syntax | cxne 10108 |
Extend class notation to include the negative of an extended real.
|
| class -𝑒𝐴 |
| |
| Syntax | cxad 10109 |
Extend class notation to include addition of extended reals.
|
| class +𝑒 |
| |
| Syntax | cxmu 10110 |
Extend class notation to include multiplication of extended reals.
|
| class ·e |
| |
| Definition | df-xneg 10111 |
Define the negative of an extended real number. (Contributed by FL,
26-Dec-2011.)
|
| ⊢ -𝑒𝐴 = if(𝐴 = +∞, -∞, if(𝐴 = -∞, +∞, -𝐴)) |
| |
| Definition | df-xadd 10112* |
Define addition over extended real numbers. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ +𝑒 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ*
↦ if(𝑥 = +∞,
if(𝑦 = -∞, 0,
+∞), if(𝑥 =
-∞, if(𝑦 = +∞,
0, -∞), if(𝑦 =
+∞, +∞, if(𝑦 =
-∞, -∞, (𝑥 +
𝑦)))))) |
| |
| Definition | df-xmul 10113* |
Define multiplication over extended real numbers. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ·e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ*
↦ if((𝑥 = 0 ∨
𝑦 = 0), 0, if((((0 <
𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦))))) |
| |
| Theorem | ltxr 10114 |
The 'less than' binary relation on the set of extended reals.
Definition 12-3.1 of [Gleason] p. 173.
(Contributed by NM,
14-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 ↔ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐴 <ℝ 𝐵) ∨ (𝐴 = -∞ ∧ 𝐵 = +∞)) ∨ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) ∨ (𝐴 = -∞ ∧ 𝐵 ∈ ℝ))))) |
| |
| Theorem | elxr 10115 |
Membership in the set of extended reals. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) |
| |
| Theorem | xrnemnf 10116 |
An extended real other than minus infinity is real or positive infinite.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞)) |
| |
| Theorem | xrnepnf 10117 |
An extended real other than plus infinity is real or negative infinite.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) |
| |
| Theorem | xrltnr 10118 |
The extended real 'less than' is irreflexive. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
𝐴 < 𝐴) |
| |
| Theorem | ltpnf 10119 |
Any (finite) real is less than plus infinity. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ → 𝐴 < +∞) |
| |
| Theorem | ltpnfd 10120 |
Any (finite) real is less than plus infinity. (Contributed by Glauco
Siliprandi, 11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ)
⇒ ⊢ (𝜑 → 𝐴 < +∞) |
| |
| Theorem | 0ltpnf 10121 |
Zero is less than plus infinity (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 < +∞ |
| |
| Theorem | mnflt 10122 |
Minus infinity is less than any (finite) real. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) |
| |
| Theorem | mnflt0 10123 |
Minus infinity is less than 0 (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ -∞ < 0 |
| |
| Theorem | mnfltpnf 10124 |
Minus infinity is less than plus infinity. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ -∞ < +∞ |
| |
| Theorem | mnfltxr 10125 |
Minus infinity is less than an extended real that is either real or plus
infinity. (Contributed by NM, 2-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞) → -∞ < 𝐴) |
| |
| Theorem | pnfnlt 10126 |
No extended real is greater than plus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
+∞ < 𝐴) |
| |
| Theorem | nltmnf 10127 |
No extended real is less than minus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
𝐴 <
-∞) |
| |
| Theorem | pnfge 10128 |
Plus infinity is an upper bound for extended reals. (Contributed by NM,
30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤
+∞) |
| |
| Theorem | 0lepnf 10129 |
0 less than or equal to positive infinity. (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 ≤ +∞ |
| |
| Theorem | nn0pnfge0 10130 |
If a number is a nonnegative integer or positive infinity, it is greater
than or equal to 0. (Contributed by Alexander van der Vekens,
6-Jan-2018.)
|
| ⊢ ((𝑁 ∈ ℕ0 ∨ 𝑁 = +∞) → 0 ≤
𝑁) |
| |
| Theorem | mnfle 10131 |
Minus infinity is less than or equal to any extended real. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → -∞
≤ 𝐴) |
| |
| Theorem | xrltnsym 10132 |
Ordering on the extended reals is not symmetric. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴)) |
| |
| Theorem | xrltnsym2 10133 |
'Less than' is antisymmetric and irreflexive for extended reals.
(Contributed by NM, 6-Feb-2007.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ ¬ (𝐴 < 𝐵 ∧ 𝐵 < 𝐴)) |
| |
| Theorem | xrlttr 10134 |
Ordering on the extended reals is transitive. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltso 10135 |
'Less than' is a weakly linear ordering on the extended reals.
(Contributed by NM, 15-Oct-2005.)
|
| ⊢ < Or
ℝ* |
| |
| Theorem | xrlttri3 10136 |
Extended real version of lttri3 8358. (Contributed by NM, 9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
| |
| Theorem | xrltle 10137 |
'Less than' implies 'less than or equal' for extended reals. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → 𝐴 ≤ 𝐵)) |
| |
| Theorem | xrltled 10138 |
'Less than' implies 'less than or equal to' for extended reals.
Deduction form of xrltle 10137. (Contributed by Glauco Siliprandi,
11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
| |
| Theorem | xrleid 10139 |
'Less than or equal to' is reflexive for extended reals. (Contributed by
NM, 7-Feb-2007.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤ 𝐴) |
| |
| Theorem | xrleidd 10140 |
'Less than or equal to' is reflexive for extended reals. Deduction form
of xrleid 10139. (Contributed by Glauco Siliprandi,
26-Jun-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐴) |
| |
| Theorem | xnn0dcle 10141 |
Decidability of ≤ for extended nonnegative integers.
(Contributed by
Jim Kingdon, 13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → DECID 𝐴 ≤ 𝐵) |
| |
| Theorem | xnn0letri 10142 |
Dichotomy for extended nonnegative integers. (Contributed by Jim Kingdon,
13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → (𝐴 ≤ 𝐵 ∨ 𝐵 ≤ 𝐴)) |
| |
| Theorem | xrletri3 10143 |
Trichotomy law for extended reals. (Contributed by FL, 2-Aug-2009.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))) |
| |
| Theorem | xrletrid 10144 |
Trichotomy law for extended reals. (Contributed by Glauco Siliprandi,
17-Aug-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐴) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
| |
| Theorem | xrlelttr 10145 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltletr 10146 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrletr 10147 |
Transitive law for ordering on extended reals. (Contributed by NM,
9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
| |
| Theorem | xrlttrd 10148 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrlelttrd 10149 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrltletrd 10150 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrletrd 10151 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐶) |
| |
| Theorem | xrltne 10152 |
'Less than' implies not equal for extended reals. (Contributed by NM,
20-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) → 𝐵 ≠ 𝐴) |
| |
| Theorem | nltpnft 10153 |
An extended real is not less than plus infinity iff they are equal.
(Contributed by NM, 30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = +∞ ↔ ¬ 𝐴 <
+∞)) |
| |
| Theorem | npnflt 10154 |
An extended real is less than plus infinity iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < +∞ ↔ 𝐴 ≠
+∞)) |
| |
| Theorem | xgepnf 10155 |
An extended real which is greater than plus infinity is plus infinity.
(Contributed by Thierry Arnoux, 18-Dec-2016.)
|
| ⊢ (𝐴 ∈ ℝ* →
(+∞ ≤ 𝐴 ↔
𝐴 =
+∞)) |
| |
| Theorem | ngtmnft 10156 |
An extended real is not greater than minus infinity iff they are equal.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = -∞ ↔ ¬
-∞ < 𝐴)) |
| |
| Theorem | nmnfgt 10157 |
An extended real is greater than minus infinite iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
(-∞ < 𝐴 ↔
𝐴 ≠
-∞)) |
| |
| Theorem | xrrebnd 10158 |
An extended real is real iff it is strictly bounded by infinities.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ∈ ℝ ↔
(-∞ < 𝐴 ∧
𝐴 <
+∞))) |
| |
| Theorem | xrre 10159 |
A way of proving that an extended real is real. (Contributed by NM,
9-Mar-2006.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧
(-∞ < 𝐴 ∧
𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | xrre2 10160 |
An extended real between two others is real. (Contributed by NM,
6-Feb-2007.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ) |
| |
| Theorem | xrre3 10161 |
A way of proving that an extended real is real. (Contributed by FL,
29-May-2014.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐵 ≤ 𝐴 ∧ 𝐴 < +∞)) → 𝐴 ∈ ℝ) |
| |
| Theorem | ge0gtmnf 10162 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → -∞ <
𝐴) |
| |
| Theorem | ge0nemnf 10163 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → 𝐴 ≠
-∞) |
| |
| Theorem | xrrege0 10164 |
A nonnegative extended real that is less than a real bound is real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (0 ≤
𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | z2ge 10165* |
There exists an integer greater than or equal to any two others.
(Contributed by NM, 28-Aug-2005.)
|
| ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ∃𝑘 ∈ ℤ (𝑀 ≤ 𝑘 ∧ 𝑁 ≤ 𝑘)) |
| |
| Theorem | xnegeq 10166 |
Equality of two extended numbers with -𝑒 in front of them.
(Contributed by FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 = 𝐵 → -𝑒𝐴 = -𝑒𝐵) |
| |
| Theorem | xnegpnf 10167 |
Minus +∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.)
|
| ⊢ -𝑒+∞ =
-∞ |
| |
| Theorem | xnegmnf 10168 |
Minus -∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.) (Revised by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -𝑒-∞ =
+∞ |
| |
| Theorem | rexneg 10169 |
Minus a real number. Remark [BourbakiTop1] p. IV.15. (Contributed by
FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ →
-𝑒𝐴 =
-𝐴) |
| |
| Theorem | xneg0 10170 |
The negative of zero. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -𝑒0 = 0 |
| |
| Theorem | xnegcl 10171 |
Closure of extended real negative. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-𝑒𝐴
∈ ℝ*) |
| |
| Theorem | xnegneg 10172 |
Extended real version of negneg 8528. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-𝑒-𝑒𝐴 = 𝐴) |
| |
| Theorem | xneg11 10173 |
Extended real version of neg11 8529. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (-𝑒𝐴 = -𝑒𝐵 ↔ 𝐴 = 𝐵)) |
| |
| Theorem | xltnegi 10174 |
Forward direction of xltneg 10175. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) →
-𝑒𝐵
< -𝑒𝐴) |
| |
| Theorem | xltneg 10175 |
Extended real version of ltneg 8741. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 ↔
-𝑒𝐵
< -𝑒𝐴)) |
| |
| Theorem | xleneg 10176 |
Extended real version of leneg 8744. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 ≤ 𝐵 ↔
-𝑒𝐵
≤ -𝑒𝐴)) |
| |
| Theorem | xlt0neg1 10177 |
Extended real version of lt0neg1 8747. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < 0 ↔ 0 <
-𝑒𝐴)) |
| |
| Theorem | xlt0neg2 10178 |
Extended real version of lt0neg2 8748. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 <
𝐴 ↔
-𝑒𝐴
< 0)) |
| |
| Theorem | xle0neg1 10179 |
Extended real version of le0neg1 8749. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ≤ 0 ↔ 0 ≤
-𝑒𝐴)) |
| |
| Theorem | xle0neg2 10180 |
Extended real version of le0neg2 8750. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 ≤
𝐴 ↔
-𝑒𝐴
≤ 0)) |
| |
| Theorem | xrpnfdc 10181 |
An extended real is or is not plus infinity. (Contributed by Jim Kingdon,
13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
+∞) |
| |
| Theorem | xrmnfdc 10182 |
An extended real is or is not minus infinity. (Contributed by Jim
Kingdon, 13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
-∞) |
| |
| Theorem | xaddf 10183 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 21-Aug-2015.)
|
| ⊢ +𝑒 :(ℝ*
× ℝ*)⟶ℝ* |
| |
| Theorem | xaddval 10184 |
Value of the extended real addition operation. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵) =
if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞),
if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞),
if(𝐵 = +∞, +∞,
if(𝐵 = -∞, -∞,
(𝐴 + 𝐵)))))) |
| |
| Theorem | xaddpnf1 10185 |
Addition of positive infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒
+∞) = +∞) |
| |
| Theorem | xaddpnf2 10186 |
Addition of positive infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) →
(+∞ +𝑒 𝐴) = +∞) |
| |
| Theorem | xaddmnf1 10187 |
Addition of negative infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒
-∞) = -∞) |
| |
| Theorem | xaddmnf2 10188 |
Addition of negative infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) →
(-∞ +𝑒 𝐴) = -∞) |
| |
| Theorem | pnfaddmnf 10189 |
Addition of positive and negative infinity. This is often taken to be a
"null" value or out of the domain, but we define it (somewhat
arbitrarily)
to be zero so that the resulting function is total, which simplifies
proofs. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (+∞ +𝑒 -∞) =
0 |
| |
| Theorem | mnfaddpnf 10190 |
Addition of negative and positive infinity. This is often taken to be a
"null" value or out of the domain, but we define it (somewhat
arbitrarily)
to be zero so that the resulting function is total, which simplifies
proofs. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (-∞ +𝑒 +∞) =
0 |
| |
| Theorem | rexadd 10191 |
The extended real addition operation when both arguments are real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | rexsub 10192 |
Extended real subtraction when both arguments are real. (Contributed by
Mario Carneiro, 23-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒
-𝑒𝐵) =
(𝐴 − 𝐵)) |
| |
| Theorem | rexaddd 10193 |
The extended real addition operation when both arguments are real.
Deduction version of rexadd 10191. (Contributed by Glauco Siliprandi,
24-Dec-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ)
⇒ ⊢ (𝜑 → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | xnegcld 10194 |
Closure of extended real negative. (Contributed by Mario Carneiro,
28-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → -𝑒𝐴 ∈
ℝ*) |
| |
| Theorem | xrex 10195 |
The set of extended reals exists. (Contributed by NM, 24-Dec-2006.)
|
| ⊢ ℝ* ∈
V |
| |
| Theorem | xaddnemnf 10196 |
Closure of extended real addition in the subset ℝ* / {-∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ -∞))
→ (𝐴
+𝑒 𝐵)
≠ -∞) |
| |
| Theorem | xaddnepnf 10197 |
Closure of extended real addition in the subset ℝ* / {+∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ +∞))
→ (𝐴
+𝑒 𝐵)
≠ +∞) |
| |
| Theorem | xnegid 10198 |
Extended real version of negid 8525. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒
-𝑒𝐴) =
0) |
| |
| Theorem | xaddcl 10199 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵)
∈ ℝ*) |
| |
| Theorem | xaddcom 10200 |
The extended real addition operation is commutative. (Contributed by NM,
26-Dec-2011.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵) =
(𝐵 +𝑒
𝐴)) |