HomeHome Metamath Proof Explorer
Theorem List (p. 99 of 429)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-27903)
  Hilbert Space Explorer  Hilbert Space Explorer
(27904-29428)
  Users' Mathboxes  Users' Mathboxes
(29429-42879)
 

Theorem List for Metamath Proof Explorer - 9801-9900   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmulpqnq 9801 Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 26-Dec-2014.) (New usage is discouraged.)
((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) = ([Q]‘(𝐴 ·pQ 𝐵)))
 
Theoremordpipq 9802 Ordering of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
(⟨𝐴, 𝐵⟩ <pQ𝐶, 𝐷⟩ ↔ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))
 
Theoremordpinq 9803 Ordering of positive fractions in terms of positive integers. (Contributed by NM, 13-Feb-1996.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
((𝐴Q𝐵Q) → (𝐴 <Q 𝐵 ↔ ((1st𝐴) ·N (2nd𝐵)) <N ((1st𝐵) ·N (2nd𝐴))))
 
Theoremaddpqf 9804 Closure of addition on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
+pQ :((N × N) × (N × N))⟶(N × N)
 
Theoremaddclnq 9805 Closure of addition on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) ∈ Q)
 
Theoremmulpqf 9806 Closure of multiplication on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
·pQ :((N × N) × (N × N))⟶(N × N)
 
Theoremmulclnq 9807 Closure of multiplication on positive fractions. (Contributed by NM, 29-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) ∈ Q)
 
Theoremaddnqf 9808 Domain of addition on positive fractions. (Contributed by NM, 24-Aug-1995.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.)
+Q :(Q × Q)⟶Q
 
Theoremmulnqf 9809 Domain of multiplication on positive fractions. (Contributed by NM, 24-Aug-1995.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.)
·Q :(Q × Q)⟶Q
 
Theoremaddcompq 9810 Addition of positive fractions is commutative. (Contributed by NM, 30-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴 +pQ 𝐵) = (𝐵 +pQ 𝐴)
 
Theoremaddcomnq 9811 Addition of positive fractions is commutative. (Contributed by NM, 30-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴 +Q 𝐵) = (𝐵 +Q 𝐴)
 
Theoremmulcompq 9812 Multiplication of positive fractions is commutative. (Contributed by NM, 31-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴 ·pQ 𝐵) = (𝐵 ·pQ 𝐴)
 
Theoremmulcomnq 9813 Multiplication of positive fractions is commutative. (Contributed by NM, 31-Aug-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴 ·Q 𝐵) = (𝐵 ·Q 𝐴)
 
Theoremadderpqlem 9814 Lemma for adderpq 9816. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 +pQ 𝐶) ~Q (𝐵 +pQ 𝐶)))
 
Theoremmulerpqlem 9815 Lemma for mulerpq 9817. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 ·pQ 𝐶) ~Q (𝐵 ·pQ 𝐶)))
 
Theoremadderpq 9816 Addition is compatible with the equivalence relation. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
(([Q]‘𝐴) +Q ([Q]‘𝐵)) = ([Q]‘(𝐴 +pQ 𝐵))
 
Theoremmulerpq 9817 Multiplication is compatible with the equivalence relation. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
(([Q]‘𝐴) ·Q ([Q]‘𝐵)) = ([Q]‘(𝐴 ·pQ 𝐵))
 
Theoremaddassnq 9818 Addition of positive fractions is associative. (Contributed by NM, 2-Sep-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶))
 
Theoremmulassnq 9819 Multiplication of positive fractions is associative. (Contributed by NM, 1-Sep-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴 ·Q 𝐵) ·Q 𝐶) = (𝐴 ·Q (𝐵 ·Q 𝐶))
 
Theoremmulcanenq 9820 Lemma for distributive law: cancellation of common factor. (Contributed by NM, 2-Sep-1995.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
((𝐴N𝐵N𝐶N) → ⟨(𝐴 ·N 𝐵), (𝐴 ·N 𝐶)⟩ ~Q𝐵, 𝐶⟩)
 
Theoremdistrnq 9821 Multiplication of positive fractions is distributive. (Contributed by NM, 2-Sep-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴 ·Q (𝐵 +Q 𝐶)) = ((𝐴 ·Q 𝐵) +Q (𝐴 ·Q 𝐶))
 
Theorem1nqenq 9822 The equivalence class of ratio 1. (Contributed by NM, 4-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴N → 1Q ~Q𝐴, 𝐴⟩)
 
Theoremmulidnq 9823 Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
(𝐴Q → (𝐴 ·Q 1Q) = 𝐴)
 
Theoremrecmulnq 9824 Relationship between reciprocal and multiplication on positive fractions. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.) (New usage is discouraged.)
(𝐴Q → ((*Q𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q))
 
Theoremrecidnq 9825 A positive fraction times its reciprocal is 1. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
(𝐴Q → (𝐴 ·Q (*Q𝐴)) = 1Q)
 
Theoremrecclnq 9826 Closure law for positive fraction reciprocal. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
(𝐴Q → (*Q𝐴) ∈ Q)
 
Theoremrecrecnq 9827 Reciprocal of reciprocal of positive fraction. (Contributed by NM, 26-Apr-1996.) (Revised by Mario Carneiro, 29-Apr-2013.) (New usage is discouraged.)
(𝐴Q → (*Q‘(*Q𝐴)) = 𝐴)
 
Theoremdmrecnq 9828 Domain of reciprocal on positive fractions. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 10-Jul-2014.) (New usage is discouraged.)
dom *Q = Q
 
Theoremltsonq 9829 'Less than' is a strict ordering on positive fractions. (Contributed by NM, 19-Feb-1996.) (Revised by Mario Carneiro, 4-May-2013.) (New usage is discouraged.)
<Q Or Q
 
Theoremlterpq 9830 Compatibility of ordering on equivalent fractions. (Contributed by Mario Carneiro, 9-May-2013.) (New usage is discouraged.)
(𝐴 <pQ 𝐵 ↔ ([Q]‘𝐴) <Q ([Q]‘𝐵))
 
Theoremltanq 9831 Ordering property of addition for positive fractions. Proposition 9-2.6(ii) of [Gleason] p. 120. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐶Q → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))
 
Theoremltmnq 9832 Ordering property of multiplication for positive fractions. Proposition 9-2.6(iii) of [Gleason] p. 120. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐶Q → (𝐴 <Q 𝐵 ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵)))
 
Theorem1lt2nq 9833 One is less than two (one plus one). (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
1Q <Q (1Q +Q 1Q)
 
Theoremltaddnq 9834 The sum of two fractions is greater than one of them. (Contributed by NM, 14-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
((𝐴Q𝐵Q) → 𝐴 <Q (𝐴 +Q 𝐵))
 
Theoremltexnq 9835* Ordering on positive fractions in terms of existence of sum. Definition in Proposition 9-2.6 of [Gleason] p. 119. (Contributed by NM, 24-Apr-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐵Q → (𝐴 <Q 𝐵 ↔ ∃𝑥(𝐴 +Q 𝑥) = 𝐵))
 
Theoremhalfnq 9836* One-half of any positive fraction exists. Lemma for Proposition 9-2.6(i) of [Gleason] p. 120. (Contributed by NM, 16-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐴Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
 
Theoremnsmallnq 9837* The is no smallest positive fraction. (Contributed by NM, 26-Apr-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐴Q → ∃𝑥 𝑥 <Q 𝐴)
 
Theoremltbtwnnq 9838* There exists a number between any two positive fractions. Proposition 9-2.6(i) of [Gleason] p. 120. (Contributed by NM, 17-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐴 <Q 𝐵 ↔ ∃𝑥(𝐴 <Q 𝑥𝑥 <Q 𝐵))
 
Theoremltrnq 9839 Ordering property of reciprocal for positive fractions. Proposition 9-2.6(iv) of [Gleason] p. 120. (Contributed by NM, 9-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐴 <Q 𝐵 ↔ (*Q𝐵) <Q (*Q𝐴))
 
Theoremarchnq 9840* For any fraction, there is an integer that is greater than it. This is also known as the "archimedean property". (Contributed by Mario Carneiro, 10-May-2013.) (New usage is discouraged.)
(𝐴Q → ∃𝑥N 𝐴 <Q𝑥, 1𝑜⟩)
 
Definitiondf-np 9841* Define the set of positive reals. A "Dedekind cut" is a partition of the positive rational numbers into two classes such that all the numbers of one class are less than all the numbers of the other. A positive real is defined as the lower class of a Dedekind cut. Definition 9-3.1 of [Gleason] p. 121. (Note: This is a "temporary" definition used in the construction of complex numbers df-c 9980, and is intended to be used only by the construction.) (Contributed by NM, 31-Oct-1995.) (New usage is discouraged.)
P = {𝑥 ∣ ((∅ ⊊ 𝑥𝑥Q) ∧ ∀𝑦𝑥 (∀𝑧(𝑧 <Q 𝑦𝑧𝑥) ∧ ∃𝑧𝑥 𝑦 <Q 𝑧))}
 
Definitiondf-1p 9842 Define the positive real constant 1. This is a "temporary" set used in the construction of complex numbers df-c 9980, and is intended to be used only by the construction. Definition of [Gleason] p. 122. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)
1P = {𝑥𝑥 <Q 1Q}
 
Definitiondf-plp 9843* Define addition on positive reals. This is a "temporary" set used in the construction of complex numbers df-c 9980, and is intended to be used only by the construction. From Proposition 9-3.5 of [Gleason] p. 123. (Contributed by NM, 18-Nov-1995.) (New usage is discouraged.)
+P = (𝑥P, 𝑦P ↦ {𝑤 ∣ ∃𝑣𝑥𝑢𝑦 𝑤 = (𝑣 +Q 𝑢)})
 
Definitiondf-mp 9844* Define multiplication on positive reals. This is a "temporary" set used in the construction of complex numbers df-c 9980, and is intended to be used only by the construction. From Proposition 9-3.7 of [Gleason] p. 124. (Contributed by NM, 18-Nov-1995.) (New usage is discouraged.)
·P = (𝑥P, 𝑦P ↦ {𝑤 ∣ ∃𝑣𝑥𝑢𝑦 𝑤 = (𝑣 ·Q 𝑢)})
 
Definitiondf-ltp 9845* Define ordering on positive reals. This is a "temporary" set used in the construction of complex numbers df-c 9980, and is intended to be used only by the construction. From Proposition 9-3.2 of [Gleason] p. 122. (Contributed by NM, 14-Feb-1996.) (New usage is discouraged.)
<P = {⟨𝑥, 𝑦⟩ ∣ ((𝑥P𝑦P) ∧ 𝑥𝑦)}
 
Theoremnpex 9846 The class of positive reals is a set. (Contributed by NM, 31-Oct-1995.) (New usage is discouraged.)
P ∈ V
 
Theoremelnp 9847* Membership in positive reals. (Contributed by NM, 16-Feb-1996.) (New usage is discouraged.)
(𝐴P ↔ ((∅ ⊊ 𝐴𝐴Q) ∧ ∀𝑥𝐴 (∀𝑦(𝑦 <Q 𝑥𝑦𝐴) ∧ ∃𝑦𝐴 𝑥 <Q 𝑦)))
 
Theoremelnpi 9848* Membership in positive reals. (Contributed by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
(𝐴P ↔ ((𝐴 ∈ V ∧ ∅ ⊊ 𝐴𝐴Q) ∧ ∀𝑥𝐴 (∀𝑦(𝑦 <Q 𝑥𝑦𝐴) ∧ ∃𝑦𝐴 𝑥 <Q 𝑦)))
 
Theoremprn0 9849 A positive real is not empty. (Contributed by NM, 15-May-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
(𝐴P𝐴 ≠ ∅)
 
Theoremprpssnq 9850 A positive real is a subset of the positive fractions. (Contributed by NM, 29-Feb-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
(𝐴P𝐴Q)
 
Theoremelprnq 9851 A positive real is a set of positive fractions. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
((𝐴P𝐵𝐴) → 𝐵Q)
 
Theorem0npr 9852 The empty set is not a positive real. (Contributed by NM, 15-Nov-1995.) (New usage is discouraged.)
¬ ∅ ∈ P
 
Theoremprcdnq 9853 A positive real is closed downwards under the positive fractions. Definition 9-3.1 (ii) of [Gleason] p. 121. (Contributed by NM, 25-Feb-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
((𝐴P𝐵𝐴) → (𝐶 <Q 𝐵𝐶𝐴))
 
Theoremprub 9854 A positive fraction not in a positive real is an upper bound. Remark (1) of [Gleason] p. 122. (Contributed by NM, 25-Feb-1996.) (New usage is discouraged.)
(((𝐴P𝐵𝐴) ∧ 𝐶Q) → (¬ 𝐶𝐴𝐵 <Q 𝐶))
 
Theoremprnmax 9855* A positive real has no largest member. Definition 9-3.1(iii) of [Gleason] p. 121. (Contributed by NM, 9-Mar-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
((𝐴P𝐵𝐴) → ∃𝑥𝐴 𝐵 <Q 𝑥)
 
Theoremnpomex 9856 A simplifying observation, and an indication of why any attempt to develop a theory of the real numbers without the Axiom of Infinity is doomed to failure: since every member of P is an infinite set, the negation of Infinity implies that P, and hence , is empty. (Note that this proof, which used the fact that Dedekind cuts have no maximum, could just as well have used that they have no minimum, since they are downward-closed by prcdnq 9853 and nsmallnq 9837). (Contributed by Mario Carneiro, 11-May-2013.) (Revised by Mario Carneiro, 16-Nov-2014.) (New usage is discouraged.)
(𝐴P → ω ∈ V)
 
Theoremprnmadd 9857* A positive real has no largest member. Addition version. (Contributed by NM, 7-Apr-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
((𝐴P𝐵𝐴) → ∃𝑥(𝐵 +Q 𝑥) ∈ 𝐴)
 
Theoremltrelpr 9858 Positive real 'less than' is a relation on positive reals. (Contributed by NM, 14-Feb-1996.) (New usage is discouraged.)
<P ⊆ (P × P)
 
Theoremgenpv 9859* Value of general operation (addition or multiplication) on positive reals. (Contributed by NM, 10-Mar-1996.) (Revised by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       ((𝐴P𝐵P) → (𝐴𝐹𝐵) = {𝑓 ∣ ∃𝑔𝐴𝐵 𝑓 = (𝑔𝐺)})
 
Theoremgenpelv 9860* Membership in value of general operation (addition or multiplication) on positive reals. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       ((𝐴P𝐵P) → (𝐶 ∈ (𝐴𝐹𝐵) ↔ ∃𝑔𝐴𝐵 𝐶 = (𝑔𝐺)))
 
Theoremgenpprecl 9861* Pre-closure law for general operation on positive reals. (Contributed by NM, 10-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       ((𝐴P𝐵P) → ((𝐶𝐴𝐷𝐵) → (𝐶𝐺𝐷) ∈ (𝐴𝐹𝐵)))
 
Theoremgenpdm 9862* Domain of general operation on positive reals. (Contributed by NM, 18-Nov-1995.) (Revised by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       dom 𝐹 = (P × P)
 
Theoremgenpn0 9863* The result of an operation on positive reals is not empty. (Contributed by NM, 28-Feb-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       ((𝐴P𝐵P) → ∅ ⊊ (𝐴𝐹𝐵))
 
Theoremgenpss 9864* The result of an operation on positive reals is a subset of the positive fractions. (Contributed by NM, 18-Nov-1995.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)       ((𝐴P𝐵P) → (𝐴𝐹𝐵) ⊆ Q)
 
Theoremgenpnnp 9865* The result of an operation on positive reals is different from the set of positive fractions. (Contributed by NM, 29-Feb-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)    &   (𝑧Q → (𝑥 <Q 𝑦 ↔ (𝑧𝐺𝑥) <Q (𝑧𝐺𝑦)))    &   (𝑥𝐺𝑦) = (𝑦𝐺𝑥)       ((𝐴P𝐵P) → ¬ (𝐴𝐹𝐵) = Q)
 
Theoremgenpcd 9866* Downward closure of an operation on positive reals. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)    &   ((((𝐴P𝑔𝐴) ∧ (𝐵P𝐵)) ∧ 𝑥Q) → (𝑥 <Q (𝑔𝐺) → 𝑥 ∈ (𝐴𝐹𝐵)))       ((𝐴P𝐵P) → (𝑓 ∈ (𝐴𝐹𝐵) → (𝑥 <Q 𝑓𝑥 ∈ (𝐴𝐹𝐵))))
 
Theoremgenpnmax 9867* An operation on positive reals has no largest member. (Contributed by NM, 10-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)    &   (𝑣Q → (𝑧 <Q 𝑤 ↔ (𝑣𝐺𝑧) <Q (𝑣𝐺𝑤)))    &   (𝑧𝐺𝑤) = (𝑤𝐺𝑧)       ((𝐴P𝐵P) → (𝑓 ∈ (𝐴𝐹𝐵) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥))
 
Theoremgenpcl 9868* Closure of an operation on reals. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)    &   (Q → (𝑓 <Q 𝑔 ↔ (𝐺𝑓) <Q (𝐺𝑔)))    &   (𝑥𝐺𝑦) = (𝑦𝐺𝑥)    &   ((((𝐴P𝑔𝐴) ∧ (𝐵P𝐵)) ∧ 𝑥Q) → (𝑥 <Q (𝑔𝐺) → 𝑥 ∈ (𝐴𝐹𝐵)))       ((𝐴P𝐵P) → (𝐴𝐹𝐵) ∈ P)
 
Theoremgenpass 9869* Associativity of an operation on reals. (Contributed by NM, 18-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
𝐹 = (𝑤P, 𝑣P ↦ {𝑥 ∣ ∃𝑦𝑤𝑧𝑣 𝑥 = (𝑦𝐺𝑧)})    &   ((𝑦Q𝑧Q) → (𝑦𝐺𝑧) ∈ Q)    &   dom 𝐹 = (P × P)    &   ((𝑓P𝑔P) → (𝑓𝐹𝑔) ∈ P)    &   ((𝑓𝐺𝑔)𝐺) = (𝑓𝐺(𝑔𝐺))       ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))
 
Theoremplpv 9870* Value of addition on positive reals. (Contributed by NM, 28-Feb-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴 +P 𝐵) = {𝑥 ∣ ∃𝑦𝐴𝑧𝐵 𝑥 = (𝑦 +Q 𝑧)})
 
Theoremmpv 9871* Value of multiplication on positive reals. (Contributed by NM, 28-Feb-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴 ·P 𝐵) = {𝑥 ∣ ∃𝑦𝐴𝑧𝐵 𝑥 = (𝑦 ·Q 𝑧)})
 
Theoremdmplp 9872 Domain of addition on positive reals. (Contributed by NM, 18-Nov-1995.) (New usage is discouraged.)
dom +P = (P × P)
 
Theoremdmmp 9873 Domain of multiplication on positive reals. (Contributed by NM, 18-Nov-1995.) (New usage is discouraged.)
dom ·P = (P × P)
 
Theoremnqpr 9874* The canonical embedding of the rationals into the reals. (Contributed by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
(𝐴Q → {𝑥𝑥 <Q 𝐴} ∈ P)
 
Theorem1pr 9875 The positive real number 'one'. (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
1PP
 
Theoremaddclprlem1 9876 Lemma to prove downward closure in positive real addition. Part of proof of Proposition 9-3.5 of [Gleason] p. 123. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)
(((𝐴P𝑔𝐴) ∧ 𝑥Q) → (𝑥 <Q (𝑔 +Q ) → ((𝑥 ·Q (*Q‘(𝑔 +Q ))) ·Q 𝑔) ∈ 𝐴))
 
Theoremaddclprlem2 9877* Lemma to prove downward closure in positive real addition. Part of proof of Proposition 9-3.5 of [Gleason] p. 123. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)
((((𝐴P𝑔𝐴) ∧ (𝐵P𝐵)) ∧ 𝑥Q) → (𝑥 <Q (𝑔 +Q ) → 𝑥 ∈ (𝐴 +P 𝐵)))
 
Theoremaddclpr 9878 Closure of addition on positive reals. First statement of Proposition 9-3.5 of [Gleason] p. 123. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
 
Theoremmulclprlem 9879* Lemma to prove downward closure in positive real multiplication. Part of proof of Proposition 9-3.7 of [Gleason] p. 124. (Contributed by NM, 14-Mar-1996.) (New usage is discouraged.)
((((𝐴P𝑔𝐴) ∧ (𝐵P𝐵)) ∧ 𝑥Q) → (𝑥 <Q (𝑔 ·Q ) → 𝑥 ∈ (𝐴 ·P 𝐵)))
 
Theoremmulclpr 9880 Closure of multiplication on positive reals. First statement of Proposition 9-3.7 of [Gleason] p. 124. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴 ·P 𝐵) ∈ P)
 
Theoremaddcompr 9881 Addition of positive reals is commutative. Proposition 9-3.5(ii) of [Gleason] p. 123. (Contributed by NM, 19-Nov-1995.) (New usage is discouraged.)
(𝐴 +P 𝐵) = (𝐵 +P 𝐴)
 
Theoremaddasspr 9882 Addition of positive reals is associative. Proposition 9-3.5(i) of [Gleason] p. 123. (Contributed by NM, 18-Mar-1996.) (New usage is discouraged.)
((𝐴 +P 𝐵) +P 𝐶) = (𝐴 +P (𝐵 +P 𝐶))
 
Theoremmulcompr 9883 Multiplication of positive reals is commutative. Proposition 9-3.7(ii) of [Gleason] p. 124. (Contributed by NM, 19-Nov-1995.) (New usage is discouraged.)
(𝐴 ·P 𝐵) = (𝐵 ·P 𝐴)
 
Theoremmulasspr 9884 Multiplication of positive reals is associative. Proposition 9-3.7(i) of [Gleason] p. 124. (Contributed by NM, 18-Mar-1996.) (New usage is discouraged.)
((𝐴 ·P 𝐵) ·P 𝐶) = (𝐴 ·P (𝐵 ·P 𝐶))
 
Theoremdistrlem1pr 9885 Lemma for distributive law for positive reals. (Contributed by NM, 1-May-1996.) (Revised by Mario Carneiro, 13-Jun-2013.) (New usage is discouraged.)
((𝐴P𝐵P𝐶P) → (𝐴 ·P (𝐵 +P 𝐶)) ⊆ ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)))
 
Theoremdistrlem4pr 9886* Lemma for distributive law for positive reals. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 14-Jun-2013.) (New usage is discouraged.)
(((𝐴P𝐵P𝐶P) ∧ ((𝑥𝐴𝑦𝐵) ∧ (𝑓𝐴𝑧𝐶))) → ((𝑥 ·Q 𝑦) +Q (𝑓 ·Q 𝑧)) ∈ (𝐴 ·P (𝐵 +P 𝐶)))
 
Theoremdistrlem5pr 9887 Lemma for distributive law for positive reals. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 14-Jun-2013.) (New usage is discouraged.)
((𝐴P𝐵P𝐶P) → ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶)) ⊆ (𝐴 ·P (𝐵 +P 𝐶)))
 
Theoremdistrpr 9888 Multiplication of positive reals is distributive. Proposition 9-3.7(iii) of [Gleason] p. 124. (Contributed by NM, 2-May-1996.) (New usage is discouraged.)
(𝐴 ·P (𝐵 +P 𝐶)) = ((𝐴 ·P 𝐵) +P (𝐴 ·P 𝐶))
 
Theorem1idpr 9889 1 is an identity element for positive real multiplication. Theorem 9-3.7(iv) of [Gleason] p. 124. (Contributed by NM, 2-Apr-1996.) (New usage is discouraged.)
(𝐴P → (𝐴 ·P 1P) = 𝐴)
 
Theoremltprord 9890 Positive real 'less than' in terms of proper subset. (Contributed by NM, 20-Feb-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴<P 𝐵𝐴𝐵))
 
Theorempsslinpr 9891 Proper subset is a linear ordering on positive reals. Part of Proposition 9-3.3 of [Gleason] p. 122. (Contributed by NM, 25-Feb-1996.) (New usage is discouraged.)
((𝐴P𝐵P) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
 
Theoremltsopr 9892 Positive real 'less than' is a strict ordering. Part of Proposition 9-3.3 of [Gleason] p. 122. (Contributed by NM, 25-Feb-1996.) (New usage is discouraged.)
<P Or P
 
Theoremprlem934 9893* Lemma 9-3.4 of [Gleason] p. 122. (Contributed by NM, 25-Mar-1996.) (Revised by Mario Carneiro, 11-May-2013.) (New usage is discouraged.)
𝐵 ∈ V       (𝐴P → ∃𝑥𝐴 ¬ (𝑥 +Q 𝐵) ∈ 𝐴)
 
Theoremltaddpr 9894 The sum of two positive reals is greater than one of them. Proposition 9-3.5(iii) of [Gleason] p. 123. (Contributed by NM, 26-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)
((𝐴P𝐵P) → 𝐴<P (𝐴 +P 𝐵))
 
Theoremltaddpr2 9895 The sum of two positive reals is greater than one of them. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
(𝐶P → ((𝐴 +P 𝐵) = 𝐶𝐴<P 𝐶))
 
Theoremltexprlem1 9896* Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 3-Apr-1996.) (New usage is discouraged.)
𝐶 = {𝑥 ∣ ∃𝑦𝑦𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)}       (𝐵P → (𝐴𝐵𝐶 ≠ ∅))
 
Theoremltexprlem2 9897* Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 3-Apr-1996.) (New usage is discouraged.)
𝐶 = {𝑥 ∣ ∃𝑦𝑦𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)}       (𝐵P𝐶Q)
 
Theoremltexprlem3 9898* Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 6-Apr-1996.) (New usage is discouraged.)
𝐶 = {𝑥 ∣ ∃𝑦𝑦𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)}       (𝐵P → (𝑥𝐶 → ∀𝑧(𝑧 <Q 𝑥𝑧𝐶)))
 
Theoremltexprlem4 9899* Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 6-Apr-1996.) (New usage is discouraged.)
𝐶 = {𝑥 ∣ ∃𝑦𝑦𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)}       (𝐵P → (𝑥𝐶 → ∃𝑧(𝑧𝐶𝑥 <Q 𝑧)))
 
Theoremltexprlem5 9900* Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 6-Apr-1996.) (New usage is discouraged.)
𝐶 = {𝑥 ∣ ∃𝑦𝑦𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)}       ((𝐵P𝐴𝐵) → 𝐶P)
    < Previous  Next >

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-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
  Copyright terms: Public domain < Previous  Next >