Home Intuitionistic Logic ExplorerTheorem List (p. 87 of 105) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 8601-8700   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremuzind4i 8601* Induction on the upper integers that start at 𝑀. The first hypothesis specifies the lower bound, the next four give us the substitution instances we need, and the last two are the basis and the induction step. (Contributed by NM, 4-Sep-2005.)
𝑀 ∈ ℤ    &   (𝑗 = 𝑀 → (𝜑𝜓))    &   (𝑗 = 𝑘 → (𝜑𝜒))    &   (𝑗 = (𝑘 + 1) → (𝜑𝜃))    &   (𝑗 = 𝑁 → (𝜑𝜏))    &   𝜓    &   (𝑘 ∈ (ℤ𝑀) → (𝜒𝜃))       (𝑁 ∈ (ℤ𝑀) → 𝜏)

Theoremindstr 8602* Strong Mathematical Induction for positive integers (inference schema). (Contributed by NM, 17-Aug-2001.)
(𝑥 = 𝑦 → (𝜑𝜓))    &   (𝑥 ∈ ℕ → (∀𝑦 ∈ ℕ (𝑦 < 𝑥𝜓) → 𝜑))       (𝑥 ∈ ℕ → 𝜑)

Theoremeluznn0 8603 Membership in a nonnegative upper set of integers implies membership in 0. (Contributed by Paul Chapman, 22-Jun-2011.)
((𝑁 ∈ ℕ0𝑀 ∈ (ℤ𝑁)) → 𝑀 ∈ ℕ0)

Theoremeluznn 8604 Membership in a positive upper set of integers implies membership in . (Contributed by JJ, 1-Oct-2018.)
((𝑁 ∈ ℕ ∧ 𝑀 ∈ (ℤ𝑁)) → 𝑀 ∈ ℕ)

Theoremeluz2b1 8605 Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
(𝑁 ∈ (ℤ‘2) ↔ (𝑁 ∈ ℤ ∧ 1 < 𝑁))

Theoremeluz2gt1 8606 An integer greater than or equal to 2 is greater than 1. (Contributed by AV, 24-May-2020.)
(𝑁 ∈ (ℤ‘2) → 1 < 𝑁)

Theoremeluz2b2 8607 Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
(𝑁 ∈ (ℤ‘2) ↔ (𝑁 ∈ ℕ ∧ 1 < 𝑁))

Theoremeluz2b3 8608 Two ways to say "an integer greater than or equal to 2." (Contributed by Paul Chapman, 23-Nov-2012.)
(𝑁 ∈ (ℤ‘2) ↔ (𝑁 ∈ ℕ ∧ 𝑁 ≠ 1))

Theoremuz2m1nn 8609 One less than an integer greater than or equal to 2 is a positive integer. (Contributed by Paul Chapman, 17-Nov-2012.)
(𝑁 ∈ (ℤ‘2) → (𝑁 − 1) ∈ ℕ)

Theorem1nuz2 8610 1 is not in (ℤ‘2). (Contributed by Paul Chapman, 21-Nov-2012.)
¬ 1 ∈ (ℤ‘2)

Theoremelnn1uz2 8611 A positive integer is either 1 or greater than or equal to 2. (Contributed by Paul Chapman, 17-Nov-2012.)
(𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ‘2)))

Theoremuz2mulcl 8612 Closure of multiplication of integers greater than or equal to 2. (Contributed by Paul Chapman, 26-Oct-2012.)
((𝑀 ∈ (ℤ‘2) ∧ 𝑁 ∈ (ℤ‘2)) → (𝑀 · 𝑁) ∈ (ℤ‘2))

Theoremindstr2 8613* Strong Mathematical Induction for positive integers (inference schema). The first two hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by Paul Chapman, 21-Nov-2012.)
(𝑥 = 1 → (𝜑𝜒))    &   (𝑥 = 𝑦 → (𝜑𝜓))    &   𝜒    &   (𝑥 ∈ (ℤ‘2) → (∀𝑦 ∈ ℕ (𝑦 < 𝑥𝜓) → 𝜑))       (𝑥 ∈ ℕ → 𝜑)

Theoremeluzdc 8614 Membership of an integer in an upper set of integers is decidable. (Contributed by Jim Kingdon, 18-Apr-2020.)
((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑁 ∈ (ℤ𝑀))

Theoremublbneg 8615* The image under negation of a bounded-above set of reals is bounded below. (Contributed by Paul Chapman, 21-Mar-2011.)
(∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ {𝑧 ∈ ℝ ∣ -𝑧𝐴}𝑥𝑦)

Theoremeqreznegel 8616* Two ways to express the image under negation of a set of integers. (Contributed by Paul Chapman, 21-Mar-2011.)
(𝐴 ⊆ ℤ → {𝑧 ∈ ℝ ∣ -𝑧𝐴} = {𝑧 ∈ ℤ ∣ -𝑧𝐴})

Theoremnegm 8617* The image under negation of an inhabited set of reals is inhabited. (Contributed by Jim Kingdon, 10-Apr-2020.)
((𝐴 ⊆ ℝ ∧ ∃𝑥 𝑥𝐴) → ∃𝑦 𝑦 ∈ {𝑧 ∈ ℝ ∣ -𝑧𝐴})

Theoremlbzbi 8618* If a set of reals is bounded below, it is bounded below by an integer. (Contributed by Paul Chapman, 21-Mar-2011.)
(𝐴 ⊆ ℝ → (∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑥𝑦 ↔ ∃𝑥 ∈ ℤ ∀𝑦𝐴 𝑥𝑦))

Theoremnn01to3 8619 A (nonnegative) integer between 1 and 3 must be 1, 2 or 3. (Contributed by Alexander van der Vekens, 13-Sep-2018.)
((𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁𝑁 ≤ 3) → (𝑁 = 1 ∨ 𝑁 = 2 ∨ 𝑁 = 3))

Theoremnn0ge2m1nnALT 8620 Alternate proof of nn0ge2m1nn 8269: If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is a positive integer. This version is proved using eluz2 8545, a theorem for upper sets of integers, which are defined later than the positive and nonnegative integers. This proof is, however, much shorter than the proof of nn0ge2m1nn 8269. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (New usage is discouraged.) (Proof modification is discouraged.)
((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ)

3.4.11  Rational numbers (as a subset of complex numbers)

Syntaxcq 8621 Extend class notation to include the class of rationals.
class

Definitiondf-q 8622 Define the set of rational numbers. Based on definition of rationals in [Apostol] p. 22. See elq 8624 for the relation "is rational." (Contributed by NM, 8-Jan-2002.)
ℚ = ( / “ (ℤ × ℕ))

Theoremdivfnzn 8623 Division restricted to ℤ × ℕ is a function. Given excluded middle, it would be easy to prove this for ℂ × (ℂ ∖ {0}). The key difference is that an element of is apart from zero, whereas being an element of ℂ ∖ {0} implies being not equal to zero. (Contributed by Jim Kingdon, 19-Mar-2020.)
( / ↾ (ℤ × ℕ)) Fn (ℤ × ℕ)

Theoremelq 8624* Membership in the set of rationals. (Contributed by NM, 8-Jan-2002.) (Revised by Mario Carneiro, 28-Jan-2014.)
(𝐴 ∈ ℚ ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℕ 𝐴 = (𝑥 / 𝑦))

Theoremqmulz 8625* If 𝐴 is rational, then some integer multiple of it is an integer. (Contributed by NM, 7-Nov-2008.) (Revised by Mario Carneiro, 22-Jul-2014.)
(𝐴 ∈ ℚ → ∃𝑥 ∈ ℕ (𝐴 · 𝑥) ∈ ℤ)

Theoremznq 8626 The ratio of an integer and a positive integer is a rational number. (Contributed by NM, 12-Jan-2002.)
((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℕ) → (𝐴 / 𝐵) ∈ ℚ)

Theoremqre 8627 A rational number is a real number. (Contributed by NM, 14-Nov-2002.)
(𝐴 ∈ ℚ → 𝐴 ∈ ℝ)

Theoremzq 8628 An integer is a rational number. (Contributed by NM, 9-Jan-2002.)
(𝐴 ∈ ℤ → 𝐴 ∈ ℚ)

Theoremzssq 8629 The integers are a subset of the rationals. (Contributed by NM, 9-Jan-2002.)
ℤ ⊆ ℚ

Theoremnn0ssq 8630 The nonnegative integers are a subset of the rationals. (Contributed by NM, 31-Jul-2004.)
0 ⊆ ℚ

Theoremnnssq 8631 The positive integers are a subset of the rationals. (Contributed by NM, 31-Jul-2004.)
ℕ ⊆ ℚ

Theoremqssre 8632 The rationals are a subset of the reals. (Contributed by NM, 9-Jan-2002.)
ℚ ⊆ ℝ

Theoremqsscn 8633 The rationals are a subset of the complex numbers. (Contributed by NM, 2-Aug-2004.)
ℚ ⊆ ℂ

Theoremqex 8634 The set of rational numbers exists. (Contributed by NM, 30-Jul-2004.) (Revised by Mario Carneiro, 17-Nov-2014.)
ℚ ∈ V

Theoremnnq 8635 A positive integer is rational. (Contributed by NM, 17-Nov-2004.)
(𝐴 ∈ ℕ → 𝐴 ∈ ℚ)

Theoremqcn 8636 A rational number is a complex number. (Contributed by NM, 2-Aug-2004.)
(𝐴 ∈ ℚ → 𝐴 ∈ ℂ)

((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 + 𝐵) ∈ ℚ)

Theoremqnegcl 8638 Closure law for the negative of a rational. (Contributed by NM, 2-Aug-2004.) (Revised by Mario Carneiro, 15-Sep-2014.)
(𝐴 ∈ ℚ → -𝐴 ∈ ℚ)

Theoremqmulcl 8639 Closure of multiplication of rationals. (Contributed by NM, 1-Aug-2004.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 · 𝐵) ∈ ℚ)

Theoremqsubcl 8640 Closure of subtraction of rationals. (Contributed by NM, 2-Aug-2004.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴𝐵) ∈ ℚ)

Theoremqapne 8641 Apartness is equivalent to not equal for rationals. (Contributed by Jim Kingdon, 20-Mar-2020.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 # 𝐵𝐴𝐵))

Theoremqltlen 8642 Rational 'Less than' expressed in terms of 'less than or equal to'. Also see ltleap 7665 which is a similar result for real numbers. (Contributed by Jim Kingdon, 11-Oct-2021.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴 < 𝐵 ↔ (𝐴𝐵𝐵𝐴)))

Theoremqlttri2 8643 Apartness is equivalent to not equal for rationals. (Contributed by Jim Kingdon, 9-Nov-2021.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐴𝐵 ↔ (𝐴 < 𝐵𝐵 < 𝐴)))

Theoremqreccl 8644 Closure of reciprocal of rationals. (Contributed by NM, 3-Aug-2004.)
((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) → (1 / 𝐴) ∈ ℚ)

Theoremqdivcl 8645 Closure of division of rationals. (Contributed by NM, 3-Aug-2004.)
((𝐴 ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐴 / 𝐵) ∈ ℚ)

Theoremqrevaddcl 8646 Reverse closure law for addition of rationals. (Contributed by NM, 2-Aug-2004.)
(𝐵 ∈ ℚ → ((𝐴 ∈ ℂ ∧ (𝐴 + 𝐵) ∈ ℚ) ↔ 𝐴 ∈ ℚ))

Theoremnnrecq 8647 The reciprocal of a positive integer is rational. (Contributed by NM, 17-Nov-2004.)
(𝐴 ∈ ℕ → (1 / 𝐴) ∈ ℚ)

Theoremirradd 8648 The sum of an irrational number and a rational number is irrational. (Contributed by NM, 7-Nov-2008.)
((𝐴 ∈ (ℝ ∖ ℚ) ∧ 𝐵 ∈ ℚ) → (𝐴 + 𝐵) ∈ (ℝ ∖ ℚ))

Theoremirrmul 8649 The product of a real which is not rational with a nonzero rational is not rational. Note that by "not rational" we mean the negation of "is rational" (whereas "irrational" is often defined to mean apart from any rational number - given excluded middle these two definitions would be equivalent). (Contributed by NM, 7-Nov-2008.)
((𝐴 ∈ (ℝ ∖ ℚ) ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐴 · 𝐵) ∈ (ℝ ∖ ℚ))

3.4.12  Complex numbers as pairs of reals

Theoremcnref1o 8650* There is a natural one-to-one mapping from (ℝ × ℝ) to , where we map 𝑥, 𝑦 to (𝑥 + (i · 𝑦)). In our construction of the complex numbers, this is in fact our definition of (see df-c 6923), but in the axiomatic treatment we can only show that there is the expected mapping between these two sets. (Contributed by Mario Carneiro, 16-Jun-2013.) (Revised by Mario Carneiro, 17-Feb-2014.)
𝐹 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))       𝐹:(ℝ × ℝ)–1-1-onto→ℂ

3.5  Order sets

3.5.1  Positive reals (as a subset of complex numbers)

Syntaxcrp 8651 Extend class notation to include the class of positive reals.
class +

Definitiondf-rp 8652 Define the set of positive reals. Definition of positive numbers in [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.)
+ = {𝑥 ∈ ℝ ∣ 0 < 𝑥}

Theoremelrp 8653 Membership in the set of positive reals. (Contributed by NM, 27-Oct-2007.)
(𝐴 ∈ ℝ+ ↔ (𝐴 ∈ ℝ ∧ 0 < 𝐴))

Theoremelrpii 8654 Membership in the set of positive reals. (Contributed by NM, 23-Feb-2008.)
𝐴 ∈ ℝ    &   0 < 𝐴       𝐴 ∈ ℝ+

Theorem1rp 8655 1 is a positive real. (Contributed by Jeff Hankins, 23-Nov-2008.)
1 ∈ ℝ+

Theorem2rp 8656 2 is a positive real. (Contributed by Mario Carneiro, 28-May-2016.)
2 ∈ ℝ+

Theoremrpre 8657 A positive real is a real. (Contributed by NM, 27-Oct-2007.)
(𝐴 ∈ ℝ+𝐴 ∈ ℝ)

Theoremrpxr 8658 A positive real is an extended real. (Contributed by Mario Carneiro, 21-Aug-2015.)
(𝐴 ∈ ℝ+𝐴 ∈ ℝ*)

Theoremrpcn 8659 A positive real is a complex number. (Contributed by NM, 11-Nov-2008.)
(𝐴 ∈ ℝ+𝐴 ∈ ℂ)

Theoremnnrp 8660 A positive integer is a positive real. (Contributed by NM, 28-Nov-2008.)
(𝐴 ∈ ℕ → 𝐴 ∈ ℝ+)

Theoremrpssre 8661 The positive reals are a subset of the reals. (Contributed by NM, 24-Feb-2008.)
+ ⊆ ℝ

Theoremrpgt0 8662 A positive real is greater than zero. (Contributed by FL, 27-Dec-2007.)
(𝐴 ∈ ℝ+ → 0 < 𝐴)

Theoremrpge0 8663 A positive real is greater than or equal to zero. (Contributed by NM, 22-Feb-2008.)
(𝐴 ∈ ℝ+ → 0 ≤ 𝐴)

Theoremrpregt0 8664 A positive real is a positive real number. (Contributed by NM, 11-Nov-2008.) (Revised by Mario Carneiro, 31-Jan-2014.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℝ ∧ 0 < 𝐴))

Theoremrprege0 8665 A positive real is a nonnegative real number. (Contributed by Mario Carneiro, 31-Jan-2014.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴))

Theoremrpne0 8666 A positive real is nonzero. (Contributed by NM, 18-Jul-2008.)
(𝐴 ∈ ℝ+𝐴 ≠ 0)

Theoremrpap0 8667 A positive real is apart from zero. (Contributed by Jim Kingdon, 22-Mar-2020.)
(𝐴 ∈ ℝ+𝐴 # 0)

Theoremrprene0 8668 A positive real is a nonzero real number. (Contributed by NM, 11-Nov-2008.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℝ ∧ 𝐴 ≠ 0))

Theoremrpreap0 8669 A positive real is a real number apart from zero. (Contributed by Jim Kingdon, 22-Mar-2020.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℝ ∧ 𝐴 # 0))

Theoremrpcnne0 8670 A positive real is a nonzero complex number. (Contributed by NM, 11-Nov-2008.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0))

Theoremrpcnap0 8671 A positive real is a complex number apart from zero. (Contributed by Jim Kingdon, 22-Mar-2020.)
(𝐴 ∈ ℝ+ → (𝐴 ∈ ℂ ∧ 𝐴 # 0))

Theoremralrp 8672 Quantification over positive reals. (Contributed by NM, 12-Feb-2008.)
(∀𝑥 ∈ ℝ+ 𝜑 ↔ ∀𝑥 ∈ ℝ (0 < 𝑥𝜑))

Theoremrexrp 8673 Quantification over positive reals. (Contributed by Mario Carneiro, 21-May-2014.)
(∃𝑥 ∈ ℝ+ 𝜑 ↔ ∃𝑥 ∈ ℝ (0 < 𝑥𝜑))

Theoremrpaddcl 8674 Closure law for addition of positive reals. Part of Axiom 7 of [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.)
((𝐴 ∈ ℝ+𝐵 ∈ ℝ+) → (𝐴 + 𝐵) ∈ ℝ+)

Theoremrpmulcl 8675 Closure law for multiplication of positive reals. Part of Axiom 7 of [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.)
((𝐴 ∈ ℝ+𝐵 ∈ ℝ+) → (𝐴 · 𝐵) ∈ ℝ+)

Theoremrpdivcl 8676 Closure law for division of positive reals. (Contributed by FL, 27-Dec-2007.)
((𝐴 ∈ ℝ+𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ+)

Theoremrpreccl 8677 Closure law for reciprocation of positive reals. (Contributed by Jeff Hankins, 23-Nov-2008.)
(𝐴 ∈ ℝ+ → (1 / 𝐴) ∈ ℝ+)

Theoremrphalfcl 8678 Closure law for half of a positive real. (Contributed by Mario Carneiro, 31-Jan-2014.)
(𝐴 ∈ ℝ+ → (𝐴 / 2) ∈ ℝ+)

Theoremrpgecl 8679 A number greater or equal to a positive real is positive real. (Contributed by Mario Carneiro, 28-May-2016.)
((𝐴 ∈ ℝ+𝐵 ∈ ℝ ∧ 𝐴𝐵) → 𝐵 ∈ ℝ+)

Theoremrphalflt 8680 Half of a positive real is less than the original number. (Contributed by Mario Carneiro, 21-May-2014.)
(𝐴 ∈ ℝ+ → (𝐴 / 2) < 𝐴)

Theoremrerpdivcl 8681 Closure law for division of a real by a positive real. (Contributed by NM, 10-Nov-2008.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴 / 𝐵) ∈ ℝ)

Theoremge0p1rp 8682 A nonnegative number plus one is a positive number. (Contributed by Mario Carneiro, 5-Oct-2015.)
((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 + 1) ∈ ℝ+)

Theoremrpnegap 8683 Either a real apart from zero or its negation is a positive real, but not both. (Contributed by Jim Kingdon, 23-Mar-2020.)
((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (𝐴 ∈ ℝ+ ⊻ -𝐴 ∈ ℝ+))

Theorem0nrp 8684 Zero is not a positive real. Axiom 9 of [Apostol] p. 20. (Contributed by NM, 27-Oct-2007.)
¬ 0 ∈ ℝ+

Theoremltsubrp 8685 Subtracting a positive real from another number decreases it. (Contributed by FL, 27-Dec-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → (𝐴𝐵) < 𝐴)

Theoremltaddrp 8686 Adding a positive number to another number increases it. (Contributed by FL, 27-Dec-2007.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ+) → 𝐴 < (𝐴 + 𝐵))

Theoremdifrp 8687 Two ways to say one number is less than another. (Contributed by Mario Carneiro, 21-May-2014.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐵𝐴) ∈ ℝ+))

Theoremelrpd 8688 Membership in the set of positive reals. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑 → 0 < 𝐴)       (𝜑𝐴 ∈ ℝ+)

Theoremnnrpd 8689 A positive integer is a positive real. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℕ)       (𝜑𝐴 ∈ ℝ+)

Theoremrpred 8690 A positive real is a real. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑𝐴 ∈ ℝ)

Theoremrpxrd 8691 A positive real is an extended real. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑𝐴 ∈ ℝ*)

Theoremrpcnd 8692 A positive real is a complex number. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑𝐴 ∈ ℂ)

Theoremrpgt0d 8693 A positive real is greater than zero. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → 0 < 𝐴)

Theoremrpge0d 8694 A positive real is greater than or equal to zero. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → 0 ≤ 𝐴)

Theoremrpne0d 8695 A positive real is nonzero. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑𝐴 ≠ 0)

Theoremrpap0d 8696 A positive real is apart from zero. (Contributed by Jim Kingdon, 28-Jul-2021.)
(𝜑𝐴 ∈ ℝ+)       (𝜑𝐴 # 0)

Theoremrpregt0d 8697 A positive real is real and greater than zero. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → (𝐴 ∈ ℝ ∧ 0 < 𝐴))

Theoremrprege0d 8698 A positive real is real and greater or equal to zero. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴))

Theoremrprene0d 8699 A positive real is a nonzero real number. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → (𝐴 ∈ ℝ ∧ 𝐴 ≠ 0))

Theoremrpcnne0d 8700 A positive real is a nonzero complex number. (Contributed by Mario Carneiro, 28-May-2016.)
(𝜑𝐴 ∈ ℝ+)       (𝜑 → (𝐴 ∈ ℂ ∧ 𝐴 ≠ 0))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10454
 Copyright terms: Public domain < Previous  Next >