Theorem List for Intuitionistic Logic Explorer - 10201-10300 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | ltpnfd 10201 |
Any (finite) real is less than plus infinity. (Contributed by Glauco
Siliprandi, 11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ)
⇒ ⊢ (𝜑 → 𝐴 < +∞) |
| |
| Theorem | 0ltpnf 10202 |
Zero is less than plus infinity (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 < +∞ |
| |
| Theorem | mnflt 10203 |
Minus infinity is less than any (finite) real. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) |
| |
| Theorem | mnflt0 10204 |
Minus infinity is less than 0 (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ -∞ < 0 |
| |
| Theorem | mnfltpnf 10205 |
Minus infinity is less than plus infinity. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ -∞ < +∞ |
| |
| Theorem | mnfltxr 10206 |
Minus infinity is less than an extended real that is either real or plus
infinity. (Contributed by NM, 2-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞) → -∞ < 𝐴) |
| |
| Theorem | pnfnlt 10207 |
No extended real is greater than plus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
+∞ < 𝐴) |
| |
| Theorem | nltmnf 10208 |
No extended real is less than minus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
𝐴 <
-∞) |
| |
| Theorem | pnfge 10209 |
Plus infinity is an upper bound for extended reals. (Contributed by NM,
30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤
+∞) |
| |
| Theorem | 0lepnf 10210 |
0 less than or equal to positive infinity. (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 ≤ +∞ |
| |
| Theorem | nn0pnfge0 10211 |
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 10212 |
Minus infinity is less than or equal to any extended real. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → -∞
≤ 𝐴) |
| |
| Theorem | xrltnsym 10213 |
Ordering on the extended reals is not symmetric. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴)) |
| |
| Theorem | xrltnsym2 10214 |
'Less than' is antisymmetric and irreflexive for extended reals.
(Contributed by NM, 6-Feb-2007.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ ¬ (𝐴 < 𝐵 ∧ 𝐵 < 𝐴)) |
| |
| Theorem | xrlttr 10215 |
Ordering on the extended reals is transitive. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltso 10216 |
'Less than' is a weakly linear ordering on the extended reals.
(Contributed by NM, 15-Oct-2005.)
|
| ⊢ < Or
ℝ* |
| |
| Theorem | xrlttri3 10217 |
Extended real version of lttri3 8412. (Contributed by NM, 9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
| |
| Theorem | xrltle 10218 |
'Less than' implies 'less than or equal' for extended reals. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → 𝐴 ≤ 𝐵)) |
| |
| Theorem | xrltled 10219 |
'Less than' implies 'less than or equal to' for extended reals.
Deduction form of xrltle 10218. (Contributed by Glauco Siliprandi,
11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
| |
| Theorem | xrleid 10220 |
'Less than or equal to' is reflexive for extended reals. (Contributed by
NM, 7-Feb-2007.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤ 𝐴) |
| |
| Theorem | xrleidd 10221 |
'Less than or equal to' is reflexive for extended reals. Deduction form
of xrleid 10220. (Contributed by Glauco Siliprandi,
26-Jun-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐴) |
| |
| Theorem | xnn0dcle 10222 |
Decidability of ≤ for extended nonnegative integers.
(Contributed by
Jim Kingdon, 13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → DECID 𝐴 ≤ 𝐵) |
| |
| Theorem | xnn0letri 10223 |
Dichotomy for extended nonnegative integers. (Contributed by Jim Kingdon,
13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → (𝐴 ≤ 𝐵 ∨ 𝐵 ≤ 𝐴)) |
| |
| Theorem | xrletri3 10224 |
Trichotomy law for extended reals. (Contributed by FL, 2-Aug-2009.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))) |
| |
| Theorem | xrletrid 10225 |
Trichotomy law for extended reals. (Contributed by Glauco Siliprandi,
17-Aug-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐴) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
| |
| Theorem | xrlelttr 10226 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltletr 10227 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrletr 10228 |
Transitive law for ordering on extended reals. (Contributed by NM,
9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
| |
| Theorem | xrlttrd 10229 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrlelttrd 10230 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrltletrd 10231 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrletrd 10232 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐶) |
| |
| Theorem | xrltne 10233 |
'Less than' implies not equal for extended reals. (Contributed by NM,
20-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) → 𝐵 ≠ 𝐴) |
| |
| Theorem | nltpnft 10234 |
An extended real is not less than plus infinity iff they are equal.
(Contributed by NM, 30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = +∞ ↔ ¬ 𝐴 <
+∞)) |
| |
| Theorem | npnflt 10235 |
An extended real is less than plus infinity iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < +∞ ↔ 𝐴 ≠
+∞)) |
| |
| Theorem | xgepnf 10236 |
An extended real which is greater than plus infinity is plus infinity.
(Contributed by Thierry Arnoux, 18-Dec-2016.)
|
| ⊢ (𝐴 ∈ ℝ* →
(+∞ ≤ 𝐴 ↔
𝐴 =
+∞)) |
| |
| Theorem | ngtmnft 10237 |
An extended real is not greater than minus infinity iff they are equal.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = -∞ ↔ ¬
-∞ < 𝐴)) |
| |
| Theorem | nmnfgt 10238 |
An extended real is greater than minus infinite iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
(-∞ < 𝐴 ↔
𝐴 ≠
-∞)) |
| |
| Theorem | xrrebnd 10239 |
An extended real is real iff it is strictly bounded by infinities.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ∈ ℝ ↔
(-∞ < 𝐴 ∧
𝐴 <
+∞))) |
| |
| Theorem | xrre 10240 |
A way of proving that an extended real is real. (Contributed by NM,
9-Mar-2006.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧
(-∞ < 𝐴 ∧
𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | xrre2 10241 |
An extended real between two others is real. (Contributed by NM,
6-Feb-2007.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ) |
| |
| Theorem | xrre3 10242 |
A way of proving that an extended real is real. (Contributed by FL,
29-May-2014.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐵 ≤ 𝐴 ∧ 𝐴 < +∞)) → 𝐴 ∈ ℝ) |
| |
| Theorem | ge0gtmnf 10243 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → -∞ <
𝐴) |
| |
| Theorem | ge0nemnf 10244 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → 𝐴 ≠
-∞) |
| |
| Theorem | xrrege0 10245 |
A nonnegative extended real that is less than a real bound is real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (0 ≤
𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | z2ge 10246* |
There exists an integer greater than or equal to any two others.
(Contributed by NM, 28-Aug-2005.)
|
| ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ∃𝑘 ∈ ℤ (𝑀 ≤ 𝑘 ∧ 𝑁 ≤ 𝑘)) |
| |
| Theorem | xnegeq 10247 |
Equality of two extended numbers with -e in
front of them.
(Contributed by FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 = 𝐵 → -e𝐴 = -e𝐵) |
| |
| Theorem | xnegpnf 10248 |
Minus +∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.)
|
| ⊢ -e+∞ =
-∞ |
| |
| Theorem | xnegmnf 10249 |
Minus -∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.) (Revised by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -e-∞ =
+∞ |
| |
| Theorem | rexneg 10250 |
Minus a real number. Remark [BourbakiTop1] p. IV.15. (Contributed by
FL, 26-Dec-2011.) (Proof shortened by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ → -e𝐴 = -𝐴) |
| |
| Theorem | xneg0 10251 |
The negative of zero. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -e0 = 0 |
| |
| Theorem | xnegcl 10252 |
Closure of extended real negative. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-e𝐴 ∈
ℝ*) |
| |
| Theorem | xnegneg 10253 |
Extended real version of negneg 8584. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-e-e𝐴 = 𝐴) |
| |
| Theorem | xneg11 10254 |
Extended real version of neg11 8585. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (-e𝐴 =
-e𝐵 ↔
𝐴 = 𝐵)) |
| |
| Theorem | xltnegi 10255 |
Forward direction of xltneg 10256. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) → -e𝐵 < -e𝐴) |
| |
| Theorem | xltneg 10256 |
Extended real version of ltneg 8798. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 ↔ -e𝐵 < -e𝐴)) |
| |
| Theorem | xleneg 10257 |
Extended real version of leneg 8801. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 ≤ 𝐵 ↔ -e𝐵 ≤ -e𝐴)) |
| |
| Theorem | xlt0neg1 10258 |
Extended real version of lt0neg1 8804. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < 0 ↔ 0 <
-e𝐴)) |
| |
| Theorem | xlt0neg2 10259 |
Extended real version of lt0neg2 8805. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 <
𝐴 ↔
-e𝐴 <
0)) |
| |
| Theorem | xle0neg1 10260 |
Extended real version of le0neg1 8806. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ≤ 0 ↔ 0 ≤
-e𝐴)) |
| |
| Theorem | xle0neg2 10261 |
Extended real version of le0neg2 8807. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 ≤
𝐴 ↔
-e𝐴 ≤
0)) |
| |
| Theorem | xrpnfdc 10262 |
An extended real is or is not plus infinity. (Contributed by Jim Kingdon,
13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
+∞) |
| |
| Theorem | xrmnfdc 10263 |
An extended real is or is not minus infinity. (Contributed by Jim
Kingdon, 13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
-∞) |
| |
| Theorem | xaddf 10264 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 21-Aug-2015.)
|
| ⊢ +e :(ℝ* ×
ℝ*)⟶ℝ* |
| |
| Theorem | xaddval 10265 |
Value of the extended real addition operation. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 +e
𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞),
if(𝐵 = +∞, +∞,
if(𝐵 = -∞, -∞,
(𝐴 + 𝐵)))))) |
| |
| Theorem | xaddpnf1 10266 |
Addition of positive infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) =
+∞) |
| |
| Theorem | xaddpnf2 10267 |
Addition of positive infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) →
(+∞ +e 𝐴)
= +∞) |
| |
| Theorem | xaddmnf1 10268 |
Addition of negative infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +e -∞) =
-∞) |
| |
| Theorem | xaddmnf2 10269 |
Addition of negative infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) →
(-∞ +e 𝐴)
= -∞) |
| |
| Theorem | pnfaddmnf 10270 |
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.)
|
| ⊢ (+∞ +e -∞) =
0 |
| |
| Theorem | mnfaddpnf 10271 |
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.)
|
| ⊢ (-∞ +e +∞) =
0 |
| |
| Theorem | rexadd 10272 |
The extended real addition operation when both arguments are real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +e 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | rexsub 10273 |
Extended real subtraction when both arguments are real. (Contributed by
Mario Carneiro, 23-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +e -e𝐵) = (𝐴 − 𝐵)) |
| |
| Theorem | rexaddd 10274 |
The extended real addition operation when both arguments are real.
Deduction version of rexadd 10272. (Contributed by Glauco Siliprandi,
24-Dec-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ)
⇒ ⊢ (𝜑 → (𝐴 +e 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | xnegcld 10275 |
Closure of extended real negative. (Contributed by Mario Carneiro,
28-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → -e𝐴 ∈
ℝ*) |
| |
| Theorem | xrex 10276 |
The set of extended reals exists. (Contributed by NM, 24-Dec-2006.)
|
| ⊢ ℝ* ∈
V |
| |
| Theorem | xaddnemnf 10277 |
Closure of extended real addition in the subset ℝ* / {-∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ -∞))
→ (𝐴 +e
𝐵) ≠
-∞) |
| |
| Theorem | xaddnepnf 10278 |
Closure of extended real addition in the subset ℝ* / {+∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ +∞))
→ (𝐴 +e
𝐵) ≠
+∞) |
| |
| Theorem | xnegid 10279 |
Extended real version of negid 8581. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 +e
-e𝐴) =
0) |
| |
| Theorem | xaddcl 10280 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 +e
𝐵) ∈
ℝ*) |
| |
| Theorem | xaddcom 10281 |
The extended real addition operation is commutative. (Contributed by NM,
26-Dec-2011.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 +e
𝐵) = (𝐵 +e 𝐴)) |
| |
| Theorem | xaddid1 10282 |
Extended real version of addrid 8472. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 +e 0) = 𝐴) |
| |
| Theorem | xaddid2 10283 |
Extended real version of addlid 8473. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0
+e 𝐴) = 𝐴) |
| |
| Theorem | xaddid1d 10284 |
0 is a right identity for extended real addition.
(Contributed by
Glauco Siliprandi, 17-Aug-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → (𝐴 +e 0) = 𝐴) |
| |
| Theorem | xnn0lenn0nn0 10285 |
An extended nonnegative integer which is less than or equal to a
nonnegative integer is a nonnegative integer. (Contributed by AV,
24-Nov-2021.)
|
| ⊢ ((𝑀 ∈ ℕ0*
∧ 𝑁 ∈
ℕ0 ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈
ℕ0) |
| |
| Theorem | xnn0le2is012 10286 |
An extended nonnegative integer which is less than or equal to 2 is either
0 or 1 or 2. (Contributed by AV, 24-Nov-2021.)
|
| ⊢ ((𝑁 ∈ ℕ0*
∧ 𝑁 ≤ 2) →
(𝑁 = 0 ∨ 𝑁 = 1 ∨ 𝑁 = 2)) |
| |
| Theorem | xnn0xadd0 10287 |
The sum of two extended nonnegative integers is 0 iff
each of the two
extended nonnegative integers is 0. (Contributed
by AV,
14-Dec-2020.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → ((𝐴 +e 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| |
| Theorem | xnegdi 10288 |
Extended real version of negdi 8591. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ -e(𝐴
+e 𝐵) =
(-e𝐴
+e -e𝐵)) |
| |
| Theorem | xaddass 10289 |
Associativity of extended real addition. The correct condition here is
"it is not the case that both +∞ and
-∞ appear as one of
𝐴,
𝐵, 𝐶, i.e. ¬
{+∞, -∞} ⊆ {𝐴, 𝐵, 𝐶}", but this
condition is difficult to work with, so we break the theorem into two
parts: this one, where -∞ is not present in
𝐴, 𝐵, 𝐶, and
xaddass2 10290, where +∞ is
not present. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ -∞)
∧ (𝐶 ∈
ℝ* ∧ 𝐶 ≠ -∞)) → ((𝐴 +e 𝐵) +e 𝐶) = (𝐴 +e (𝐵 +e 𝐶))) |
| |
| Theorem | xaddass2 10290 |
Associativity of extended real addition. See xaddass 10289 for notes on the
hypotheses. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ +∞)
∧ (𝐶 ∈
ℝ* ∧ 𝐶 ≠ +∞)) → ((𝐴 +e 𝐵) +e 𝐶) = (𝐴 +e (𝐵 +e 𝐶))) |
| |
| Theorem | xpncan 10291 |
Extended real version of pncan 8540. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐴 +e 𝐵) +e
-e𝐵) = 𝐴) |
| |
| Theorem | xnpcan 10292 |
Extended real version of npcan 8543. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐴 +e
-e𝐵)
+e 𝐵) = 𝐴) |
| |
| Theorem | xleadd1a 10293 |
Extended real version of leadd1 8766; note that the converse implication is
not true, unlike the real version (for example 0 <
1 but
(1 +e +∞) ≤ (0 +e
+∞)). (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) ∧ 𝐴 ≤ 𝐵) → (𝐴 +e 𝐶) ≤ (𝐵 +e 𝐶)) |
| |
| Theorem | xleadd2a 10294 |
Commuted form of xleadd1a 10293. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) ∧ 𝐴 ≤ 𝐵) → (𝐶 +e 𝐴) ≤ (𝐶 +e 𝐵)) |
| |
| Theorem | xleadd1 10295 |
Weakened version of xleadd1a 10293 under which the reverse implication is
true. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈ ℝ)
→ (𝐴 ≤ 𝐵 ↔ (𝐴 +e 𝐶) ≤ (𝐵 +e 𝐶))) |
| |
| Theorem | xltadd1 10296 |
Extended real version of ltadd1 8765. (Contributed by Mario Carneiro,
23-Aug-2015.) (Revised by Jim Kingdon, 16-Apr-2023.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈ ℝ)
→ (𝐴 < 𝐵 ↔ (𝐴 +e 𝐶) < (𝐵 +e 𝐶))) |
| |
| Theorem | xltadd2 10297 |
Extended real version of ltadd2 8755. (Contributed by Mario Carneiro,
23-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈ ℝ)
→ (𝐴 < 𝐵 ↔ (𝐶 +e 𝐴) < (𝐶 +e 𝐵))) |
| |
| Theorem | xaddge0 10298 |
The sum of nonnegative extended reals is nonnegative. (Contributed by
Mario Carneiro, 21-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
∧ (0 ≤ 𝐴 ∧ 0
≤ 𝐵)) → 0 ≤
(𝐴 +e 𝐵)) |
| |
| Theorem | xle2add 10299 |
Extended real version of le2add 8780. (Contributed by Mario Carneiro,
23-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
∧ (𝐶 ∈
ℝ* ∧ 𝐷 ∈ ℝ*)) →
((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +e 𝐵) ≤ (𝐶 +e 𝐷))) |
| |
| Theorem | xlt2add 10300 |
Extended real version of lt2add 8781. Note that ltleadd 8782, which has
weaker assumptions, is not true for the extended reals (since
0 + +∞ < 1 + +∞ fails).
(Contributed by Mario Carneiro,
23-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
∧ (𝐶 ∈
ℝ* ∧ 𝐷 ∈ ℝ*)) →
((𝐴 < 𝐶 ∧ 𝐵 < 𝐷) → (𝐴 +e 𝐵) < (𝐶 +e 𝐷))) |