Theorem List for Intuitionistic Logic Explorer - 10001-10100 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Definition | df-xadd 10001* |
Define addition over extended real numbers. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ +𝑒 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ*
↦ if(𝑥 = +∞,
if(𝑦 = -∞, 0,
+∞), if(𝑥 =
-∞, if(𝑦 = +∞,
0, -∞), if(𝑦 =
+∞, +∞, if(𝑦 =
-∞, -∞, (𝑥 +
𝑦)))))) |
| |
| Definition | df-xmul 10002* |
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 10003 |
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 10004 |
Membership in the set of extended reals. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) |
| |
| Theorem | xrnemnf 10005 |
An extended real other than minus infinity is real or positive infinite.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞)) |
| |
| Theorem | xrnepnf 10006 |
An extended real other than plus infinity is real or negative infinite.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) |
| |
| Theorem | xrltnr 10007 |
The extended real 'less than' is irreflexive. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
𝐴 < 𝐴) |
| |
| Theorem | ltpnf 10008 |
Any (finite) real is less than plus infinity. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ → 𝐴 < +∞) |
| |
| Theorem | ltpnfd 10009 |
Any (finite) real is less than plus infinity. (Contributed by Glauco
Siliprandi, 11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ)
⇒ ⊢ (𝜑 → 𝐴 < +∞) |
| |
| Theorem | 0ltpnf 10010 |
Zero is less than plus infinity (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 < +∞ |
| |
| Theorem | mnflt 10011 |
Minus infinity is less than any (finite) real. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ → -∞ < 𝐴) |
| |
| Theorem | mnflt0 10012 |
Minus infinity is less than 0 (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ -∞ < 0 |
| |
| Theorem | mnfltpnf 10013 |
Minus infinity is less than plus infinity. (Contributed by NM,
14-Oct-2005.)
|
| ⊢ -∞ < +∞ |
| |
| Theorem | mnfltxr 10014 |
Minus infinity is less than an extended real that is either real or plus
infinity. (Contributed by NM, 2-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞) → -∞ < 𝐴) |
| |
| Theorem | pnfnlt 10015 |
No extended real is greater than plus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
+∞ < 𝐴) |
| |
| Theorem | nltmnf 10016 |
No extended real is less than minus infinity. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ (𝐴 ∈ ℝ* → ¬
𝐴 <
-∞) |
| |
| Theorem | pnfge 10017 |
Plus infinity is an upper bound for extended reals. (Contributed by NM,
30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤
+∞) |
| |
| Theorem | 0lepnf 10018 |
0 less than or equal to positive infinity. (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 0 ≤ +∞ |
| |
| Theorem | nn0pnfge0 10019 |
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 10020 |
Minus infinity is less than or equal to any extended real. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → -∞
≤ 𝐴) |
| |
| Theorem | xrltnsym 10021 |
Ordering on the extended reals is not symmetric. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → ¬ 𝐵 < 𝐴)) |
| |
| Theorem | xrltnsym2 10022 |
'Less than' is antisymmetric and irreflexive for extended reals.
(Contributed by NM, 6-Feb-2007.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ ¬ (𝐴 < 𝐵 ∧ 𝐵 < 𝐴)) |
| |
| Theorem | xrlttr 10023 |
Ordering on the extended reals is transitive. (Contributed by NM,
15-Oct-2005.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltso 10024 |
'Less than' is a weakly linear ordering on the extended reals.
(Contributed by NM, 15-Oct-2005.)
|
| ⊢ < Or
ℝ* |
| |
| Theorem | xrlttri3 10025 |
Extended real version of lttri3 8252. (Contributed by NM, 9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (¬ 𝐴 < 𝐵 ∧ ¬ 𝐵 < 𝐴))) |
| |
| Theorem | xrltle 10026 |
'Less than' implies 'less than or equal' for extended reals. (Contributed
by NM, 19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 → 𝐴 ≤ 𝐵)) |
| |
| Theorem | xrltled 10027 |
'Less than' implies 'less than or equal to' for extended reals.
Deduction form of xrltle 10026. (Contributed by Glauco Siliprandi,
11-Dec-2019.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐵) |
| |
| Theorem | xrleid 10028 |
'Less than or equal to' is reflexive for extended reals. (Contributed by
NM, 7-Feb-2007.)
|
| ⊢ (𝐴 ∈ ℝ* → 𝐴 ≤ 𝐴) |
| |
| Theorem | xrleidd 10029 |
'Less than or equal to' is reflexive for extended reals. Deduction form
of xrleid 10028. (Contributed by Glauco Siliprandi,
26-Jun-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐴) |
| |
| Theorem | xnn0dcle 10030 |
Decidability of ≤ for extended nonnegative integers.
(Contributed by
Jim Kingdon, 13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → DECID 𝐴 ≤ 𝐵) |
| |
| Theorem | xnn0letri 10031 |
Dichotomy for extended nonnegative integers. (Contributed by Jim Kingdon,
13-Oct-2024.)
|
| ⊢ ((𝐴 ∈ ℕ0*
∧ 𝐵 ∈
ℕ0*) → (𝐴 ≤ 𝐵 ∨ 𝐵 ≤ 𝐴)) |
| |
| Theorem | xrletri3 10032 |
Trichotomy law for extended reals. (Contributed by FL, 2-Aug-2009.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 = 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))) |
| |
| Theorem | xrletrid 10033 |
Trichotomy law for extended reals. (Contributed by Glauco Siliprandi,
17-Aug-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐴) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
| |
| Theorem | xrlelttr 10034 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 < 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrltletr 10035 |
Transitive law for ordering on extended reals. (Contributed by NM,
19-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 < 𝐶)) |
| |
| Theorem | xrletr 10036 |
Transitive law for ordering on extended reals. (Contributed by NM,
9-Feb-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) → ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) → 𝐴 ≤ 𝐶)) |
| |
| Theorem | xrlttrd 10037 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrlelttrd 10038 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 < 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrltletrd 10039 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 < 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 < 𝐶) |
| |
| Theorem | xrletrd 10040 |
Transitive law for ordering on extended reals. (Contributed by Mario
Carneiro, 23-Aug-2015.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ*) & ⊢ (𝜑 → 𝐵 ∈ ℝ*) & ⊢ (𝜑 → 𝐶 ∈ ℝ*) & ⊢ (𝜑 → 𝐴 ≤ 𝐵)
& ⊢ (𝜑 → 𝐵 ≤ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ≤ 𝐶) |
| |
| Theorem | xrltne 10041 |
'Less than' implies not equal for extended reals. (Contributed by NM,
20-Jan-2006.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) → 𝐵 ≠ 𝐴) |
| |
| Theorem | nltpnft 10042 |
An extended real is not less than plus infinity iff they are equal.
(Contributed by NM, 30-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = +∞ ↔ ¬ 𝐴 <
+∞)) |
| |
| Theorem | npnflt 10043 |
An extended real is less than plus infinity iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < +∞ ↔ 𝐴 ≠
+∞)) |
| |
| Theorem | xgepnf 10044 |
An extended real which is greater than plus infinity is plus infinity.
(Contributed by Thierry Arnoux, 18-Dec-2016.)
|
| ⊢ (𝐴 ∈ ℝ* →
(+∞ ≤ 𝐴 ↔
𝐴 =
+∞)) |
| |
| Theorem | ngtmnft 10045 |
An extended real is not greater than minus infinity iff they are equal.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 = -∞ ↔ ¬
-∞ < 𝐴)) |
| |
| Theorem | nmnfgt 10046 |
An extended real is greater than minus infinite iff they are not equal.
(Contributed by Jim Kingdon, 17-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
(-∞ < 𝐴 ↔
𝐴 ≠
-∞)) |
| |
| Theorem | xrrebnd 10047 |
An extended real is real iff it is strictly bounded by infinities.
(Contributed by NM, 2-Feb-2006.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ∈ ℝ ↔
(-∞ < 𝐴 ∧
𝐴 <
+∞))) |
| |
| Theorem | xrre 10048 |
A way of proving that an extended real is real. (Contributed by NM,
9-Mar-2006.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧
(-∞ < 𝐴 ∧
𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | xrre2 10049 |
An extended real between two others is real. (Contributed by NM,
6-Feb-2007.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐶 ∈
ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → 𝐵 ∈ ℝ) |
| |
| Theorem | xrre3 10050 |
A way of proving that an extended real is real. (Contributed by FL,
29-May-2014.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (𝐵 ≤ 𝐴 ∧ 𝐴 < +∞)) → 𝐴 ∈ ℝ) |
| |
| Theorem | ge0gtmnf 10051 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → -∞ <
𝐴) |
| |
| Theorem | ge0nemnf 10052 |
A nonnegative extended real is greater than negative infinity.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 0 ≤
𝐴) → 𝐴 ≠
-∞) |
| |
| Theorem | xrrege0 10053 |
A nonnegative extended real that is less than a real bound is real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) ∧ (0 ≤
𝐴 ∧ 𝐴 ≤ 𝐵)) → 𝐴 ∈ ℝ) |
| |
| Theorem | z2ge 10054* |
There exists an integer greater than or equal to any two others.
(Contributed by NM, 28-Aug-2005.)
|
| ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ∃𝑘 ∈ ℤ (𝑀 ≤ 𝑘 ∧ 𝑁 ≤ 𝑘)) |
| |
| Theorem | xnegeq 10055 |
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 10056 |
Minus +∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.)
|
| ⊢ -𝑒+∞ =
-∞ |
| |
| Theorem | xnegmnf 10057 |
Minus -∞. Remark of [BourbakiTop1] p. IV.15. (Contributed by FL,
26-Dec-2011.) (Revised by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -𝑒-∞ =
+∞ |
| |
| Theorem | rexneg 10058 |
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 10059 |
The negative of zero. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ -𝑒0 = 0 |
| |
| Theorem | xnegcl 10060 |
Closure of extended real negative. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-𝑒𝐴
∈ ℝ*) |
| |
| Theorem | xnegneg 10061 |
Extended real version of negneg 8422. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* →
-𝑒-𝑒𝐴 = 𝐴) |
| |
| Theorem | xneg11 10062 |
Extended real version of neg11 8423. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (-𝑒𝐴 = -𝑒𝐵 ↔ 𝐴 = 𝐵)) |
| |
| Theorem | xltnegi 10063 |
Forward direction of xltneg 10064. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*
∧ 𝐴 < 𝐵) →
-𝑒𝐵
< -𝑒𝐴) |
| |
| Theorem | xltneg 10064 |
Extended real version of ltneg 8635. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 < 𝐵 ↔
-𝑒𝐵
< -𝑒𝐴)) |
| |
| Theorem | xleneg 10065 |
Extended real version of leneg 8638. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴 ≤ 𝐵 ↔
-𝑒𝐵
≤ -𝑒𝐴)) |
| |
| Theorem | xlt0neg1 10066 |
Extended real version of lt0neg1 8641. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 < 0 ↔ 0 <
-𝑒𝐴)) |
| |
| Theorem | xlt0neg2 10067 |
Extended real version of lt0neg2 8642. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 <
𝐴 ↔
-𝑒𝐴
< 0)) |
| |
| Theorem | xle0neg1 10068 |
Extended real version of le0neg1 8643. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 ≤ 0 ↔ 0 ≤
-𝑒𝐴)) |
| |
| Theorem | xle0neg2 10069 |
Extended real version of le0neg2 8644. (Contributed by Mario Carneiro,
9-Sep-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0 ≤
𝐴 ↔
-𝑒𝐴
≤ 0)) |
| |
| Theorem | xrpnfdc 10070 |
An extended real is or is not plus infinity. (Contributed by Jim Kingdon,
13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
+∞) |
| |
| Theorem | xrmnfdc 10071 |
An extended real is or is not minus infinity. (Contributed by Jim
Kingdon, 13-Apr-2023.)
|
| ⊢ (𝐴 ∈ ℝ* →
DECID 𝐴 =
-∞) |
| |
| Theorem | xaddf 10072 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 21-Aug-2015.)
|
| ⊢ +𝑒 :(ℝ*
× ℝ*)⟶ℝ* |
| |
| Theorem | xaddval 10073 |
Value of the extended real addition operation. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵) =
if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞),
if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞),
if(𝐵 = +∞, +∞,
if(𝐵 = -∞, -∞,
(𝐴 + 𝐵)))))) |
| |
| Theorem | xaddpnf1 10074 |
Addition of positive infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒
+∞) = +∞) |
| |
| Theorem | xaddpnf2 10075 |
Addition of positive infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) →
(+∞ +𝑒 𝐴) = +∞) |
| |
| Theorem | xaddmnf1 10076 |
Addition of negative infinity on the right. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒
-∞) = -∞) |
| |
| Theorem | xaddmnf2 10077 |
Addition of negative infinity on the left. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) →
(-∞ +𝑒 𝐴) = -∞) |
| |
| Theorem | pnfaddmnf 10078 |
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 10079 |
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 10080 |
The extended real addition operation when both arguments are real.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | rexsub 10081 |
Extended real subtraction when both arguments are real. (Contributed by
Mario Carneiro, 23-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒
-𝑒𝐵) =
(𝐴 − 𝐵)) |
| |
| Theorem | rexaddd 10082 |
The extended real addition operation when both arguments are real.
Deduction version of rexadd 10080. (Contributed by Glauco Siliprandi,
24-Dec-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ)
⇒ ⊢ (𝜑 → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| |
| Theorem | xnegcld 10083 |
Closure of extended real negative. (Contributed by Mario Carneiro,
28-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → -𝑒𝐴 ∈
ℝ*) |
| |
| Theorem | xrex 10084 |
The set of extended reals exists. (Contributed by NM, 24-Dec-2006.)
|
| ⊢ ℝ* ∈
V |
| |
| Theorem | xaddnemnf 10085 |
Closure of extended real addition in the subset ℝ* / {-∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ -∞))
→ (𝐴
+𝑒 𝐵)
≠ -∞) |
| |
| Theorem | xaddnepnf 10086 |
Closure of extended real addition in the subset ℝ* / {+∞}.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ +∞))
→ (𝐴
+𝑒 𝐵)
≠ +∞) |
| |
| Theorem | xnegid 10087 |
Extended real version of negid 8419. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒
-𝑒𝐴) =
0) |
| |
| Theorem | xaddcl 10088 |
The extended real addition operation is closed in extended reals.
(Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵)
∈ ℝ*) |
| |
| Theorem | xaddcom 10089 |
The extended real addition operation is commutative. (Contributed by NM,
26-Dec-2011.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ (𝐴
+𝑒 𝐵) =
(𝐵 +𝑒
𝐴)) |
| |
| Theorem | xaddid1 10090 |
Extended real version of addrid 8310. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) =
𝐴) |
| |
| Theorem | xaddid2 10091 |
Extended real version of addlid 8311. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ (𝐴 ∈ ℝ* → (0
+𝑒 𝐴) =
𝐴) |
| |
| Theorem | xaddid1d 10092 |
0 is a right identity for extended real addition.
(Contributed by
Glauco Siliprandi, 17-Aug-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈
ℝ*) ⇒ ⊢ (𝜑 → (𝐴 +𝑒 0) = 𝐴) |
| |
| Theorem | xnn0lenn0nn0 10093 |
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 10094 |
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 10095 |
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*) → ((𝐴 +𝑒 𝐵) = 0 ↔ (𝐴 = 0 ∧ 𝐵 = 0))) |
| |
| Theorem | xnegdi 10096 |
Extended real version of negdi 8429. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)
→ -𝑒(𝐴 +𝑒 𝐵) = (-𝑒𝐴 +𝑒
-𝑒𝐵)) |
| |
| Theorem | xaddass 10097 |
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 10098, where +∞ is
not present. (Contributed by Mario
Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ -∞)
∧ (𝐶 ∈
ℝ* ∧ 𝐶 ≠ -∞)) → ((𝐴 +𝑒 𝐵) +𝑒 𝐶) = (𝐴 +𝑒 (𝐵 +𝑒 𝐶))) |
| |
| Theorem | xaddass2 10098 |
Associativity of extended real addition. See xaddass 10097 for notes on the
hypotheses. (Contributed by Mario Carneiro, 20-Aug-2015.)
|
| ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ*
∧ 𝐵 ≠ +∞)
∧ (𝐶 ∈
ℝ* ∧ 𝐶 ≠ +∞)) → ((𝐴 +𝑒 𝐵) +𝑒 𝐶) = (𝐴 +𝑒 (𝐵 +𝑒 𝐶))) |
| |
| Theorem | xpncan 10099 |
Extended real version of pncan 8378. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐴 +𝑒 𝐵) +𝑒
-𝑒𝐵) =
𝐴) |
| |
| Theorem | xnpcan 10100 |
Extended real version of npcan 8381. (Contributed by Mario Carneiro,
20-Aug-2015.)
|
| ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ) → ((𝐴 +𝑒
-𝑒𝐵)
+𝑒 𝐵) =
𝐴) |