Theorem List for Intuitionistic Logic Explorer - 7601-7700 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | addext 7601 |
Strong extensionality for addition. Given excluded middle, apartness
would be equivalent to negated equality and this would follow readily (for
all operations) from oveq12 5521. For us, it is proved a different way.
(Contributed by Jim Kingdon, 15-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 + 𝐵) # (𝐶 + 𝐷) → (𝐴 # 𝐶 ∨ 𝐵 # 𝐷))) |
|
Theorem | apneg 7602 |
Negation respects apartness. (Contributed by Jim Kingdon,
14-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 # 𝐵 ↔ -𝐴 # -𝐵)) |
|
Theorem | mulext1 7603 |
Left extensionality for complex multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐶) # (𝐵 · 𝐶) → 𝐴 # 𝐵)) |
|
Theorem | mulext2 7604 |
Right extensionality for complex multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐶 · 𝐴) # (𝐶 · 𝐵) → 𝐴 # 𝐵)) |
|
Theorem | mulext 7605 |
Strong extensionality for multiplication. Given excluded middle,
apartness would be equivalent to negated equality and this would follow
readily (for all operations) from oveq12 5521. For us, it is proved a
different way. (Contributed by Jim Kingdon, 23-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → ((𝐴 · 𝐵) # (𝐶 · 𝐷) → (𝐴 # 𝐶 ∨ 𝐵 # 𝐷))) |
|
Theorem | mulap0r 7606 |
A product apart from zero. Lemma 2.13 of [Geuvers], p. 6. (Contributed
by Jim Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐴 · 𝐵) # 0) → (𝐴 # 0 ∧ 𝐵 # 0)) |
|
Theorem | msqge0 7607 |
A square is nonnegative. Lemma 2.35 of [Geuvers], p. 9. (Contributed by
NM, 23-May-2007.) (Revised by Mario Carneiro, 27-May-2016.)
|
⊢ (𝐴 ∈ ℝ → 0 ≤ (𝐴 · 𝐴)) |
|
Theorem | msqge0i 7608 |
A square is nonnegative. (Contributed by NM, 14-May-1999.) (Proof
shortened by Andrew Salmon, 19-Nov-2011.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ 0 ≤ (𝐴 · 𝐴) |
|
Theorem | msqge0d 7609 |
A square is nonnegative. (Contributed by Mario Carneiro,
27-May-2016.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ)
⇒ ⊢ (𝜑 → 0 ≤ (𝐴 · 𝐴)) |
|
Theorem | mulge0 7610 |
The product of two nonnegative numbers is nonnegative. (Contributed by
NM, 8-Oct-1999.) (Revised by Mario Carneiro, 27-May-2016.)
|
⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 0 ≤ (𝐴 · 𝐵)) |
|
Theorem | mulge0i 7611 |
The product of two nonnegative numbers is nonnegative. (Contributed by
NM, 30-Jul-1999.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ ((0 ≤ 𝐴 ∧ 0 ≤ 𝐵) → 0 ≤ (𝐴 · 𝐵)) |
|
Theorem | mulge0d 7612 |
The product of two nonnegative numbers is nonnegative. (Contributed by
Mario Carneiro, 27-May-2016.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 0 ≤ 𝐴)
& ⊢ (𝜑 → 0 ≤ 𝐵) ⇒ ⊢ (𝜑 → 0 ≤ (𝐴 · 𝐵)) |
|
Theorem | apti 7613 |
Complex apartness is tight. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 = 𝐵 ↔ ¬ 𝐴 # 𝐵)) |
|
Theorem | apne 7614 |
Apartness implies negated equality. We cannot in general prove the
converse, which is the whole point of having separate notations for
apartness and negated equality. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 # 𝐵 → 𝐴 ≠ 𝐵)) |
|
Theorem | leltap 7615 |
'<_' implies 'less than' is 'apart'. (Contributed by Jim Kingdon,
13-Aug-2021.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴 < 𝐵 ↔ 𝐵 # 𝐴)) |
|
Theorem | gt0ap0 7616 |
Positive implies apart from zero. (Contributed by Jim Kingdon,
27-Feb-2020.)
|
⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 # 0) |
|
Theorem | gt0ap0i 7617 |
Positive means apart from zero (useful for ordering theorems involving
division). (Contributed by Jim Kingdon, 27-Feb-2020.)
|
⊢ 𝐴 ∈ ℝ
⇒ ⊢ (0 < 𝐴 → 𝐴 # 0) |
|
Theorem | gt0ap0ii 7618 |
Positive implies apart from zero. (Contributed by Jim Kingdon,
27-Feb-2020.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 0 < 𝐴 ⇒ ⊢ 𝐴 # 0 |
|
Theorem | gt0ap0d 7619 |
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 7620 |
A number is apart from zero iff its negative is apart from zero.
(Contributed by Jim Kingdon, 27-Feb-2020.)
|
⊢ (𝐴 ∈ ℂ → (𝐴 # 0 ↔ -𝐴 # 0)) |
|
Theorem | ltleap 7621 |
Less than in terms of non-strict order and apartness. (Contributed by Jim
Kingdon, 28-Feb-2020.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 ≤ 𝐵 ∧ 𝐴 # 𝐵))) |
|
Theorem | ltap 7622 |
'Less than' implies apart. (Contributed by Jim Kingdon, 12-Aug-2021.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) → 𝐵 # 𝐴) |
|
Theorem | gtapii 7623 |
'Greater than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ & ⊢ 𝐴 < 𝐵 ⇒ ⊢ 𝐵 # 𝐴 |
|
Theorem | ltapii 7624 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈ ℝ & ⊢ 𝐴 < 𝐵 ⇒ ⊢ 𝐴 # 𝐵 |
|
Theorem | ltapi 7625 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ 𝐴 ∈ ℝ & ⊢ 𝐵 ∈
ℝ ⇒ ⊢ (𝐴 < 𝐵 → 𝐵 # 𝐴) |
|
Theorem | gtapd 7626 |
'Greater than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐵 # 𝐴) |
|
Theorem | ltapd 7627 |
'Less than' implies apart. (Contributed by Jim Kingdon,
12-Aug-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < 𝐵) ⇒ ⊢ (𝜑 → 𝐴 # 𝐵) |
|
Theorem | leltapd 7628 |
'<_' implies 'less than' is 'apart'. (Contributed by Jim Kingdon,
13-Aug-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐴 ≤ 𝐵) ⇒ ⊢ (𝜑 → (𝐴 < 𝐵 ↔ 𝐵 # 𝐴)) |
|
Theorem | ap0gt0 7629 |
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 7630 |
A nonzero nonnegative number is positive. (Contributed by Jim
Kingdon, 11-Aug-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 0 ≤ 𝐴)
& ⊢ (𝜑 → 𝐴 # 0) ⇒ ⊢ (𝜑 → 0 < 𝐴) |
|
Theorem | subap0d 7631 |
Two numbers apart from each other have difference apart from zero.
(Contributed by Jim Kingdon, 12-Aug-2021.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 𝐵) ⇒ ⊢ (𝜑 → (𝐴 − 𝐵) # 0) |
|
3.3.7 Reciprocals
|
|
Theorem | recextlem1 7632 |
Lemma for recexap 7634. (Contributed by Eric Schmidt, 23-May-2007.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + (i · 𝐵)) · (𝐴 − (i · 𝐵))) = ((𝐴 · 𝐴) + (𝐵 · 𝐵))) |
|
Theorem | recexaplem2 7633 |
Lemma for recexap 7634. (Contributed by Jim Kingdon, 20-Feb-2020.)
|
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐴 + (i · 𝐵)) # 0) → ((𝐴 · 𝐴) + (𝐵 · 𝐵)) # 0) |
|
Theorem | recexap 7634* |
Existence of reciprocal of nonzero complex number. (Contributed by Jim
Kingdon, 20-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → ∃𝑥 ∈ ℂ (𝐴 · 𝑥) = 1) |
|
Theorem | mulap0 7635 |
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 7636 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 # 0 ∧ 𝐵 # 0) ↔ (𝐴 · 𝐵) # 0)) |
|
Theorem | mulap0i 7637 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 23-Feb-2020.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐴 # 0 & ⊢ 𝐵 # 0
⇒ ⊢ (𝐴 · 𝐵) # 0 |
|
Theorem | mulap0bd 7638 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ)
⇒ ⊢ (𝜑 → ((𝐴 # 0 ∧ 𝐵 # 0) ↔ (𝐴 · 𝐵) # 0)) |
|
Theorem | mulap0d 7639 |
The product of two numbers apart from zero is apart from zero.
(Contributed by Jim Kingdon, 23-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐴 # 0) & ⊢ (𝜑 → 𝐵 # 0) ⇒ ⊢ (𝜑 → (𝐴 · 𝐵) # 0) |
|
Theorem | mulap0bad 7640 |
A factor of a complex number apart from zero is apart from zero.
Partial converse of mulap0d 7639 and consequence of mulap0bd 7638.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → (𝐴 · 𝐵) # 0) ⇒ ⊢ (𝜑 → 𝐴 # 0) |
|
Theorem | mulap0bbd 7641 |
A factor of a complex number apart from zero is apart from zero.
Partial converse of mulap0d 7639 and consequence of mulap0bd 7638.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → (𝐴 · 𝐵) # 0) ⇒ ⊢ (𝜑 → 𝐵 # 0) |
|
Theorem | mulcanapd 7642 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) ⇒ ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
|
Theorem | mulcanap2d 7643 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) ⇒ ⊢ (𝜑 → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) |
|
Theorem | mulcanapad 7644 |
Cancellation of a nonzero factor on the left in an equation. One-way
deduction form of mulcanapd 7642. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) & ⊢ (𝜑 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
|
Theorem | mulcanap2ad 7645 |
Cancellation of a nonzero factor on the right in an equation. One-way
deduction form of mulcanap2d 7643. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐶 # 0) & ⊢ (𝜑 → (𝐴 · 𝐶) = (𝐵 · 𝐶)) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) |
|
Theorem | mulcanap 7646 |
Cancellation law for multiplication (full theorem form). (Contributed by
Jim Kingdon, 21-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
|
Theorem | mulcanap2 7647 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) |
|
Theorem | mulcanapi 7648 |
Cancellation law for multiplication. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ 𝐴 ∈ ℂ & ⊢ 𝐵 ∈ ℂ & ⊢ 𝐶 ∈ ℂ & ⊢ 𝐶 # 0
⇒ ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵) |
|
Theorem | muleqadd 7649 |
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 7650* |
Existential uniqueness of reciprocals. (Contributed by Jim Kingdon,
21-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ∃!𝑥 ∈ ℂ (𝐵 · 𝑥) = 𝐴) |
|
3.3.8 Division
|
|
Syntax | cdiv 7651 |
Extend class notation to include division.
|
class / |
|
Definition | df-div 7652* |
Define division. Theorem divmulap 7654 relates it to multiplication, and
divclap 7657 and redivclap 7707 prove its closure laws. (Contributed by NM,
2-Feb-1995.) (Revised by Mario Carneiro, 1-Apr-2014.)
(New usage is discouraged.)
|
⊢ / = (𝑥 ∈ ℂ, 𝑦 ∈ (ℂ ∖ {0}) ↦
(℩𝑧 ∈
ℂ (𝑦 · 𝑧) = 𝑥)) |
|
Theorem | divvalap 7653* |
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 7654 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ (𝐶 · 𝐵) = 𝐴)) |
|
Theorem | divmulap2 7655 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ 𝐴 = (𝐶 · 𝐵))) |
|
Theorem | divmulap3 7656 |
Relationship between division and multiplication. (Contributed by Jim
Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = 𝐵 ↔ 𝐴 = (𝐵 · 𝐶))) |
|
Theorem | divclap 7657 |
Closure law for division. (Contributed by Jim Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) ∈ ℂ) |
|
Theorem | recclap 7658 |
Closure law for reciprocal. (Contributed by Jim Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / 𝐴) ∈ ℂ) |
|
Theorem | divcanap2 7659 |
A cancellation law for division. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐵 · (𝐴 / 𝐵)) = 𝐴) |
|
Theorem | divcanap1 7660 |
A cancellation law for division. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) · 𝐵) = 𝐴) |
|
Theorem | diveqap0 7661 |
A ratio is zero iff the numerator is zero. (Contributed by Jim Kingdon,
22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) = 0 ↔ 𝐴 = 0)) |
|
Theorem | divap0b 7662 |
The ratio of numbers apart from zero is apart from zero. (Contributed by
Jim Kingdon, 22-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 # 0 ↔ (𝐴 / 𝐵) # 0)) |
|
Theorem | divap0 7663 |
The ratio of numbers apart from zero is apart from zero. (Contributed by
Jim Kingdon, 22-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → (𝐴 / 𝐵) # 0) |
|
Theorem | recap0 7664 |
The reciprocal of a number apart from zero is apart from zero.
(Contributed by Jim Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / 𝐴) # 0) |
|
Theorem | recidap 7665 |
Multiplication of a number and its reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴 · (1 / 𝐴)) = 1) |
|
Theorem | recidap2 7666 |
Multiplication of a number and its reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → ((1 / 𝐴) · 𝐴) = 1) |
|
Theorem | divrecap 7667 |
Relationship between division and reciprocal. (Contributed by Jim
Kingdon, 24-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = (𝐴 · (1 / 𝐵))) |
|
Theorem | divrecap2 7668 |
Relationship between division and reciprocal. (Contributed by Jim
Kingdon, 25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → (𝐴 / 𝐵) = ((1 / 𝐵) · 𝐴)) |
|
Theorem | divassap 7669 |
An associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐵) / 𝐶) = (𝐴 · (𝐵 / 𝐶))) |
|
Theorem | div23ap 7670 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 · 𝐵) / 𝐶) = ((𝐴 / 𝐶) · 𝐵)) |
|
Theorem | div32ap 7671 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝐶 ∈ ℂ) → ((𝐴 / 𝐵) · 𝐶) = (𝐴 · (𝐶 / 𝐵))) |
|
Theorem | div13ap 7672 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝐶 ∈ ℂ) → ((𝐴 / 𝐵) · 𝐶) = ((𝐶 / 𝐵) · 𝐴)) |
|
Theorem | div12ap 7673 |
A commutative/associative law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → (𝐴 · (𝐵 / 𝐶)) = (𝐵 · (𝐴 / 𝐶))) |
|
Theorem | divdirap 7674 |
Distribution of division over addition. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 + 𝐵) / 𝐶) = ((𝐴 / 𝐶) + (𝐵 / 𝐶))) |
|
Theorem | divcanap3 7675 |
A cancellation law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐵 · 𝐴) / 𝐵) = 𝐴) |
|
Theorem | divcanap4 7676 |
A cancellation law for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 · 𝐵) / 𝐵) = 𝐴) |
|
Theorem | div11ap 7677 |
One-to-one relationship for division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) = (𝐵 / 𝐶) ↔ 𝐴 = 𝐵)) |
|
Theorem | dividap 7678 |
A number divided by itself is one. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐴 / 𝐴) = 1) |
|
Theorem | div0ap 7679 |
Division into zero is zero. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (0 / 𝐴) = 0) |
|
Theorem | div1 7680 |
A number divided by 1 is itself. (Contributed by NM, 9-Jan-2002.) (Proof
shortened by Mario Carneiro, 27-May-2016.)
|
⊢ (𝐴 ∈ ℂ → (𝐴 / 1) = 𝐴) |
|
Theorem | 1div1e1 7681 |
1 divided by 1 is 1 (common case). (Contributed by David A. Wheeler,
7-Dec-2018.)
|
⊢ (1 / 1) = 1 |
|
Theorem | diveqap1 7682 |
Equality in terms of unit ratio. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → ((𝐴 / 𝐵) = 1 ↔ 𝐴 = 𝐵)) |
|
Theorem | divnegap 7683 |
Move negative sign inside of a division. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 # 0) → -(𝐴 / 𝐵) = (-𝐴 / 𝐵)) |
|
Theorem | divsubdirap 7684 |
Distribution of division over subtraction. (Contributed by NM,
4-Mar-2005.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 − 𝐵) / 𝐶) = ((𝐴 / 𝐶) − (𝐵 / 𝐶))) |
|
Theorem | recrecap 7685 |
A number is equal to the reciprocal of its reciprocal. (Contributed by
Jim Kingdon, 25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) → (1 / (1 / 𝐴)) = 𝐴) |
|
Theorem | rec11ap 7686 |
Reciprocal is one-to-one. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((1 / 𝐴) = (1 / 𝐵) ↔ 𝐴 = 𝐵)) |
|
Theorem | rec11rap 7687 |
Mutual reciprocals. (Contributed by Jim Kingdon, 25-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((1 / 𝐴) = 𝐵 ↔ (1 / 𝐵) = 𝐴)) |
|
Theorem | divmuldivap 7688 |
Multiplication of two ratios. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐴 · 𝐵) / (𝐶 · 𝐷))) |
|
Theorem | divdivdivap 7689 |
Division of two ratios. Theorem I.15 of [Apostol] p. 18. (Contributed by
Jim Kingdon, 25-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐵) / (𝐶 / 𝐷)) = ((𝐴 · 𝐷) / (𝐵 · 𝐶))) |
|
Theorem | divcanap5 7690 |
Cancellation of common factor in a ratio. (Contributed by Jim Kingdon,
25-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐶 · 𝐴) / (𝐶 · 𝐵)) = (𝐴 / 𝐵)) |
|
Theorem | divmul13ap 7691 |
Swap the denominators in the product of two ratios. (Contributed by Jim
Kingdon, 26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐵 / 𝐶) · (𝐴 / 𝐷))) |
|
Theorem | divmul24ap 7692 |
Swap the numerators in the product of two ratios. (Contributed by Jim
Kingdon, 26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) · (𝐵 / 𝐷)) = ((𝐴 / 𝐷) · (𝐵 / 𝐶))) |
|
Theorem | divmuleqap 7693 |
Cross-multiply in an equality of ratios. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) ∧ (𝐷 ∈ ℂ ∧ 𝐷 # 0))) → ((𝐴 / 𝐶) = (𝐵 / 𝐷) ↔ (𝐴 · 𝐷) = (𝐵 · 𝐶))) |
|
Theorem | recdivap 7694 |
The reciprocal of a ratio. (Contributed by Jim Kingdon, 26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → (1 / (𝐴 / 𝐵)) = (𝐵 / 𝐴)) |
|
Theorem | divcanap6 7695 |
Cancellation of inverted fractions. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0)) → ((𝐴 / 𝐵) · (𝐵 / 𝐴)) = 1) |
|
Theorem | divdiv32ap 7696 |
Swap denominators in a division. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐵) / 𝐶) = ((𝐴 / 𝐶) / 𝐵)) |
|
Theorem | divcanap7 7697 |
Cancel equal divisors in a division. (Contributed by Jim Kingdon,
26-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐶) / (𝐵 / 𝐶)) = (𝐴 / 𝐵)) |
|
Theorem | dmdcanap 7698 |
Cancellation law for division and multiplication. (Contributed by Jim
Kingdon, 26-Feb-2020.)
|
⊢ (((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ 𝐶 ∈ ℂ) → ((𝐴 / 𝐵) · (𝐶 / 𝐴)) = (𝐶 / 𝐵)) |
|
Theorem | divdivap1 7699 |
Division into a fraction. (Contributed by Jim Kingdon, 26-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → ((𝐴 / 𝐵) / 𝐶) = (𝐴 / (𝐵 · 𝐶))) |
|
Theorem | divdivap2 7700 |
Division by a fraction. (Contributed by Jim Kingdon, 26-Feb-2020.)
|
⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0) ∧ (𝐶 ∈ ℂ ∧ 𝐶 # 0)) → (𝐴 / (𝐵 / 𝐶)) = ((𝐴 · 𝐶) / 𝐵)) |