HomeHome Metamath Proof Explorer
Theorem List (p. 259 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 - 25801-25900   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremttglem 25801 Lemma for ttgbas 25802 and ttgvsca 25805. (Contributed by Thierry Arnoux, 15-Apr-2019.)
𝐺 = (toTG‘𝐻)    &   𝐸 = Slot 𝑁    &   𝑁 ∈ ℕ    &   𝑁 < 16       (𝐸𝐻) = (𝐸𝐺)
 
Theoremttgbas 25802 The base set of a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &   𝐵 = (Base‘𝐻)       𝐵 = (Base‘𝐺)
 
Theoremttgplusg 25803 The addition operation of a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &    + = (+g𝐻)        + = (+g𝐺)
 
Theoremttgsub 25804 The subtraction operation of a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &    = (-g𝐻)        = (-g𝐺)
 
Theoremttgvsca 25805 The scalar product of a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &    · = ( ·𝑠𝐻)        · = ( ·𝑠𝐺)
 
Theoremttgds 25806 The metric of a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &   𝐷 = (dist‘𝐻)       𝐷 = (dist‘𝐺)
 
Theoremttgitvval 25807* Betweenness for a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &   𝐼 = (Itv‘𝐺)    &   𝑃 = (Base‘𝐻)    &    = (-g𝐻)    &    · = ( ·𝑠𝐻)       ((𝐻𝑉𝑋𝑃𝑌𝑃) → (𝑋𝐼𝑌) = {𝑧𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 𝑋) = (𝑘 · (𝑌 𝑋))})
 
Theoremttgelitv 25808* Betweenness for a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)
𝐺 = (toTG‘𝐻)    &   𝐼 = (Itv‘𝐺)    &   𝑃 = (Base‘𝐻)    &    = (-g𝐻)    &    · = ( ·𝑠𝐻)    &   (𝜑𝑋𝑃)    &   (𝜑𝑌𝑃)    &   (𝜑𝐻𝑉)    &   (𝜑𝑍𝑃)       (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 𝑋) = (𝑘 · (𝑌 𝑋))))
 
Theoremttgbtwnid 25809 Any subcomplex module equipped with the betweenness operation fulfills the identity of betweenness (Axiom A6). (Contributed by Thierry Arnoux, 26-Mar-2019.)
𝐺 = (toTG‘𝐻)    &   𝐼 = (Itv‘𝐺)    &   𝑃 = (Base‘𝐻)    &    = (-g𝐻)    &    · = ( ·𝑠𝐻)    &   (𝜑𝑋𝑃)    &   (𝜑𝑌𝑃)    &   𝑅 = (Base‘(Scalar‘𝐻))    &   (𝜑 → (0[,]1) ⊆ 𝑅)    &   (𝜑𝐻 ∈ ℂMod)    &   (𝜑𝑌 ∈ (𝑋𝐼𝑋))       (𝜑𝑋 = 𝑌)
 
Theoremttgcontlem1 25810 Lemma for % ttgcont . (Contributed by Thierry Arnoux, 24-May-2019.)
𝐺 = (toTG‘𝐻)    &   𝐼 = (Itv‘𝐺)    &   𝑃 = (Base‘𝐻)    &    = (-g𝐻)    &    · = ( ·𝑠𝐻)    &   (𝜑𝑋𝑃)    &   (𝜑𝑌𝑃)    &   𝑅 = (Base‘(Scalar‘𝐻))    &   (𝜑 → (0[,]1) ⊆ 𝑅)    &    + = (+g𝐻)    &   (𝜑𝐻 ∈ ℂVec)    &   (𝜑𝐴𝑃)    &   (𝜑𝑁𝑃)    &   (𝜑𝑀 ≠ 0)    &   (𝜑𝐾 ≠ 0)    &   (𝜑𝐾 ≠ 1)    &   (𝜑𝐿𝑀)    &   (𝜑𝐿 ≤ (𝑀 / 𝐾))    &   (𝜑𝐿 ∈ (0[,]1))    &   (𝜑𝐾 ∈ (0[,]1))    &   (𝜑𝑀 ∈ (0[,]𝐿))    &   (𝜑 → (𝑋 𝐴) = (𝐾 · (𝑌 𝐴)))    &   (𝜑 → (𝑋 𝐴) = (𝑀 · (𝑁 𝐴)))    &   (𝜑𝐵 = (𝐴 + (𝐿 · (𝑁 𝐴))))       (𝜑𝐵 ∈ (𝑋𝐼𝑌))
 
Theoremxmstrkgc 25811 Any metric space fulfills Tarski's geometry axioms of congruence. (Contributed by Thierry Arnoux, 13-Mar-2019.)
(𝐺 ∈ ∞MetSp → 𝐺 ∈ TarskiGC)
 
15.4.1  Geometry in the complex plane
 
Theoremcchhllem 25812* Lemma for chlbas and chlvsca . (Contributed by Thierry Arnoux, 15-Apr-2019.)
𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet ⟨(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))⟩)    &   𝐸 = Slot 𝑁    &   𝑁 ∈ ℕ    &   (𝑁 < 5 ∨ 8 < 𝑁)       (𝐸‘ℂfld) = (𝐸𝐶)
 
15.4.2  Geometry in Euclidean spaces
 
15.4.2.1  Definition of the Euclidean space
 
Syntaxcee 25813 Declare the syntax for the Euclidean space generator.
class 𝔼
 
Syntaxcbtwn 25814 Declare the syntax for the Euclidean betweenness predicate.
class Btwn
 
Syntaxccgr 25815 Declare the syntax for the Euclidean congruence predicate.
class Cgr
 
Definitiondf-ee 25816 Define the Euclidean space generator. For details, see elee 25819. (Contributed by Scott Fenton, 3-Jun-2013.)
𝔼 = (𝑛 ∈ ℕ ↦ (ℝ ↑𝑚 (1...𝑛)))
 
Definitiondf-btwn 25817* Define the Euclidean betweenness predicate. For details, see brbtwn 25824. (Contributed by Scott Fenton, 3-Jun-2013.)
Btwn = {⟨⟨𝑥, 𝑧⟩, 𝑦⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑧 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛)) ∧ ∃𝑡 ∈ (0[,]1)∀𝑖 ∈ (1...𝑛)(𝑦𝑖) = (((1 − 𝑡) · (𝑥𝑖)) + (𝑡 · (𝑧𝑖))))}
 
Definitiondf-cgr 25818* Define the Euclidean congruence predicate. For details, see brcgr 25825. (Contributed by Scott Fenton, 3-Jun-2013.)
Cgr = {⟨𝑥, 𝑦⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ ((𝔼‘𝑛) × (𝔼‘𝑛)) ∧ 𝑦 ∈ ((𝔼‘𝑛) × (𝔼‘𝑛))) ∧ Σ𝑖 ∈ (1...𝑛)((((1st𝑥)‘𝑖) − ((2nd𝑥)‘𝑖))↑2) = Σ𝑖 ∈ (1...𝑛)((((1st𝑦)‘𝑖) − ((2nd𝑦)‘𝑖))↑2))}
 
Theoremelee 25819 Membership in a Euclidean space. We define Euclidean space here using Cartesian coordinates over 𝑁 space. We later abstract away from this using Tarski's geometry axioms, so this exact definition is unimportant. (Contributed by Scott Fenton, 3-Jun-2013.)
(𝑁 ∈ ℕ → (𝐴 ∈ (𝔼‘𝑁) ↔ 𝐴:(1...𝑁)⟶ℝ))
 
Theoremmptelee 25820* A condition for a mapping to be an element of a Euclidean space. (Contributed by Scott Fenton, 7-Jun-2013.)
(𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ))
 
Theoremeleenn 25821 If 𝐴 is in (𝔼‘𝑁), then 𝑁 is a natural. (Contributed by Scott Fenton, 1-Jul-2013.)
(𝐴 ∈ (𝔼‘𝑁) → 𝑁 ∈ ℕ)
 
Theoremeleei 25822 The forward direction of elee 25819. (Contributed by Scott Fenton, 1-Jul-2013.)
(𝐴 ∈ (𝔼‘𝑁) → 𝐴:(1...𝑁)⟶ℝ)
 
Theoremeedimeq 25823 A point belongs to at most one Euclidean space. (Contributed by Scott Fenton, 1-Jul-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐴 ∈ (𝔼‘𝑀)) → 𝑁 = 𝑀)
 
Theorembrbtwn 25824* The binary relation form of the betweenness predicate. The statement 𝐴 Btwn ⟨𝐵, 𝐶 should be informally read as "𝐴 lies on a line segment between 𝐵 and 𝐶. This exact definition is abstracted away by Tarski's geometry axioms later on. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) → (𝐴 Btwn ⟨𝐵, 𝐶⟩ ↔ ∃𝑡 ∈ (0[,]1)∀𝑖 ∈ (1...𝑁)(𝐴𝑖) = (((1 − 𝑡) · (𝐵𝑖)) + (𝑡 · (𝐶𝑖)))))
 
Theorembrcgr 25825* The binary relation form of the congruence predicate. The statement 𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷 should be read informally as "the 𝑁 dimensional point 𝐴 is as far from 𝐵 as 𝐶 is from 𝐷, or "the line segment 𝐴𝐵 is congruent to the line segment 𝐶𝐷. This particular definition is encapsulated by Tarski's axioms later on. (Contributed by Scott Fenton, 3-Jun-2013.)
(((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ↔ Σ𝑖 ∈ (1...𝑁)(((𝐴𝑖) − (𝐵𝑖))↑2) = Σ𝑖 ∈ (1...𝑁)(((𝐶𝑖) − (𝐷𝑖))↑2)))
 
Theoremfveere 25826 The function value of a point is a real. (Contributed by Scott Fenton, 10-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐼 ∈ (1...𝑁)) → (𝐴𝐼) ∈ ℝ)
 
Theoremfveecn 25827 The function value of a point is a complex. (Contributed by Scott Fenton, 10-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐼 ∈ (1...𝑁)) → (𝐴𝐼) ∈ ℂ)
 
Theoremeqeefv 25828* Two points are equal iff they agree in all dimensions. (Contributed by Scott Fenton, 10-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝐴 = 𝐵 ↔ ∀𝑖 ∈ (1...𝑁)(𝐴𝑖) = (𝐵𝑖)))
 
Theoremeqeelen 25829* Two points are equal iff the square of the distance between them is zero. (Contributed by Scott Fenton, 10-Jun-2013.) (Revised by Mario Carneiro, 22-May-2014.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝐴 = 𝐵 ↔ Σ𝑖 ∈ (1...𝑁)(((𝐴𝑖) − (𝐵𝑖))↑2) = 0))
 
Theorembrbtwn2 25830* Alternate characterization of betweenness, with no existential quantifiers. (Contributed by Scott Fenton, 24-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) → (𝐴 Btwn ⟨𝐵, 𝐶⟩ ↔ (∀𝑖 ∈ (1...𝑁)(((𝐵𝑖) − (𝐴𝑖)) · ((𝐶𝑖) − (𝐴𝑖))) ≤ 0 ∧ ∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐵𝑖) − (𝐴𝑖)) · ((𝐶𝑗) − (𝐴𝑗))) = (((𝐵𝑗) − (𝐴𝑗)) · ((𝐶𝑖) − (𝐴𝑖))))))
 
Theoremcolinearalglem1 25831 Lemma for colinearalg 25835. Expand out a multiplication. (Contributed by Scott Fenton, 24-Jun-2013.)
(((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ (𝐷 ∈ ℂ ∧ 𝐸 ∈ ℂ ∧ 𝐹 ∈ ℂ)) → (((𝐵𝐴) · (𝐹𝐷)) = ((𝐸𝐷) · (𝐶𝐴)) ↔ ((𝐵 · 𝐹) − ((𝐴 · 𝐹) + (𝐵 · 𝐷))) = ((𝐶 · 𝐸) − ((𝐴 · 𝐸) + (𝐶 · 𝐷)))))
 
Theoremcolinearalglem2 25832* Lemma for colinearalg 25835. Translate between two forms of the colinearity condition. (Contributed by Scott Fenton, 24-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) → (∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐵𝑖) − (𝐴𝑖)) · ((𝐶𝑗) − (𝐴𝑗))) = (((𝐵𝑗) − (𝐴𝑗)) · ((𝐶𝑖) − (𝐴𝑖))) ↔ ∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐶𝑖) − (𝐵𝑖)) · ((𝐴𝑗) − (𝐵𝑗))) = (((𝐶𝑗) − (𝐵𝑗)) · ((𝐴𝑖) − (𝐵𝑖)))))
 
Theoremcolinearalglem3 25833* Lemma for colinearalg 25835. Translate between two forms of the colinearity condition. (Contributed by Scott Fenton, 24-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) → (∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐵𝑖) − (𝐴𝑖)) · ((𝐶𝑗) − (𝐴𝑗))) = (((𝐵𝑗) − (𝐴𝑗)) · ((𝐶𝑖) − (𝐴𝑖))) ↔ ∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐴𝑖) − (𝐶𝑖)) · ((𝐵𝑗) − (𝐶𝑗))) = (((𝐴𝑗) − (𝐶𝑗)) · ((𝐵𝑖) − (𝐶𝑖)))))
 
Theoremcolinearalglem4 25834* Lemma for colinearalg 25835. Prove a disjunction that will be needed in the final proof. (Contributed by Scott Fenton, 27-Jun-2013.)
(((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ 𝐾 ∈ ℝ) → (∀𝑖 ∈ (1...𝑁)((((𝐾 · ((𝐶𝑖) − (𝐴𝑖))) + (𝐴𝑖)) − (𝐴𝑖)) · ((𝐶𝑖) − (𝐴𝑖))) ≤ 0 ∨ ∀𝑖 ∈ (1...𝑁)(((𝐶𝑖) − ((𝐾 · ((𝐶𝑖) − (𝐴𝑖))) + (𝐴𝑖))) · ((𝐴𝑖) − ((𝐾 · ((𝐶𝑖) − (𝐴𝑖))) + (𝐴𝑖)))) ≤ 0 ∨ ∀𝑖 ∈ (1...𝑁)(((𝐴𝑖) − (𝐶𝑖)) · (((𝐾 · ((𝐶𝑖) − (𝐴𝑖))) + (𝐴𝑖)) − (𝐶𝑖))) ≤ 0))
 
Theoremcolinearalg 25835* An algebraic characterization of colinearity. Note the similarity to brbtwn2 25830. (Contributed by Scott Fenton, 24-Jun-2013.)
((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) → ((𝐴 Btwn ⟨𝐵, 𝐶⟩ ∨ 𝐵 Btwn ⟨𝐶, 𝐴⟩ ∨ 𝐶 Btwn ⟨𝐴, 𝐵⟩) ↔ ∀𝑖 ∈ (1...𝑁)∀𝑗 ∈ (1...𝑁)(((𝐵𝑖) − (𝐴𝑖)) · ((𝐶𝑗) − (𝐴𝑗))) = (((𝐵𝑗) − (𝐴𝑗)) · ((𝐶𝑖) − (𝐴𝑖)))))
 
Theoremeleesub 25836* Membership of a subtraction mapping in a Euclidean space. (Contributed by Scott Fenton, 17-Jul-2013.)
𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴𝑖) − (𝐵𝑖)))       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁))
 
Theoremeleesubd 25837* Membership of a subtraction mapping in a Euclidean space. Deduction form of eleesub 25836. (Contributed by Scott Fenton, 17-Jul-2013.)
(𝜑𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴𝑖) − (𝐵𝑖))))       ((𝜑𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁))
 
15.4.2.2  Tarski's axioms for geometry for the Euclidean space
 
Theoremaxdimuniq 25838 The unique dimension axiom. If a point is in 𝑁 dimensional space and in 𝑀 dimensional space, then 𝑁 = 𝑀. This axiom is not traditionally presented with Tarski's axioms, but we require it here as we are considering spaces in arbitrary dimensions. (Contributed by Scott Fenton, 24-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁)) ∧ (𝑀 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑀))) → 𝑁 = 𝑀)
 
Theoremaxcgrrflx 25839 𝐴 is as far from 𝐵 as 𝐵 is from 𝐴. Axiom A1 of [Schwabhauser] p. 10. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ⟨𝐴, 𝐵⟩Cgr⟨𝐵, 𝐴⟩)
 
Theoremaxcgrtr 25840 Congruence is transitive. Axiom A2 of [Schwabhauser] p. 10. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → ((⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ∧ ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩) → ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩))
 
Theoremaxcgrid 25841 If there is no distance between 𝐴 and 𝐵, then 𝐴 = 𝐵. Axiom A3 of [Schwabhauser] p. 10. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐶⟩ → 𝐴 = 𝐵))
 
Theoremaxsegconlem1 25842* Lemma for axsegcon 25852. Handle the degenerate case. (Contributed by Scott Fenton, 7-Jun-2013.)
((𝐴 = 𝐵 ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)))) → ∃𝑥 ∈ (𝔼‘𝑁)∃𝑡 ∈ (0[,]1)(∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑡) · (𝐴𝑖)) + (𝑡 · (𝑥𝑖))) ∧ Σ𝑖 ∈ (1...𝑁)(((𝐵𝑖) − (𝑥𝑖))↑2) = Σ𝑖 ∈ (1...𝑁)(((𝐶𝑖) − (𝐷𝑖))↑2)))
 
Theoremaxsegconlem2 25843* Lemma for axsegcon 25852. Show that the square of the distance between two points is a real number. (Contributed by Scott Fenton, 17-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝑆 ∈ ℝ)
 
Theoremaxsegconlem3 25844* Lemma for axsegcon 25852. Show that the square of the distance between two points is nonnegative. (Contributed by Scott Fenton, 17-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 0 ≤ 𝑆)
 
Theoremaxsegconlem4 25845* Lemma for axsegcon 25852. Show that the distance between two points is a real number. (Contributed by Scott Fenton, 17-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (√‘𝑆) ∈ ℝ)
 
Theoremaxsegconlem5 25846* Lemma for axsegcon 25852. Show that the distance between two points is nonnegative. (Contributed by Scott Fenton, 17-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 0 ≤ (√‘𝑆))
 
Theoremaxsegconlem6 25847* Lemma for axsegcon 25852. Show that the distance between two distinct points is positive. (Contributed by Scott Fenton, 17-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)       ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐴𝐵) → 0 < (√‘𝑆))
 
Theoremaxsegconlem7 25848* Lemma for axsegcon 25852. Show that a particular ratio of distances is in the closed unit interval. (Contributed by Scott Fenton, 18-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)    &   𝑇 = Σ𝑝 ∈ (1...𝑁)(((𝐶𝑝) − (𝐷𝑝))↑2)       (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐴𝐵) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((√‘𝑆) / ((√‘𝑆) + (√‘𝑇))) ∈ (0[,]1))
 
Theoremaxsegconlem8 25849* Lemma for axsegcon 25852. Show that a particular mapping generates a point. (Contributed by Scott Fenton, 18-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)    &   𝑇 = Σ𝑝 ∈ (1...𝑁)(((𝐶𝑝) − (𝐷𝑝))↑2)    &   𝐹 = (𝑘 ∈ (1...𝑁) ↦ (((((√‘𝑆) + (√‘𝑇)) · (𝐵𝑘)) − ((√‘𝑇) · (𝐴𝑘))) / (√‘𝑆)))       (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐴𝐵) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → 𝐹 ∈ (𝔼‘𝑁))
 
Theoremaxsegconlem9 25850* Lemma for axsegcon 25852. Show that 𝐵𝐹 is congruent to 𝐶𝐷. (Contributed by Scott Fenton, 19-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)    &   𝑇 = Σ𝑝 ∈ (1...𝑁)(((𝐶𝑝) − (𝐷𝑝))↑2)    &   𝐹 = (𝑘 ∈ (1...𝑁) ↦ (((((√‘𝑆) + (√‘𝑇)) · (𝐵𝑘)) − ((√‘𝑇) · (𝐴𝑘))) / (√‘𝑆)))       (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐴𝐵) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → Σ𝑖 ∈ (1...𝑁)(((𝐵𝑖) − (𝐹𝑖))↑2) = Σ𝑖 ∈ (1...𝑁)(((𝐶𝑖) − (𝐷𝑖))↑2))
 
Theoremaxsegconlem10 25851* Lemma for axsegcon 25852. Show that the scaling constant from axsegconlem7 25848 produces the betweenness condition for 𝐴, 𝐵 and 𝐹. (Contributed by Scott Fenton, 21-Sep-2013.)
𝑆 = Σ𝑝 ∈ (1...𝑁)(((𝐴𝑝) − (𝐵𝑝))↑2)    &   𝑇 = Σ𝑝 ∈ (1...𝑁)(((𝐶𝑝) − (𝐷𝑝))↑2)    &   𝐹 = (𝑘 ∈ (1...𝑁) ↦ (((((√‘𝑆) + (√‘𝑇)) · (𝐵𝑘)) − ((√‘𝑇) · (𝐴𝑘))) / (√‘𝑆)))       (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐴𝐵) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − ((√‘𝑆) / ((√‘𝑆) + (√‘𝑇)))) · (𝐴𝑖)) + (((√‘𝑆) / ((√‘𝑆) + (√‘𝑇))) · (𝐹𝑖))))
 
Theoremaxsegcon 25852* Any segment 𝐴𝐵 can be extended to a point 𝑥 such that 𝐵𝑥 is congruent to 𝐶𝐷. Axiom A4 of [Schwabhauser] p. 11. (Contributed by Scott Fenton, 4-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ∃𝑥 ∈ (𝔼‘𝑁)(𝐵 Btwn ⟨𝐴, 𝑥⟩ ∧ ⟨𝐵, 𝑥⟩Cgr⟨𝐶, 𝐷⟩))
 
Theoremax5seglem1 25853* Lemma for ax5seg 25863. Rexpress a one congruence sum given betweenness. (Contributed by Scott Fenton, 11-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝑇 ∈ (0[,]1) ∧ ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))))) → Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐵𝑗))↑2) = ((𝑇↑2) · Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐶𝑗))↑2)))
 
Theoremax5seglem2 25854* Lemma for ax5seg 25863. Rexpress another congruence sum given betweenness. (Contributed by Scott Fenton, 11-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝑇 ∈ (0[,]1) ∧ ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))))) → Σ𝑗 ∈ (1...𝑁)(((𝐵𝑗) − (𝐶𝑗))↑2) = (((1 − 𝑇)↑2) · Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐶𝑗))↑2)))
 
Theoremax5seglem3a 25855 Lemma for ax5seg 25863. (Contributed by Scott Fenton, 7-May-2015.)
(((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) ∧ 𝑗 ∈ (1...𝑁)) → (((𝐴𝑗) − (𝐶𝑗)) ∈ ℝ ∧ ((𝐷𝑗) − (𝐹𝑗)) ∈ ℝ))
 
Theoremax5seglem3 25856* Lemma for ax5seg 25863. Combine congruences for points on a line. (Contributed by Scott Fenton, 11-Jun-2013.)
(((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) ∧ ((𝑇 ∈ (0[,]1) ∧ 𝑆 ∈ (0[,]1)) ∧ (∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))) ∧ ∀𝑖 ∈ (1...𝑁)(𝐸𝑖) = (((1 − 𝑆) · (𝐷𝑖)) + (𝑆 · (𝐹𝑖))))) ∧ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)) → Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐶𝑗))↑2) = Σ𝑗 ∈ (1...𝑁)(((𝐷𝑗) − (𝐹𝑗))↑2))
 
Theoremax5seglem4 25857* Lemma for ax5seg 25863. Given two distinct points, the scaling constant in a betweenness statement is nonzero. (Contributed by Scott Fenton, 11-Jun-2013.)
(((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) ∧ ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))) ∧ 𝐴𝐵) → 𝑇 ≠ 0)
 
Theoremax5seglem5 25858* Lemma for ax5seg 25863. If 𝐵 is between 𝐴 and 𝐶, and 𝐴 is distinct from 𝐵, then 𝐴 is distinct from 𝐶. (Contributed by Scott Fenton, 11-Jun-2013.)
(((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) ∧ (𝐴𝐵𝑇 ∈ (0[,]1) ∧ ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))))) → Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐶𝑗))↑2) ≠ 0)
 
Theoremax5seglem6 25859* Lemma for ax5seg 25863. Given two line segments that are divided into pieces, if the pieces are congruent, then the scaling constant is the same. (Contributed by Scott Fenton, 12-Jun-2013.)
(((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁)))) ∧ (𝐴𝐵 ∧ (𝑇 ∈ (0[,]1) ∧ 𝑆 ∈ (0[,]1)) ∧ (∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))) ∧ ∀𝑖 ∈ (1...𝑁)(𝐸𝑖) = (((1 − 𝑆) · (𝐷𝑖)) + (𝑆 · (𝐹𝑖))))) ∧ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)) → 𝑇 = 𝑆)
 
Theoremax5seglem7 25860 Lemma for ax5seg 25863. An algebraic calculation needed further down the line. (Contributed by Scott Fenton, 12-Jun-2013.)
𝐴 ∈ ℂ    &   𝑇 ∈ ℂ    &   𝐶 ∈ ℂ    &   𝐷 ∈ ℂ       (𝑇 · ((𝐶𝐷)↑2)) = ((((((1 − 𝑇) · 𝐴) + (𝑇 · 𝐶)) − 𝐷)↑2) + ((1 − 𝑇) · ((𝑇 · ((𝐴𝐶)↑2)) − ((𝐴𝐷)↑2))))
 
Theoremax5seglem8 25861 Lemma for ax5seg 25863. Use the weak deduction theorem to eliminate the hypotheses from ax5seglem7 25860. (Contributed by Scott Fenton, 11-Jun-2013.)
(((𝐴 ∈ ℂ ∧ 𝑇 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ)) → (𝑇 · ((𝐶𝐷)↑2)) = ((((((1 − 𝑇) · 𝐴) + (𝑇 · 𝐶)) − 𝐷)↑2) + ((1 − 𝑇) · ((𝑇 · ((𝐴𝐶)↑2)) − ((𝐴𝐷)↑2)))))
 
Theoremax5seglem9 25862* Lemma for ax5seg 25863. Take the calculation in ax5seglem8 25861 and turn it into a series of measurements. (Contributed by Scott Fenton, 12-Jun-2013.) (Revised by Mario Carneiro, 22-May-2014.)
(((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)))) ∧ (𝑇 ∈ (0[,]1) ∧ ∀𝑖 ∈ (1...𝑁)(𝐵𝑖) = (((1 − 𝑇) · (𝐴𝑖)) + (𝑇 · (𝐶𝑖))))) → (𝑇 · Σ𝑗 ∈ (1...𝑁)(((𝐶𝑗) − (𝐷𝑗))↑2)) = (Σ𝑗 ∈ (1...𝑁)(((𝐵𝑗) − (𝐷𝑗))↑2) + ((1 − 𝑇) · ((𝑇 · Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐶𝑗))↑2)) − Σ𝑗 ∈ (1...𝑁)(((𝐴𝑗) − (𝐷𝑗))↑2)))))
 
Theoremax5seg 25863 The five segment axiom. Take two triangles 𝐴𝐷𝐶 and 𝐸𝐻𝐺, a point 𝐵 on 𝐴𝐶, and a point 𝐹 on 𝐸𝐺. If all corresponding line segments except for 𝐶𝐷 and 𝐺𝐻 are congruent, then so are 𝐶𝐷 and 𝐺𝐻. Axiom A5 of [Schwabhauser] p. 11. (Contributed by Scott Fenton, 12-Jun-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → (((𝐴𝐵𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐹 Btwn ⟨𝐸, 𝐺⟩) ∧ (⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐹, 𝐺⟩) ∧ (⟨𝐴, 𝐷⟩Cgr⟨𝐸, 𝐻⟩ ∧ ⟨𝐵, 𝐷⟩Cgr⟨𝐹, 𝐻⟩)) → ⟨𝐶, 𝐷⟩Cgr⟨𝐺, 𝐻⟩))
 
Theoremaxbtwnid 25864 Points are indivisible. That is, if 𝐴 lies between 𝐵 and 𝐵, then 𝐴 = 𝐵. Axiom A6 of [Schwabhauser] p. 11. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝐴 Btwn ⟨𝐵, 𝐵⟩ → 𝐴 = 𝐵))
 
Theoremaxpaschlem 25865* Lemma for axpasch 25866. Set up coefficents used in the proof. (Contributed by Scott Fenton, 5-Jun-2013.)
((𝑇 ∈ (0[,]1) ∧ 𝑆 ∈ (0[,]1)) → ∃𝑟 ∈ (0[,]1)∃𝑝 ∈ (0[,]1)(𝑝 = ((1 − 𝑟) · (1 − 𝑇)) ∧ 𝑟 = ((1 − 𝑝) · (1 − 𝑆)) ∧ ((1 − 𝑟) · 𝑇) = ((1 − 𝑝) · 𝑆)))
 
Theoremaxpasch 25866* The inner Pasch axiom. Take a triangle 𝐴𝐶𝐸, a point 𝐷 on 𝐴𝐶, and a point 𝐵 extending 𝐶𝐸. Then 𝐴𝐸 and 𝐷𝐵 intersect at some point 𝑥. Axiom A7 of [Schwabhauser] p. 12. (Contributed by Scott Fenton, 3-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁))) → ((𝐷 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐸 Btwn ⟨𝐵, 𝐶⟩) → ∃𝑥 ∈ (𝔼‘𝑁)(𝑥 Btwn ⟨𝐷, 𝐵⟩ ∧ 𝑥 Btwn ⟨𝐸, 𝐴⟩)))
 
Theoremaxlowdimlem1 25867 Lemma for axlowdim 25886. Establish a particular constant function as a function. (Contributed by Scott Fenton, 29-Jun-2013.)
((3...𝑁) × {0}):(3...𝑁)⟶ℝ
 
Theoremaxlowdimlem2 25868 Lemma for axlowdim 25886. Show that two sets are disjoint. (Contributed by Scott Fenton, 29-Jun-2013.)
((1...2) ∩ (3...𝑁)) = ∅
 
Theoremaxlowdimlem3 25869 Lemma for axlowdim 25886. Set up a union property for an interval of integers. (Contributed by Scott Fenton, 29-Jun-2013.)
(𝑁 ∈ (ℤ‘2) → (1...𝑁) = ((1...2) ∪ (3...𝑁)))
 
Theoremaxlowdimlem4 25870 Lemma for axlowdim 25886. Set up a particular constant function. (Contributed by Scott Fenton, 17-Apr-2013.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       {⟨1, 𝐴⟩, ⟨2, 𝐵⟩}:(1...2)⟶ℝ
 
Theoremaxlowdimlem5 25871 Lemma for axlowdim 25886. Show that a particular union is a point in Euclidean space. (Contributed by Scott Fenton, 29-Jun-2013.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝑁 ∈ (ℤ‘2) → ({⟨1, 𝐴⟩, ⟨2, 𝐵⟩} ∪ ((3...𝑁) × {0})) ∈ (𝔼‘𝑁))
 
Theoremaxlowdimlem6 25872 Lemma for axlowdim 25886. Show that three points are non-colinear. (Contributed by Scott Fenton, 29-Jun-2013.)
𝐴 = ({⟨1, 0⟩, ⟨2, 0⟩} ∪ ((3...𝑁) × {0}))    &   𝐵 = ({⟨1, 1⟩, ⟨2, 0⟩} ∪ ((3...𝑁) × {0}))    &   𝐶 = ({⟨1, 0⟩, ⟨2, 1⟩} ∪ ((3...𝑁) × {0}))       (𝑁 ∈ (ℤ‘2) → ¬ (𝐴 Btwn ⟨𝐵, 𝐶⟩ ∨ 𝐵 Btwn ⟨𝐶, 𝐴⟩ ∨ 𝐶 Btwn ⟨𝐴, 𝐵⟩))
 
Theoremaxlowdimlem7 25873 Lemma for axlowdim 25886. Set up a point in Euclidean space. (Contributed by Scott Fenton, 29-Jun-2013.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))       (𝑁 ∈ (ℤ‘3) → 𝑃 ∈ (𝔼‘𝑁))
 
Theoremaxlowdimlem8 25874 Lemma for axlowdim 25886. Calculate the value of 𝑃 at three. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))       (𝑃‘3) = -1
 
Theoremaxlowdimlem9 25875 Lemma for axlowdim 25886. Calculate the value of 𝑃 away from three. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))       ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (𝑃𝐾) = 0)
 
Theoremaxlowdimlem10 25876 Lemma for axlowdim 25886. Set up a family of points in Euclidean space. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))       ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄 ∈ (𝔼‘𝑁))
 
Theoremaxlowdimlem11 25877 Lemma for axlowdim 25886. Calculate the value of 𝑄 at its distinguished point. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))       (𝑄‘(𝐼 + 1)) = 1
 
Theoremaxlowdimlem12 25878 Lemma for axlowdim 25886. Calculate the value of 𝑄 away from its distinguished point. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))       ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ (𝐼 + 1)) → (𝑄𝐾) = 0)
 
Theoremaxlowdimlem13 25879 Lemma for axlowdim 25886. Establish that 𝑃 and 𝑄 are different points. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))    &   𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))       ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑃𝑄)
 
Theoremaxlowdimlem14 25880 Lemma for axlowdim 25886. Take two possible 𝑄 from axlowdimlem10 25876. They are the same iff their distinguished values are the same. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))    &   𝑅 = ({⟨(𝐽 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐽 + 1)}) × {0}))       ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1)) ∧ 𝐽 ∈ (1...(𝑁 − 1))) → (𝑄 = 𝑅𝐼 = 𝐽))
 
Theoremaxlowdimlem15 25881* Lemma for axlowdim 25886. Set up a one-to-one function of points. (Contributed by Scott Fenton, 21-Apr-2013.)
𝐹 = (𝑖 ∈ (1...(𝑁 − 1)) ↦ if(𝑖 = 1, ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0})), ({⟨(𝑖 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝑖 + 1)}) × {0}))))       (𝑁 ∈ (ℤ‘3) → 𝐹:(1...(𝑁 − 1))–1-1→(𝔼‘𝑁))
 
Theoremaxlowdimlem16 25882* Lemma for axlowdim 25886. Set up a summation that will help establish distance. (Contributed by Scott Fenton, 21-Apr-2013.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))    &   𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))       ((𝑁 ∈ (ℤ‘3) ∧ 𝐼 ∈ (2...(𝑁 − 1))) → Σ𝑖 ∈ (3...𝑁)((𝑃𝑖)↑2) = Σ𝑖 ∈ (3...𝑁)((𝑄𝑖)↑2))
 
Theoremaxlowdimlem17 25883 Lemma for axlowdim 25886. Establish a congruence result. (Contributed by Scott Fenton, 22-Apr-2013.) (Proof shortened by Mario Carneiro, 22-May-2014.)
𝑃 = ({⟨3, -1⟩} ∪ (((1...𝑁) ∖ {3}) × {0}))    &   𝑄 = ({⟨(𝐼 + 1), 1⟩} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))    &   𝐴 = ({⟨1, 𝑋⟩, ⟨2, 𝑌⟩} ∪ ((3...𝑁) × {0}))    &   𝑋 ∈ ℝ    &   𝑌 ∈ ℝ       ((𝑁 ∈ (ℤ‘3) ∧ 𝐼 ∈ (2...(𝑁 − 1))) → ⟨𝑃, 𝐴⟩Cgr⟨𝑄, 𝐴⟩)
 
Theoremaxlowdim1 25884* The lower dimension axiom for one dimension. In any dimension, there are at least two distinct points. Theorem 3.13 of [Schwabhauser] p. 32, where it is derived from axlowdim2 25885. (Contributed by Scott Fenton, 22-Apr-2013.)
(𝑁 ∈ ℕ → ∃𝑥 ∈ (𝔼‘𝑁)∃𝑦 ∈ (𝔼‘𝑁)𝑥𝑦)
 
Theoremaxlowdim2 25885* The lower two-dimensional axiom. In any space where the dimension is greater than one, there are three non-colinear points. Axiom A8 of [Schwabhauser] p. 12. (Contributed by Scott Fenton, 15-Apr-2013.)
(𝑁 ∈ (ℤ‘2) → ∃𝑥 ∈ (𝔼‘𝑁)∃𝑦 ∈ (𝔼‘𝑁)∃𝑧 ∈ (𝔼‘𝑁) ¬ (𝑥 Btwn ⟨𝑦, 𝑧⟩ ∨ 𝑦 Btwn ⟨𝑧, 𝑥⟩ ∨ 𝑧 Btwn ⟨𝑥, 𝑦⟩))
 
Theoremaxlowdim 25886* The general lower dimension axiom. Take a dimension 𝑁 greater than or equal to three. Then, there are three non-colinear points in 𝑁 dimensional space that are equidistant from 𝑁 − 1 distinct points. Derived from remarks in Tarski's System of Geometry, Alfred Tarski and Steven Givant, Bulletin of Symbolic Logic, Volume 5, Number 2 (1999), 175-214. (Contributed by Scott Fenton, 22-Apr-2013.)
(𝑁 ∈ (ℤ‘3) → ∃𝑝𝑥 ∈ (𝔼‘𝑁)∃𝑦 ∈ (𝔼‘𝑁)∃𝑧 ∈ (𝔼‘𝑁)(𝑝:(1...(𝑁 − 1))–1-1→(𝔼‘𝑁) ∧ ∀𝑖 ∈ (2...(𝑁 − 1))(⟨(𝑝‘1), 𝑥⟩Cgr⟨(𝑝𝑖), 𝑥⟩ ∧ ⟨(𝑝‘1), 𝑦⟩Cgr⟨(𝑝𝑖), 𝑦⟩ ∧ ⟨(𝑝‘1), 𝑧⟩Cgr⟨(𝑝𝑖), 𝑧⟩) ∧ ¬ (𝑥 Btwn ⟨𝑦, 𝑧⟩ ∨ 𝑦 Btwn ⟨𝑧, 𝑥⟩ ∨ 𝑧 Btwn ⟨𝑥, 𝑦⟩)))
 
Theoremaxeuclidlem 25887* Lemma for axeuclid 25888. Handle the algebraic aspects of the theorem. (Contributed by Scott Fenton, 9-Sep-2013.)
((((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝑇 ∈ (𝔼‘𝑁))) ∧ (𝑃 ∈ (0[,]1) ∧ 𝑄 ∈ (0[,]1) ∧ 𝑃 ≠ 0) ∧ ∀𝑖 ∈ (1...𝑁)(((1 − 𝑃) · (𝐴𝑖)) + (𝑃 · (𝑇𝑖))) = (((1 − 𝑄) · (𝐵𝑖)) + (𝑄 · (𝐶𝑖)))) → ∃𝑥 ∈ (𝔼‘𝑁)∃𝑦 ∈ (𝔼‘𝑁)∃𝑟 ∈ (0[,]1)∃𝑠 ∈ (0[,]1)∃𝑢 ∈ (0[,]1)∀𝑖 ∈ (1...𝑁)((𝐵𝑖) = (((1 − 𝑟) · (𝐴𝑖)) + (𝑟 · (𝑥𝑖))) ∧ (𝐶𝑖) = (((1 − 𝑠) · (𝐴𝑖)) + (𝑠 · (𝑦𝑖))) ∧ (𝑇𝑖) = (((1 − 𝑢) · (𝑥𝑖)) + (𝑢 · (𝑦𝑖)))))
 
Theoremaxeuclid 25888* Euclid's axiom. Take an angle 𝐵𝐴𝐶 and a point 𝐷 between 𝐵 and 𝐶. Now, if you extend the segment 𝐴𝐷 to a point 𝑇, then 𝑇 lies between two points 𝑥 and 𝑦 that lie on the angle. Axiom A10 of [Schwabhauser] p. 13. (Contributed by Scott Fenton, 9-Sep-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝑇 ∈ (𝔼‘𝑁))) → ((𝐷 Btwn ⟨𝐴, 𝑇⟩ ∧ 𝐷 Btwn ⟨𝐵, 𝐶⟩ ∧ 𝐴𝐷) → ∃𝑥 ∈ (𝔼‘𝑁)∃𝑦 ∈ (𝔼‘𝑁)(𝐵 Btwn ⟨𝐴, 𝑥⟩ ∧ 𝐶 Btwn ⟨𝐴, 𝑦⟩ ∧ 𝑇 Btwn ⟨𝑥, 𝑦⟩)))
 
Theoremaxcontlem1 25889* Lemma for axcont 25901. Change bound variables for later use. (Contributed by Scott Fenton, 20-Jun-2013.)
𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       𝐹 = {⟨𝑦, 𝑠⟩ ∣ (𝑦𝐷 ∧ (𝑠 ∈ (0[,)+∞) ∧ ∀𝑗 ∈ (1...𝑁)(𝑦𝑗) = (((1 − 𝑠) · (𝑍𝑗)) + (𝑠 · (𝑈𝑗)))))}
 
Theoremaxcontlem2 25890* Lemma for axcont 25901. The idea here is to set up a mapping 𝐹 that will allow us to transfer dedekind 10238 to two sets of points. Here, we set up 𝐹 and show its domain and range. (Contributed by Scott Fenton, 17-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       (((𝑁 ∈ ℕ ∧ 𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈 ∈ (𝔼‘𝑁)) ∧ 𝑍𝑈) → 𝐹:𝐷1-1-onto→(0[,)+∞))
 
Theoremaxcontlem3 25891* Lemma for axcont 25901. Given the separation assumption, 𝐵 is a subset of 𝐷. (Contributed by Scott Fenton, 18-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}       (((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ (𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈𝐴𝑍𝑈)) → 𝐵𝐷)
 
Theoremaxcontlem4 25892* Lemma for axcont 25901. Given the separation assumption, 𝐴 is a subset of 𝐷. (Contributed by Scott Fenton, 18-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}       (((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ ((𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈𝐴𝐵 ≠ ∅) ∧ 𝑍𝑈)) → 𝐴𝐷)
 
Theoremaxcontlem5 25893* Lemma for axcont 25901. Compute the value of 𝐹. (Contributed by Scott Fenton, 18-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       ((((𝑁 ∈ ℕ ∧ 𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈 ∈ (𝔼‘𝑁)) ∧ 𝑍𝑈) ∧ 𝑃𝐷) → ((𝐹𝑃) = 𝑇 ↔ (𝑇 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑃𝑖) = (((1 − 𝑇) · (𝑍𝑖)) + (𝑇 · (𝑈𝑖))))))
 
Theoremaxcontlem6 25894* Lemma for axcont 25901. State the defining properties of the value of 𝐹. (Contributed by Scott Fenton, 19-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       ((((𝑁 ∈ ℕ ∧ 𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈 ∈ (𝔼‘𝑁)) ∧ 𝑍𝑈) ∧ 𝑃𝐷) → ((𝐹𝑃) ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑃𝑖) = (((1 − (𝐹𝑃)) · (𝑍𝑖)) + ((𝐹𝑃) · (𝑈𝑖)))))
 
Theoremaxcontlem7 25895* Lemma for axcont 25901. Given two points in 𝐷, one preceeds the other iff its scaling constant is less than the other point's. (Contributed by Scott Fenton, 18-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       ((((𝑁 ∈ ℕ ∧ 𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈 ∈ (𝔼‘𝑁)) ∧ 𝑍𝑈) ∧ (𝑃𝐷𝑄𝐷)) → (𝑃 Btwn ⟨𝑍, 𝑄⟩ ↔ (𝐹𝑃) ≤ (𝐹𝑄)))
 
Theoremaxcontlem8 25896* Lemma for axcont 25901. A point in 𝐷 is between two others if its function value falls in the middle. (Contributed by Scott Fenton, 18-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       ((((𝑁 ∈ ℕ ∧ 𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈 ∈ (𝔼‘𝑁)) ∧ 𝑍𝑈) ∧ (𝑃𝐷𝑄𝐷𝑅𝐷)) → (((𝐹𝑃) ≤ (𝐹𝑄) ∧ (𝐹𝑄) ≤ (𝐹𝑅)) → 𝑄 Btwn ⟨𝑃, 𝑅⟩))
 
Theoremaxcontlem9 25897* Lemma for axcont 25901. Given the separation assumption, all values of 𝐹 over 𝐴 are less than or equal to all values of 𝐹 over 𝐵. (Contributed by Scott Fenton, 20-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       (((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ ((𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈𝐴𝐵 ≠ ∅) ∧ 𝑍𝑈)) → ∀𝑛 ∈ (𝐹𝐴)∀𝑚 ∈ (𝐹𝐵)𝑛𝑚)
 
Theoremaxcontlem10 25898* Lemma for axcont 25901. Given a handful of assumptions, derive the conclusion of the final theorem. (Contributed by Scott Fenton, 20-Jun-2013.)
𝐷 = {𝑝 ∈ (𝔼‘𝑁) ∣ (𝑈 Btwn ⟨𝑍, 𝑝⟩ ∨ 𝑝 Btwn ⟨𝑍, 𝑈⟩)}    &   𝐹 = {⟨𝑥, 𝑡⟩ ∣ (𝑥𝐷 ∧ (𝑡 ∈ (0[,)+∞) ∧ ∀𝑖 ∈ (1...𝑁)(𝑥𝑖) = (((1 − 𝑡) · (𝑍𝑖)) + (𝑡 · (𝑈𝑖)))))}       (((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ ((𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈𝐴𝐵 ≠ ∅) ∧ 𝑍𝑈)) → ∃𝑏 ∈ (𝔼‘𝑁)∀𝑥𝐴𝑦𝐵 𝑏 Btwn ⟨𝑥, 𝑦⟩)
 
Theoremaxcontlem11 25899* Lemma for axcont 25901. Eliminate the hypotheses from axcontlem10 25898. (Contributed by Scott Fenton, 20-Jun-2013.)
(((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ ((𝑍 ∈ (𝔼‘𝑁) ∧ 𝑈𝐴𝐵 ≠ ∅) ∧ 𝑍𝑈)) → ∃𝑏 ∈ (𝔼‘𝑁)∀𝑥𝐴𝑦𝐵 𝑏 Btwn ⟨𝑥, 𝑦⟩)
 
Theoremaxcontlem12 25900* Lemma for axcont 25901. Eliminate the trivial cases from the previous lemmas. (Contributed by Scott Fenton, 20-Jun-2013.)
(((𝑁 ∈ ℕ ∧ (𝐴 ⊆ (𝔼‘𝑁) ∧ 𝐵 ⊆ (𝔼‘𝑁) ∧ ∀𝑥𝐴𝑦𝐵 𝑥 Btwn ⟨𝑍, 𝑦⟩)) ∧ 𝑍 ∈ (𝔼‘𝑁)) → ∃𝑏 ∈ (𝔼‘𝑁)∀𝑥𝐴𝑦𝐵 𝑏 Btwn ⟨𝑥, 𝑦⟩)
    < 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 >