Theorem List for Intuitionistic Logic Explorer - 8801-8900 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | mulge0d 8801 |
The product of two nonnegative numbers is nonnegative. (Contributed by
Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 0 ≤ 𝐴)
& ⊢ (𝜑 → 0 ≤ 𝐵) ⇒ ⊢ (𝜑 → 0 ≤ (𝐴 · 𝐵)) |
| |
| Theorem | apti 8802 |
Complex apartness is tight. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 = 𝐵 ↔ ¬ 𝐴 # 𝐵)) |
| |
| Theorem | apne 8803 |
Apartness implies negated equality. We cannot in general prove the
converse (as shown at neapmkv 16693), which is the whole point of having
separate notations for apartness and negated equality. (Contributed by
Jim Kingdon, 21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 # 𝐵 → 𝐴 ≠ 𝐵)) |
| |
| Theorem | apcon4bid 8804 |
Contrapositive law deduction for apartness. (Contributed by Jim
Kingdon, 31-Jul-2023.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐷 ∈ ℂ) & ⊢ (𝜑 → (𝐴 # 𝐵 ↔ 𝐶 # 𝐷)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| |
| Theorem | leltap 8805 |
≤ implies 'less than' is 'apart'. (Contributed by
Jim Kingdon,
13-Aug-2021.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴 < 𝐵 ↔ 𝐵 # 𝐴)) |
| |
| Theorem | gt0ap0 8806 |
Positive implies apart from zero. (Contributed by Jim Kingdon,
27-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 # 0) |
| |
| Theorem | gt0ap0i 8807 |
Positive means apart from zero (useful for ordering theorems involving
division). (Contributed by Jim Kingdon, 27-Feb-2020.)
|
| ⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 < 𝐴 → 𝐴 # 0) |
| |
| Theorem | gt0ap0ii 8808 |
Positive implies apart from zero. (Contributed by Jim Kingdon,
27-Feb-2020.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 0 < 𝐴 ⇒ ⊢ 𝐴 # 0 |
| |
| Theorem | gt0ap0d 8809 |
Positive implies apart from zero. Because of the way we define
#, 𝐴 must be an element of ℝ, not just ℝ*.
(Contributed by Jim Kingdon, 27-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 0 < 𝐴) ⇒ ⊢ (𝜑 → 𝐴 # 0) |
| |
| Theorem | negap0 8810 |
A number is apart from zero iff its negative is apart from zero.
(Contributed by Jim Kingdon, 27-Feb-2020.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴 # 0 ↔ -𝐴 # 0)) |
| |
| Theorem | negap0d 8811 |
The negative of a number apart from zero is apart from zero.
(Contributed by Jim Kingdon, 25-Feb-2024.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 0) ⇒ ⊢ (𝜑 → -𝐴 # 0) |
| |
| Theorem | ltleap 8812 |
Less than in terms of non-strict order and apartness. (Contributed by Jim
Kingdon, 28-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵))) |
| |
| Theorem | ltap 8813 |
'Less than' implies apart. (Contributed by Jim Kingdon, 12-Aug-2021.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) → 𝐵 # 𝐴) |
| |
| Theorem | gtapii 8814 |
'Greater than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ & ⊢ 𝐴 < 𝐵 ⇒ ⊢ 𝐵 # 𝐴 |
| |
| Theorem | ltapii 8815 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ & ⊢ 𝐴 < 𝐵 ⇒ ⊢ 𝐴 # 𝐵 |
| |
| Theorem | ltapi 8816 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ (𝐴 < 𝐵 → 𝐵 # 𝐴) |
| |
| Theorem | gtapd 8817 |
'Greater than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐵 # 𝐴) |
| |
| Theorem | ltapd 8818 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐴 # 𝐵) |
| |
| Theorem | leltapd 8819 |
≤ implies 'less than' is 'apart'. (Contributed by
Jim Kingdon,
13-Aug-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 ≤ 𝐵) ⇒ ⊢ (𝜑 → (𝐴 < 𝐵 ↔ 𝐵 # 𝐴)) |
| |
| Theorem | ap0gt0 8820 |
A nonnegative number is apart from zero if and only if it is positive.
(Contributed by Jim Kingdon, 11-Aug-2021.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 # 0 ↔ 0 < 𝐴)) |
| |
| Theorem | ap0gt0d 8821 |
A nonzero nonnegative number is positive. (Contributed by Jim
Kingdon, 11-Aug-2021.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 0 ≤ 𝐴)
& ⊢ (𝜑 → 𝐴 # 0) ⇒ ⊢ (𝜑 → 0 < 𝐴) |
| |
| Theorem | apsub1 8822 |
Subtraction respects apartness. Analogue of subcan2 8404 for apartness.
(Contributed by Jim Kingdon, 6-Jan-2022.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 # 𝐵 ↔ (𝐴 − 𝐶) # (𝐵 − 𝐶))) |
| |
| Theorem | subap0 8823 |
Two numbers being apart is equivalent to their difference being apart from
zero. (Contributed by Jim Kingdon, 25-Dec-2022.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) # 0 ↔ 𝐴 # 𝐵)) |
| |
| Theorem | subap0d 8824 |
Two numbers apart from each other have difference apart from zero.
(Contributed by Jim Kingdon, 12-Aug-2021.) (Proof shortened by BJ,
15-Aug-2024.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 𝐵) ⇒ ⊢ (𝜑 → (𝐴 − 𝐵) # 0) |
| |
| Theorem | cnstab 8825 |
Equality of complex numbers is stable. Stability here means
¬ ¬ 𝐴 = 𝐵 → 𝐴 = 𝐵 as defined at df-stab 838. This theorem for real
numbers is Proposition 5.2 of [BauerHanson], p. 27. (Contributed by Jim
Kingdon, 1-Aug-2023.) (Proof shortened by BJ, 15-Aug-2024.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → STAB
𝐴 = 𝐵) |
| |
| Theorem | aprcl 8826 |
Reverse closure for apartness. (Contributed by Jim Kingdon,
19-Dec-2023.)
|
| ⊢ (𝐴 # 𝐵 → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ)) |
| |
| Theorem | apsscn 8827* |
The points apart from a given point are complex numbers. (Contributed
by Jim Kingdon, 19-Dec-2023.)
|
| ⊢ {𝑥 ∈ 𝐴 ∣ 𝑥 # 𝐵} ⊆ ℂ |
| |
| Theorem | lt0ap0 8828 |
A number which is less than zero is apart from zero. (Contributed by Jim
Kingdon, 25-Feb-2024.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 # 0) |
| |
| Theorem | lt0ap0d 8829 |
A real number less than zero is apart from zero. Deduction form.
(Contributed by Jim Kingdon, 24-Feb-2024.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 0) ⇒ ⊢ (𝜑 → 𝐴 # 0) |
| |
| Theorem | aptap 8830 |
Complex apartness (as defined at df-ap 8762) is a tight apartness (as
defined at df-tap 7469). (Contributed by Jim Kingdon, 16-Feb-2025.)
|
| ⊢ # TAp ℂ |
| |
| 4.3.7 Reciprocals
|
| |
| Theorem | recextlem1 8831 |
Lemma for recexap 8833. (Contributed by Eric Schmidt, 23-May-2007.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + (i · 𝐵)) · (𝐴 − (i · 𝐵))) = ((𝐴 · 𝐴) + (𝐵 · 𝐵))) |
| |
| Theorem | recexaplem2 8832 |
Lemma for recexap 8833. (Contributed by Jim Kingdon, 20-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐴 + (i · 𝐵)) # 0) → ((𝐴 · 𝐴) + (𝐵 · 𝐵)) # 0) |
| |
| Theorem | recexap 8833* |
Existence of reciprocal of nonzero complex number. (Contributed by Jim
Kingdon, 20-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℂ (𝐴 · 𝑥) = 1) |
| |
| Theorem | mulap0 8834 |
The product of two numbers apart from zero is apart from zero. Lemma
2.15 of [Geuvers], p. 6. (Contributed
by Jim Kingdon, 22-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → (𝐴 · 𝐵) # 0) |
| |
| Theorem | mulap0b 8835 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 # 0 ∧ 𝐵 # 0) ↔ (𝐴 · 𝐵) # 0)) |
| |
| Theorem | mulap0i 8836 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 23-Feb-2020.)
|
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐴 # 0 & ⊢ 𝐵 # 0
⇒ ⊢ (𝐴 · 𝐵) # 0 |
| |
| Theorem | mulap0bd 8837 |
The product of two numbers apart from zero is apart from zero. Exercise
11.11 of [HoTT], p. (varies).
(Contributed by Jim Kingdon,
24-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ)
⇒ ⊢ (𝜑 → ((𝐴 # 0 ∧ 𝐵 # 0) ↔ (𝐴 · 𝐵) # 0)) |
| |
| Theorem | mulap0d 8838 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 23-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 0) & ⊢ (𝜑 → 𝐵 # 0) ⇒ ⊢ (𝜑 → (𝐴 · 𝐵) # 0) |
| |
| Theorem | mulap0bad 8839 |
A factor of a complex number apart from zero is apart from zero.
Partial converse of mulap0d 8838 and consequence of mulap0bd 8837.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → (𝐴 · 𝐵) # 0) ⇒ ⊢ (𝜑 → 𝐴 # 0) |
| |
| Theorem | mulap0bbd 8840 |
A factor of a complex number apart from zero is apart from zero.
Partial converse of mulap0d 8838 and consequence of mulap0bd 8837.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → (𝐴 · 𝐵) # 0) ⇒ ⊢ (𝜑 → 𝐵 # 0) |
| |
| Theorem | mulcanapd 8841 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) ⇒ ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | mulcanap2d 8842 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) ⇒ ⊢ (𝜑 → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | mulcanapad 8843 |
Cancellation of a nonzero factor on the left in an equation. One-way
deduction form of mulcanapd 8841. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) & ⊢ (𝜑 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
| |
| Theorem | mulcanap2ad 8844 |
Cancellation of a nonzero factor on the right in an equation. One-way
deduction form of mulcanap2d 8842. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) & ⊢ (𝜑 → (𝐴 · 𝐶) = (𝐵 · 𝐶)) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
| |
| Theorem | mulcanap 8845 |
Cancellation law for multiplication (full theorem form). (Contributed by
Jim Kingdon, 21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | mulcanap2 8846 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | mulcanapi 8847 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐶 ∈ ℂ & ⊢ 𝐶 # 0
⇒ ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵) |
| |
| Theorem | muleqadd 8848 |
Property of numbers whose product equals their sum. Equation 5 of
[Kreyszig] p. 12. (Contributed by NM,
13-Nov-2006.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵) = (𝐴 + 𝐵) ↔ ((𝐴 − 1) · (𝐵 − 1)) = 1)) |
| |
| Theorem | receuap 8849* |
Existential uniqueness of reciprocals. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) |
| |
| Theorem | mul0eqap 8850 |
If two numbers are apart from each other and their product is zero, one
of them must be zero. (Contributed by Jim Kingdon, 31-Jul-2023.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 𝐵)
& ⊢ (𝜑 → (𝐴 · 𝐵) = 0) ⇒ ⊢ (𝜑 → (𝐴 = 0 ∨ 𝐵 = 0)) |
| |
| Theorem | recapb 8851* |
A complex number has a multiplicative inverse if and only if it is apart
from zero. Theorem 11.2.4 of [HoTT], p.
(varies), generalized from
real to complex numbers. (Contributed by Jim Kingdon, 18-Jan-2025.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴 # 0 ↔ ∃𝑥 ∈ ℂ (𝐴 · 𝑥) = 1)) |
| |
| 4.3.8 Division
|
| |
| Syntax | cdiv 8852 |
Extend class notation to include division.
|
| class / |
| |
| Definition | df-div 8853* |
Define division. Theorem divmulap 8855 relates it to multiplication, and
divclap 8858 and redivclap 8911 prove its closure laws. (Contributed by NM,
2-Feb-1995.) Use divvalap 8854 instead. (Revised by Mario Carneiro,
1-Apr-2014.) (New usage is discouraged.)
|
| ⊢ / = (𝑥 ∈ ℂ, 𝑦 ∈ (ℂ ∖ {0}) ↦
(℩𝑧 ∈
ℂ (𝑦 · 𝑧) = 𝑥)) |
| |
| Theorem | divvalap 8854* |
Value of division: the (unique) element 𝑥 such that
(𝐵
· 𝑥) = 𝐴. This is meaningful
only when 𝐵 is apart from
zero. (Contributed by Jim Kingdon, 21-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (℩𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴)) |
| |
| Theorem | divmulap 8855 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ (𝐶 · 𝐵) = 𝐴)) |
| |
| Theorem | divmulap2 8856 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ 𝐴 = (𝐶 · 𝐵))) |
| |
| Theorem | divmulap3 8857 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ 𝐴 = (𝐵 · 𝐶))) |
| |
| Theorem | divclap 8858 |
Closure law for division. (Contributed by Jim Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) ∈ ℂ) |
| |
| Theorem | recclap 8859 |
Closure law for reciprocal. (Contributed by Jim Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / 𝐴) ∈ ℂ) |
| |
| Theorem | divcanap2 8860 |
A cancellation law for division. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐵 · (𝐴 / 𝐵)) = 𝐴) |
| |
| Theorem | divcanap1 8861 |
A cancellation law for division. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) · 𝐵) = 𝐴) |
| |
| Theorem | diveqap0 8862 |
A ratio is zero iff the numerator is zero. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) = 0 ↔ 𝐴 = 0)) |
| |
| Theorem | divap0b 8863 |
The ratio of numbers apart from zero is apart from zero. (Contributed by
Jim Kingdon, 22-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 # 0 ↔ (𝐴 / 𝐵) # 0)) |
| |
| Theorem | divap0 8864 |
The ratio of numbers apart from zero is apart from zero. (Contributed by
Jim Kingdon, 22-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → (𝐴 / 𝐵) # 0) |
| |
| Theorem | recap0 8865 |
The reciprocal of a number apart from zero is apart from zero.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / 𝐴) # 0) |
| |
| Theorem | recidap 8866 |
Multiplication of a number and its reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴 · (1 / 𝐴)) = 1) |
| |
| Theorem | recidap2 8867 |
Multiplication of a number and its reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → ((1 / 𝐴) · 𝐴) = 1) |
| |
| Theorem | divrecap 8868 |
Relationship between division and reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (𝐴 · (1 / 𝐵))) |
| |
| Theorem | divrecap2 8869 |
Relationship between division and reciprocal. (Contributed by Jim
Kingdon, 25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = ((1 / 𝐵) · 𝐴)) |
| |
| Theorem | divassap 8870 |
An associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐵) / 𝐶) = (𝐴 · (𝐵 / 𝐶))) |
| |
| Theorem | div23ap 8871 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐵) / 𝐶) = ((𝐴 / 𝐶) · 𝐵)) |
| |
| Theorem | div32ap 8872 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝐶 ∈ ℂ) → ((𝐴 / 𝐵) · 𝐶) = (𝐴 · (𝐶 / 𝐵))) |
| |
| Theorem | div13ap 8873 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝐶 ∈ ℂ) → ((𝐴 / 𝐵) · 𝐶) = ((𝐶 / 𝐵) · 𝐴)) |
| |
| Theorem | div12ap 8874 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → (𝐴 · (𝐵 / 𝐶)) = (𝐵 · (𝐴 / 𝐶))) |
| |
| Theorem | divmulassap 8875 |
An associative law for division and multiplication. (Contributed by Jim
Kingdon, 24-Jan-2022.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · (𝐵 / 𝐷)) · 𝐶) = ((𝐴 · 𝐵) · (𝐶 / 𝐷))) |
| |
| Theorem | divmulasscomap 8876 |
An associative/commutative law for division and multiplication.
(Contributed by Jim Kingdon, 24-Jan-2022.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0)) → ((𝐴 · (𝐵 / 𝐷)) · 𝐶) = (𝐵 · ((𝐴 · 𝐶) / 𝐷))) |
| |
| Theorem | divdirap 8877 |
Distribution of division over addition. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 + 𝐵) / 𝐶) = ((𝐴 / 𝐶) + (𝐵 / 𝐶))) |
| |
| Theorem | divcanap3 8878 |
A cancellation law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐵 · 𝐴) / 𝐵) = 𝐴) |
| |
| Theorem | divcanap4 8879 |
A cancellation law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 · 𝐵) / 𝐵) = 𝐴) |
| |
| Theorem | div11ap 8880 |
One-to-one relationship for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = (𝐵 / 𝐶) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | dividap 8881 |
A number divided by itself is one. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴 / 𝐴) = 1) |
| |
| Theorem | div0ap 8882 |
Division into zero is zero. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (0 / 𝐴) = 0) |
| |
| Theorem | div1 8883 |
A number divided by 1 is itself. (Contributed by NM, 9-Jan-2002.) (Proof
shortened by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴 / 1) = 𝐴) |
| |
| Theorem | 1div1e1 8884 |
1 divided by 1 is 1 (common case). (Contributed by David A. Wheeler,
7-Dec-2018.)
|
| ⊢ (1 / 1) = 1 |
| |
| Theorem | diveqap1 8885 |
Equality in terms of unit ratio. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) = 1 ↔ 𝐴 = 𝐵)) |
| |
| Theorem | divnegap 8886 |
Move negative sign inside of a division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → -(𝐴 / 𝐵) = (-𝐴 / 𝐵)) |
| |
| Theorem | muldivdirap 8887 |
Distribution of division over addition with a multiplication.
(Contributed by Jim Kingdon, 11-Nov-2021.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → (((𝐶 · 𝐴) + 𝐵) / 𝐶) = (𝐴 + (𝐵 / 𝐶))) |
| |
| Theorem | divsubdirap 8888 |
Distribution of division over subtraction. (Contributed by NM,
4-Mar-2005.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 − 𝐵) / 𝐶) = ((𝐴 / 𝐶) − (𝐵 / 𝐶))) |
| |
| Theorem | recrecap 8889 |
A number is equal to the reciprocal of its reciprocal. (Contributed by
Jim Kingdon, 25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / (1 / 𝐴)) = 𝐴) |
| |
| Theorem | rec11ap 8890 |
Reciprocal is one-to-one. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((1 / 𝐴) = (1 / 𝐵) ↔ 𝐴 = 𝐵)) |
| |
| Theorem | rec11rap 8891 |
Mutual reciprocals. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((1 / 𝐴) = 𝐵 ↔ (1 / 𝐵) = 𝐴)) |
| |
| Theorem | divmuldivap 8892 |
Multiplication of two ratios. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐴 · 𝐵) / (𝐶 · 𝐷))) |
| |
| Theorem | divdivdivap 8893 |
Division of two ratios. Theorem I.15 of [Apostol] p. 18. (Contributed by
Jim Kingdon, 25-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐵) / (𝐶 / 𝐷)) = ((𝐴 · 𝐷) / (𝐵 · 𝐶))) |
| |
| Theorem | divcanap5 8894 |
Cancellation of common factor in a ratio. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐶 · 𝐴) / (𝐶 · 𝐵)) = (𝐴 / 𝐵)) |
| |
| Theorem | divmul13ap 8895 |
Swap the denominators in the product of two ratios. (Contributed by Jim
Kingdon, 26-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐵 / 𝐶) · (𝐴 / 𝐷))) |
| |
| Theorem | divmul24ap 8896 |
Swap the numerators in the product of two ratios. (Contributed by Jim
Kingdon, 26-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐴 / 𝐷) · (𝐵 / 𝐶))) |
| |
| Theorem | divmuleqap 8897 |
Cross-multiply in an equality of ratios. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) = (𝐵 / 𝐷) ↔ (𝐴 · 𝐷) = (𝐵 · 𝐶))) |
| |
| Theorem | recdivap 8898 |
The reciprocal of a ratio. (Contributed by Jim Kingdon, 26-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → (1 / (𝐴 / 𝐵)) = (𝐵 / 𝐴)) |
| |
| Theorem | divcanap6 8899 |
Cancellation of inverted fractions. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
| ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((𝐴 / 𝐵) · (𝐵 / 𝐴)) = 1) |
| |
| Theorem | divdiv32ap 8900 |
Swap denominators in a division. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐵) / 𝐶) = ((𝐴 / 𝐶) / 𝐵)) |