HomeHome Intuitionistic Logic Explorer
Theorem List (p. 73 of 135)
< 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 - 7201-7300   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmulpipq2 7201 Multiplication of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.)
((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)
 
Theoremmulpipq 7202 Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.)
(((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → (⟨𝐴, 𝐵⟩ ·pQ𝐶, 𝐷⟩) = ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩)
 
Theoremmulpipqqs 7203 Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.)
(((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q ·Q [⟨𝐶, 𝐷⟩] ~Q ) = [⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩] ~Q )
 
Theoremordpipqqs 7204 Ordering of positive fractions in terms of positive integers. (Contributed by Jim Kingdon, 14-Sep-2019.)
(((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q <Q [⟨𝐶, 𝐷⟩] ~Q ↔ (𝐴 ·N 𝐷) <N (𝐵 ·N 𝐶)))
 
Theoremaddclnq 7205 Closure of addition on positive fractions. (Contributed by NM, 29-Aug-1995.)
((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) ∈ Q)
 
Theoremmulclnq 7206 Closure of multiplication on positive fractions. (Contributed by NM, 29-Aug-1995.)
((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) ∈ Q)
 
Theoremdmaddpqlem 7207* Decomposition of a positive fraction into numerator and denominator. Lemma for dmaddpq 7209. (Contributed by Jim Kingdon, 15-Sep-2019.)
(𝑥Q → ∃𝑤𝑣 𝑥 = [⟨𝑤, 𝑣⟩] ~Q )
 
Theoremnqpi 7208* Decomposition of a positive fraction into numerator and denominator. Similar to dmaddpqlem 7207 but also shows that the numerator and denominator are positive integers. (Contributed by Jim Kingdon, 20-Sep-2019.)
(𝐴Q → ∃𝑤𝑣((𝑤N𝑣N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q ))
 
Theoremdmaddpq 7209 Domain of addition on positive fractions. (Contributed by NM, 24-Aug-1995.)
dom +Q = (Q × Q)
 
Theoremdmmulpq 7210 Domain of multiplication on positive fractions. (Contributed by NM, 24-Aug-1995.)
dom ·Q = (Q × Q)
 
Theoremaddcomnqg 7211 Addition of positive fractions is commutative. (Contributed by Jim Kingdon, 15-Sep-2019.)
((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) = (𝐵 +Q 𝐴))
 
Theoremaddassnqg 7212 Addition of positive fractions is associative. (Contributed by Jim Kingdon, 16-Sep-2019.)
((𝐴Q𝐵Q𝐶Q) → ((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶)))
 
Theoremmulcomnqg 7213 Multiplication of positive fractions is commutative. (Contributed by Jim Kingdon, 17-Sep-2019.)
((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) = (𝐵 ·Q 𝐴))
 
Theoremmulassnqg 7214 Multiplication of positive fractions is associative. (Contributed by Jim Kingdon, 17-Sep-2019.)
((𝐴Q𝐵Q𝐶Q) → ((𝐴 ·Q 𝐵) ·Q 𝐶) = (𝐴 ·Q (𝐵 ·Q 𝐶)))
 
Theoremmulcanenq 7215 Lemma for distributive law: cancellation of common factor. (Contributed by NM, 2-Sep-1995.) (Revised by Mario Carneiro, 8-May-2013.)
((𝐴N𝐵N𝐶N) → ⟨(𝐴 ·N 𝐵), (𝐴 ·N 𝐶)⟩ ~Q𝐵, 𝐶⟩)
 
Theoremmulcanenqec 7216 Lemma for distributive law: cancellation of common factor. (Contributed by Jim Kingdon, 17-Sep-2019.)
((𝐴N𝐵N𝐶N) → [⟨(𝐴 ·N 𝐵), (𝐴 ·N 𝐶)⟩] ~Q = [⟨𝐵, 𝐶⟩] ~Q )
 
Theoremdistrnqg 7217 Multiplication of positive fractions is distributive. (Contributed by Jim Kingdon, 17-Sep-2019.)
((𝐴Q𝐵Q𝐶Q) → (𝐴 ·Q (𝐵 +Q 𝐶)) = ((𝐴 ·Q 𝐵) +Q (𝐴 ·Q 𝐶)))
 
Theorem1qec 7218 The equivalence class of ratio 1. (Contributed by NM, 4-Mar-1996.)
(𝐴N → 1Q = [⟨𝐴, 𝐴⟩] ~Q )
 
Theoremmulidnq 7219 Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.)
(𝐴Q → (𝐴 ·Q 1Q) = 𝐴)
 
Theoremrecexnq 7220* Existence of positive fraction reciprocal. (Contributed by Jim Kingdon, 20-Sep-2019.)
(𝐴Q → ∃𝑦(𝑦Q ∧ (𝐴 ·Q 𝑦) = 1Q))
 
Theoremrecmulnqg 7221 Relationship between reciprocal and multiplication on positive fractions. (Contributed by Jim Kingdon, 19-Sep-2019.)
((𝐴Q𝐵Q) → ((*Q𝐴) = 𝐵 ↔ (𝐴 ·Q 𝐵) = 1Q))
 
Theoremrecclnq 7222 Closure law for positive fraction reciprocal. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 8-May-2013.)
(𝐴Q → (*Q𝐴) ∈ Q)
 
Theoremrecidnq 7223 A positive fraction times its reciprocal is 1. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 8-May-2013.)
(𝐴Q → (𝐴 ·Q (*Q𝐴)) = 1Q)
 
Theoremrecrecnq 7224 Reciprocal of reciprocal of positive fraction. (Contributed by NM, 26-Apr-1996.) (Revised by Mario Carneiro, 29-Apr-2013.)
(𝐴Q → (*Q‘(*Q𝐴)) = 𝐴)
 
Theoremrec1nq 7225 Reciprocal of positive fraction one. (Contributed by Jim Kingdon, 29-Dec-2019.)
(*Q‘1Q) = 1Q
 
Theoremnqtri3or 7226 Trichotomy for positive fractions. (Contributed by Jim Kingdon, 21-Sep-2019.)
((𝐴Q𝐵Q) → (𝐴 <Q 𝐵𝐴 = 𝐵𝐵 <Q 𝐴))
 
Theoremltdcnq 7227 Less-than for positive fractions is decidable. (Contributed by Jim Kingdon, 12-Dec-2019.)
((𝐴Q𝐵Q) → DECID 𝐴 <Q 𝐵)
 
Theoremltsonq 7228 'Less than' is a strict ordering on positive fractions. (Contributed by NM, 19-Feb-1996.) (Revised by Mario Carneiro, 4-May-2013.)
<Q Or Q
 
Theoremnqtric 7229 Trichotomy for positive fractions. (Contributed by Jim Kingdon, 21-Sep-2019.)
((𝐴Q𝐵Q) → (𝐴 <Q 𝐵 ↔ ¬ (𝐴 = 𝐵𝐵 <Q 𝐴)))
 
Theoremltanqg 7230 Ordering property of addition for positive fractions. Proposition 9-2.6(ii) of [Gleason] p. 120. (Contributed by Jim Kingdon, 22-Sep-2019.)
((𝐴Q𝐵Q𝐶Q) → (𝐴 <Q 𝐵 ↔ (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵)))
 
Theoremltmnqg 7231 Ordering property of multiplication for positive fractions. Proposition 9-2.6(iii) of [Gleason] p. 120. (Contributed by Jim Kingdon, 22-Sep-2019.)
((𝐴Q𝐵Q𝐶Q) → (𝐴 <Q 𝐵 ↔ (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵)))
 
Theoremltanqi 7232 Ordering property of addition for positive fractions. One direction of ltanqg 7230. (Contributed by Jim Kingdon, 9-Dec-2019.)
((𝐴 <Q 𝐵𝐶Q) → (𝐶 +Q 𝐴) <Q (𝐶 +Q 𝐵))
 
Theoremltmnqi 7233 Ordering property of multiplication for positive fractions. One direction of ltmnqg 7231. (Contributed by Jim Kingdon, 9-Dec-2019.)
((𝐴 <Q 𝐵𝐶Q) → (𝐶 ·Q 𝐴) <Q (𝐶 ·Q 𝐵))
 
Theoremlt2addnq 7234 Ordering property of addition for positive fractions. (Contributed by Jim Kingdon, 7-Dec-2019.)
(((𝐴Q𝐵Q) ∧ (𝐶Q𝐷Q)) → ((𝐴 <Q 𝐵𝐶 <Q 𝐷) → (𝐴 +Q 𝐶) <Q (𝐵 +Q 𝐷)))
 
Theoremlt2mulnq 7235 Ordering property of multiplication for positive fractions. (Contributed by Jim Kingdon, 18-Jul-2021.)
(((𝐴Q𝐵Q) ∧ (𝐶Q𝐷Q)) → ((𝐴 <Q 𝐵𝐶 <Q 𝐷) → (𝐴 ·Q 𝐶) <Q (𝐵 ·Q 𝐷)))
 
Theorem1lt2nq 7236 One is less than two (one plus one). (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.)
1Q <Q (1Q +Q 1Q)
 
Theoremltaddnq 7237 The sum of two fractions is greater than one of them. (Contributed by NM, 14-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.)
((𝐴Q𝐵Q) → 𝐴 <Q (𝐴 +Q 𝐵))
 
Theoremltexnqq 7238* Ordering on positive fractions in terms of existence of sum. Definition in Proposition 9-2.6 of [Gleason] p. 119. (Contributed by Jim Kingdon, 23-Sep-2019.)
((𝐴Q𝐵Q) → (𝐴 <Q 𝐵 ↔ ∃𝑥Q (𝐴 +Q 𝑥) = 𝐵))
 
Theoremltexnqi 7239* Ordering on positive fractions in terms of existence of sum. (Contributed by Jim Kingdon, 30-Apr-2020.)
(𝐴 <Q 𝐵 → ∃𝑥Q (𝐴 +Q 𝑥) = 𝐵)
 
Theoremhalfnqq 7240* One-half of any positive fraction is a fraction. (Contributed by Jim Kingdon, 23-Sep-2019.)
(𝐴Q → ∃𝑥Q (𝑥 +Q 𝑥) = 𝐴)
 
Theoremhalfnq 7241* 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.)
(𝐴Q → ∃𝑥(𝑥 +Q 𝑥) = 𝐴)
 
Theoremnsmallnqq 7242* There is no smallest positive fraction. (Contributed by Jim Kingdon, 24-Sep-2019.)
(𝐴Q → ∃𝑥Q 𝑥 <Q 𝐴)
 
Theoremnsmallnq 7243* There is no smallest positive fraction. (Contributed by NM, 26-Apr-1996.) (Revised by Mario Carneiro, 10-May-2013.)
(𝐴Q → ∃𝑥 𝑥 <Q 𝐴)
 
Theoremsubhalfnqq 7244* There is a number which is less than half of any positive fraction. The case where 𝐴 is one is Lemma 11.4 of [BauerTaylor], p. 50, and they use the word "approximate half" for such a number (since there may be constructions, for some structures other than the rationals themselves, which rely on such an approximate half but do not require division by two as seen at halfnqq 7240). (Contributed by Jim Kingdon, 25-Nov-2019.)
(𝐴Q → ∃𝑥Q (𝑥 +Q 𝑥) <Q 𝐴)
 
Theoremltbtwnnqq 7245* There exists a number between any two positive fractions. Proposition 9-2.6(i) of [Gleason] p. 120. (Contributed by Jim Kingdon, 24-Sep-2019.)
(𝐴 <Q 𝐵 ↔ ∃𝑥Q (𝐴 <Q 𝑥𝑥 <Q 𝐵))
 
Theoremltbtwnnq 7246* 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.)
(𝐴 <Q 𝐵 ↔ ∃𝑥(𝐴 <Q 𝑥𝑥 <Q 𝐵))
 
Theoremarchnqq 7247* For any fraction, there is an integer that is greater than it. This is also known as the "archimedean property". (Contributed by Jim Kingdon, 1-Dec-2019.)
(𝐴Q → ∃𝑥N 𝐴 <Q [⟨𝑥, 1o⟩] ~Q )
 
Theoremprarloclemarch 7248* A version of the Archimedean property. This variation is "stronger" than archnqq 7247 in the sense that we provide an integer which is larger than a given rational 𝐴 even after being multiplied by a second rational 𝐵. (Contributed by Jim Kingdon, 30-Nov-2019.)
((𝐴Q𝐵Q) → ∃𝑥N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))
 
Theoremprarloclemarch2 7249* Like prarloclemarch 7248 but the integer must be at least two, and there is also 𝐵 added to the right hand side. These details follow straightforwardly but are chosen to be helpful in the proof of prarloc 7333. (Contributed by Jim Kingdon, 25-Nov-2019.)
((𝐴Q𝐵Q𝐶Q) → ∃𝑥N (1o <N 𝑥𝐴 <Q (𝐵 +Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐶))))
 
Theoremltrnqg 7250 Ordering property of reciprocal for positive fractions. For a simplified version of the forward implication, see ltrnqi 7251. (Contributed by Jim Kingdon, 29-Dec-2019.)
((𝐴Q𝐵Q) → (𝐴 <Q 𝐵 ↔ (*Q𝐵) <Q (*Q𝐴)))
 
Theoremltrnqi 7251 Ordering property of reciprocal for positive fractions. For the converse, see ltrnqg 7250. (Contributed by Jim Kingdon, 24-Sep-2019.)
(𝐴 <Q 𝐵 → (*Q𝐵) <Q (*Q𝐴))
 
Theoremnnnq 7252 The canonical embedding of positive integers into positive fractions. (Contributed by Jim Kingdon, 26-Apr-2020.)
(𝐴N → [⟨𝐴, 1o⟩] ~QQ)
 
Theoremltnnnq 7253 Ordering of positive integers via <N or <Q is equivalent. (Contributed by Jim Kingdon, 3-Oct-2020.)
((𝐴N𝐵N) → (𝐴 <N 𝐵 ↔ [⟨𝐴, 1o⟩] ~Q <Q [⟨𝐵, 1o⟩] ~Q ))
 
Definitiondf-enq0 7254* Define equivalence relation for nonnegative fractions. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 2-Nov-2019.)
~Q0 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (ω × N) ∧ 𝑦 ∈ (ω × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·o 𝑢) = (𝑤 ·o 𝑣)))}
 
Definitiondf-nq0 7255 Define class of nonnegative fractions. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 2-Nov-2019.)
Q0 = ((ω × N) / ~Q0 )
 
Definitiondf-0nq0 7256 Define nonnegative fraction constant 0. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 5-Nov-2019.)
0Q0 = [⟨∅, 1o⟩] ~Q0
 
Definitiondf-plq0 7257* Define addition on nonnegative fractions. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 2-Nov-2019.)
+Q0 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q0𝑦Q0) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q0𝑦 = [⟨𝑢, 𝑓⟩] ~Q0 ) ∧ 𝑧 = [⟨((𝑤 ·o 𝑓) +o (𝑣 ·o 𝑢)), (𝑣 ·o 𝑓)⟩] ~Q0 ))}
 
Definitiondf-mq0 7258* Define multiplication on nonnegative fractions. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 2-Nov-2019.)
·Q0 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q0𝑦Q0) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q0𝑦 = [⟨𝑢, 𝑓⟩] ~Q0 ) ∧ 𝑧 = [⟨(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)⟩] ~Q0 ))}
 
Theoremdfmq0qs 7259* Multiplication on nonnegative fractions. This definition is similar to df-mq0 7258 but expands Q0 (Contributed by Jim Kingdon, 22-Nov-2019.)
·Q0 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q0𝑦 = [⟨𝑢, 𝑓⟩] ~Q0 ) ∧ 𝑧 = [⟨(𝑤 ·o 𝑢), (𝑣 ·o 𝑓)⟩] ~Q0 ))}
 
Theoremdfplq0qs 7260* Addition on nonnegative fractions. This definition is similar to df-plq0 7257 but expands Q0 (Contributed by Jim Kingdon, 24-Nov-2019.)
+Q0 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ((ω × N) / ~Q0 ) ∧ 𝑦 ∈ ((ω × N) / ~Q0 )) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = [⟨𝑤, 𝑣⟩] ~Q0𝑦 = [⟨𝑢, 𝑓⟩] ~Q0 ) ∧ 𝑧 = [⟨((𝑤 ·o 𝑓) +o (𝑣 ·o 𝑢)), (𝑣 ·o 𝑓)⟩] ~Q0 ))}
 
Theoremenq0enq 7261 Equivalence on positive fractions in terms of equivalence on nonnegative fractions. (Contributed by Jim Kingdon, 12-Nov-2019.)
~Q = ( ~Q0 ∩ ((N × N) × (N × N)))
 
Theoremenq0sym 7262 The equivalence relation for nonnegative fractions is symmetric. Lemma for enq0er 7265. (Contributed by Jim Kingdon, 14-Nov-2019.)
(𝑓 ~Q0 𝑔𝑔 ~Q0 𝑓)
 
Theoremenq0ref 7263 The equivalence relation for nonnegative fractions is reflexive. Lemma for enq0er 7265. (Contributed by Jim Kingdon, 14-Nov-2019.)
(𝑓 ∈ (ω × N) ↔ 𝑓 ~Q0 𝑓)
 
Theoremenq0tr 7264 The equivalence relation for nonnegative fractions is transitive. Lemma for enq0er 7265. (Contributed by Jim Kingdon, 14-Nov-2019.)
((𝑓 ~Q0 𝑔𝑔 ~Q0 ) → 𝑓 ~Q0 )
 
Theoremenq0er 7265 The equivalence relation for nonnegative fractions is an equivalence relation. (Contributed by Jim Kingdon, 12-Nov-2019.)
~Q0 Er (ω × N)
 
Theoremenq0breq 7266 Equivalence relation for nonnegative fractions in terms of natural numbers. (Contributed by NM, 27-Aug-1995.)
(((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) → (⟨𝐴, 𝐵⟩ ~Q0𝐶, 𝐷⟩ ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))
 
Theoremenq0eceq 7267 Equivalence class equality of nonnegative fractions in terms of natural numbers. (Contributed by Jim Kingdon, 24-Nov-2019.)
(((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q0 = [⟨𝐶, 𝐷⟩] ~Q0 ↔ (𝐴 ·o 𝐷) = (𝐵 ·o 𝐶)))
 
Theoremnqnq0pi 7268 A nonnegative fraction is a positive fraction if its numerator and denominator are positive integers. (Contributed by Jim Kingdon, 10-Nov-2019.)
((𝐴N𝐵N) → [⟨𝐴, 𝐵⟩] ~Q0 = [⟨𝐴, 𝐵⟩] ~Q )
 
Theoremenq0ex 7269 The equivalence relation for positive fractions exists. (Contributed by Jim Kingdon, 18-Nov-2019.)
~Q0 ∈ V
 
Theoremnq0ex 7270 The class of positive fractions exists. (Contributed by Jim Kingdon, 18-Nov-2019.)
Q0 ∈ V
 
Theoremnqnq0 7271 A positive fraction is a nonnegative fraction. (Contributed by Jim Kingdon, 18-Nov-2019.)
QQ0
 
Theoremnq0nn 7272* Decomposition of a nonnegative fraction into numerator and denominator. (Contributed by Jim Kingdon, 24-Nov-2019.)
(𝐴Q0 → ∃𝑤𝑣((𝑤 ∈ ω ∧ 𝑣N) ∧ 𝐴 = [⟨𝑤, 𝑣⟩] ~Q0 ))
 
Theoremaddcmpblnq0 7273 Lemma showing compatibility of addition on nonnegative fractions. (Contributed by Jim Kingdon, 23-Nov-2019.)
((((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) ∧ ((𝐹 ∈ ω ∧ 𝐺N) ∧ (𝑅 ∈ ω ∧ 𝑆N))) → (((𝐴 ·o 𝐷) = (𝐵 ·o 𝐶) ∧ (𝐹 ·o 𝑆) = (𝐺 ·o 𝑅)) → ⟨((𝐴 ·o 𝐺) +o (𝐵 ·o 𝐹)), (𝐵 ·o 𝐺)⟩ ~Q0 ⟨((𝐶 ·o 𝑆) +o (𝐷 ·o 𝑅)), (𝐷 ·o 𝑆)⟩))
 
Theoremmulcmpblnq0 7274 Lemma showing compatibility of multiplication on nonnegative fractions. (Contributed by Jim Kingdon, 20-Nov-2019.)
((((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) ∧ ((𝐹 ∈ ω ∧ 𝐺N) ∧ (𝑅 ∈ ω ∧ 𝑆N))) → (((𝐴 ·o 𝐷) = (𝐵 ·o 𝐶) ∧ (𝐹 ·o 𝑆) = (𝐺 ·o 𝑅)) → ⟨(𝐴 ·o 𝐹), (𝐵 ·o 𝐺)⟩ ~Q0 ⟨(𝐶 ·o 𝑅), (𝐷 ·o 𝑆)⟩))
 
Theoremmulcanenq0ec 7275 Lemma for distributive law: cancellation of common factor. (Contributed by Jim Kingdon, 29-Nov-2019.)
((𝐴N𝐵 ∈ ω ∧ 𝐶N) → [⟨(𝐴 ·o 𝐵), (𝐴 ·o 𝐶)⟩] ~Q0 = [⟨𝐵, 𝐶⟩] ~Q0 )
 
Theoremnnnq0lem1 7276* Decomposing nonnegative fractions into natural numbers. Lemma for addnnnq0 7279 and mulnnnq0 7280. (Contributed by Jim Kingdon, 23-Nov-2019.)
(((𝐴 ∈ ((ω × N) / ~Q0 ) ∧ 𝐵 ∈ ((ω × N) / ~Q0 )) ∧ (((𝐴 = [⟨𝑤, 𝑣⟩] ~Q0𝐵 = [⟨𝑢, 𝑡⟩] ~Q0 ) ∧ 𝑧 = [𝐶] ~Q0 ) ∧ ((𝐴 = [⟨𝑠, 𝑓⟩] ~Q0𝐵 = [⟨𝑔, ⟩] ~Q0 ) ∧ 𝑞 = [𝐷] ~Q0 ))) → ((((𝑤 ∈ ω ∧ 𝑣N) ∧ (𝑠 ∈ ω ∧ 𝑓N)) ∧ ((𝑢 ∈ ω ∧ 𝑡N) ∧ (𝑔 ∈ ω ∧ N))) ∧ ((𝑤 ·o 𝑓) = (𝑣 ·o 𝑠) ∧ (𝑢 ·o ) = (𝑡 ·o 𝑔))))
 
Theoremaddnq0mo 7277* There is at most one result from adding nonnegative fractions. (Contributed by Jim Kingdon, 23-Nov-2019.)
((𝐴 ∈ ((ω × N) / ~Q0 ) ∧ 𝐵 ∈ ((ω × N) / ~Q0 )) → ∃*𝑧𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ~Q0𝐵 = [⟨𝑢, 𝑡⟩] ~Q0 ) ∧ 𝑧 = [⟨((𝑤 ·o 𝑡) +o (𝑣 ·o 𝑢)), (𝑣 ·o 𝑡)⟩] ~Q0 ))
 
Theoremmulnq0mo 7278* There is at most one result from multiplying nonnegative fractions. (Contributed by Jim Kingdon, 20-Nov-2019.)
((𝐴 ∈ ((ω × N) / ~Q0 ) ∧ 𝐵 ∈ ((ω × N) / ~Q0 )) → ∃*𝑧𝑤𝑣𝑢𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ~Q0𝐵 = [⟨𝑢, 𝑡⟩] ~Q0 ) ∧ 𝑧 = [⟨(𝑤 ·o 𝑢), (𝑣 ·o 𝑡)⟩] ~Q0 ))
 
Theoremaddnnnq0 7279 Addition of nonnegative fractions in terms of natural numbers. (Contributed by Jim Kingdon, 22-Nov-2019.)
(((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q0 +Q0 [⟨𝐶, 𝐷⟩] ~Q0 ) = [⟨((𝐴 ·o 𝐷) +o (𝐵 ·o 𝐶)), (𝐵 ·o 𝐷)⟩] ~Q0 )
 
Theoremmulnnnq0 7280 Multiplication of nonnegative fractions in terms of natural numbers. (Contributed by Jim Kingdon, 19-Nov-2019.)
(((𝐴 ∈ ω ∧ 𝐵N) ∧ (𝐶 ∈ ω ∧ 𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q0 ·Q0 [⟨𝐶, 𝐷⟩] ~Q0 ) = [⟨(𝐴 ·o 𝐶), (𝐵 ·o 𝐷)⟩] ~Q0 )
 
Theoremaddclnq0 7281 Closure of addition on nonnegative fractions. (Contributed by Jim Kingdon, 29-Nov-2019.)
((𝐴Q0𝐵Q0) → (𝐴 +Q0 𝐵) ∈ Q0)
 
Theoremmulclnq0 7282 Closure of multiplication on nonnegative fractions. (Contributed by Jim Kingdon, 30-Nov-2019.)
((𝐴Q0𝐵Q0) → (𝐴 ·Q0 𝐵) ∈ Q0)
 
Theoremnqpnq0nq 7283 A positive fraction plus a nonnegative fraction is a positive fraction. (Contributed by Jim Kingdon, 30-Nov-2019.)
((𝐴Q𝐵Q0) → (𝐴 +Q0 𝐵) ∈ Q)
 
Theoremnqnq0a 7284 Addition of positive fractions is equal with +Q or +Q0. (Contributed by Jim Kingdon, 10-Nov-2019.)
((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) = (𝐴 +Q0 𝐵))
 
Theoremnqnq0m 7285 Multiplication of positive fractions is equal with ·Q or ·Q0. (Contributed by Jim Kingdon, 10-Nov-2019.)
((𝐴Q𝐵Q) → (𝐴 ·Q 𝐵) = (𝐴 ·Q0 𝐵))
 
Theoremnq0m0r 7286 Multiplication with zero for nonnegative fractions. (Contributed by Jim Kingdon, 5-Nov-2019.)
(𝐴Q0 → (0Q0 ·Q0 𝐴) = 0Q0)
 
Theoremnq0a0 7287 Addition with zero for nonnegative fractions. (Contributed by Jim Kingdon, 5-Nov-2019.)
(𝐴Q0 → (𝐴 +Q0 0Q0) = 𝐴)
 
Theoremnnanq0 7288 Addition of nonnegative fractions with a common denominator. You can add two fractions with the same denominator by adding their numerators and keeping the same denominator. (Contributed by Jim Kingdon, 1-Dec-2019.)
((𝑁 ∈ ω ∧ 𝑀 ∈ ω ∧ 𝐴N) → [⟨(𝑁 +o 𝑀), 𝐴⟩] ~Q0 = ([⟨𝑁, 𝐴⟩] ~Q0 +Q0 [⟨𝑀, 𝐴⟩] ~Q0 ))
 
Theoremdistrnq0 7289 Multiplication of nonnegative fractions is distributive. (Contributed by Jim Kingdon, 27-Nov-2019.)
((𝐴Q0𝐵Q0𝐶Q0) → (𝐴 ·Q0 (𝐵 +Q0 𝐶)) = ((𝐴 ·Q0 𝐵) +Q0 (𝐴 ·Q0 𝐶)))
 
Theoremmulcomnq0 7290 Multiplication of nonnegative fractions is commutative. (Contributed by Jim Kingdon, 27-Nov-2019.)
((𝐴Q0𝐵Q0) → (𝐴 ·Q0 𝐵) = (𝐵 ·Q0 𝐴))
 
Theoremaddassnq0lemcl 7291 A natural number closure law. Lemma for addassnq0 7292. (Contributed by Jim Kingdon, 3-Dec-2019.)
(((𝐼 ∈ ω ∧ 𝐽N) ∧ (𝐾 ∈ ω ∧ 𝐿N)) → (((𝐼 ·o 𝐿) +o (𝐽 ·o 𝐾)) ∈ ω ∧ (𝐽 ·o 𝐿) ∈ N))
 
Theoremaddassnq0 7292 Addition of nonnegative fractions is associative. (Contributed by Jim Kingdon, 29-Nov-2019.)
((𝐴Q0𝐵Q0𝐶Q0) → ((𝐴 +Q0 𝐵) +Q0 𝐶) = (𝐴 +Q0 (𝐵 +Q0 𝐶)))
 
Theoremdistnq0r 7293 Multiplication of nonnegative fractions is distributive. Version of distrnq0 7289 with the multiplications commuted. (Contributed by Jim Kingdon, 29-Nov-2019.)
((𝐴Q0𝐵Q0𝐶Q0) → ((𝐵 +Q0 𝐶) ·Q0 𝐴) = ((𝐵 ·Q0 𝐴) +Q0 (𝐶 ·Q0 𝐴)))
 
Theoremaddpinq1 7294 Addition of one to the numerator of a fraction whose denominator is one. (Contributed by Jim Kingdon, 26-Apr-2020.)
(𝐴N → [⟨(𝐴 +N 1o), 1o⟩] ~Q = ([⟨𝐴, 1o⟩] ~Q +Q 1Q))
 
Theoremnq02m 7295 Multiply a nonnegative fraction by two. (Contributed by Jim Kingdon, 29-Nov-2019.)
(𝐴Q0 → ([⟨2o, 1o⟩] ~Q0 ·Q0 𝐴) = (𝐴 +Q0 𝐴))
 
Definitiondf-inp 7296* 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.

Here we follow the definition of a Dedekind cut from Definition 11.2.1 of [HoTT], p. (varies) with the one exception that we define it over positive rational numbers rather than all rational numbers.

A Dedekind cut is an ordered pair of a lower set 𝑙 and an upper set 𝑢 which is inhabited (𝑞Q𝑞𝑙 ∧ ∃𝑟Q𝑟𝑢), rounded (𝑞Q(𝑞𝑙 ↔ ∃𝑟Q(𝑞 <Q 𝑟𝑟𝑙)) and likewise for 𝑢), disjoint (𝑞Q¬ (𝑞𝑙𝑞𝑢)) and located (𝑞Q𝑟Q(𝑞 <Q 𝑟 → (𝑞𝑙𝑟𝑢))). See HoTT for more discussion of those terms and different ways of defining Dedekind cuts.

(Note: This is a "temporary" definition used in the construction of complex numbers, and is intended to be used only by the construction.) (Contributed by Jim Kingdon, 25-Sep-2019.)

P = {⟨𝑙, 𝑢⟩ ∣ (((𝑙Q𝑢Q) ∧ (∃𝑞Q 𝑞𝑙 ∧ ∃𝑟Q 𝑟𝑢)) ∧ ((∀𝑞Q (𝑞𝑙 ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟𝑙)) ∧ ∀𝑟Q (𝑟𝑢 ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞𝑢))) ∧ ∀𝑞Q ¬ (𝑞𝑙𝑞𝑢) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞𝑙𝑟𝑢))))}
 
Definitiondf-i1p 7297* Define the positive real constant 1. This is a "temporary" set used in the construction of complex numbers and is intended to be used only by the construction. (Contributed by Jim Kingdon, 25-Sep-2019.)
1P = ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
 
Definitiondf-iplp 7298* Define addition on positive reals. From Section 11.2.1 of [HoTT], p. (varies). We write this definition to closely resemble the definition in HoTT although some of the conditions are redundant (for example, 𝑟 ∈ (1st𝑥) implies 𝑟Q) and can be simplified as shown at genpdf 7338.

This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 26-Sep-2019.)

+P = (𝑥P, 𝑦P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑥) ∧ 𝑠 ∈ (1st𝑦) ∧ 𝑞 = (𝑟 +Q 𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑥) ∧ 𝑠 ∈ (2nd𝑦) ∧ 𝑞 = (𝑟 +Q 𝑠))}⟩)
 
Definitiondf-imp 7299* Define multiplication on positive reals. Here we use a simple definition which is similar to df-iplp 7298 or the definition of multiplication on positive reals in Metamath Proof Explorer. This is as opposed to the more complicated definition of multiplication given in Section 11.2.1 of [HoTT], p. (varies), which appears to be motivated by handling negative numbers or handling modified Dedekind cuts in which locatedness is omitted.

This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 29-Sep-2019.)

·P = (𝑥P, 𝑦P ↦ ⟨{𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (1st𝑥) ∧ 𝑠 ∈ (1st𝑦) ∧ 𝑞 = (𝑟 ·Q 𝑠))}, {𝑞Q ∣ ∃𝑟Q𝑠Q (𝑟 ∈ (2nd𝑥) ∧ 𝑠 ∈ (2nd𝑦) ∧ 𝑞 = (𝑟 ·Q 𝑠))}⟩)
 
Definitiondf-iltp 7300* Define ordering on positive reals. We define 𝑥<P 𝑦 if there is a positive fraction 𝑞 which is an element of the upper cut of 𝑥 and the lower cut of 𝑦. From the definition of < in Section 11.2.1 of [HoTT], p. (varies).

This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by Jim Kingdon, 29-Sep-2019.)

<P = {⟨𝑥, 𝑦⟩ ∣ ((𝑥P𝑦P) ∧ ∃𝑞Q (𝑞 ∈ (2nd𝑥) ∧ 𝑞 ∈ (1st𝑦)))}
    < 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-13434
  Copyright terms: Public domain < Previous  Next >