HomeHome Metamath Proof Explorer
Theorem List (p. 336 of 453)
< 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-28699)
  Hilbert Space Explorer  Hilbert Space Explorer
(28700-30222)
  Users' Mathboxes  Users' Mathboxes
(30223-45272)
 

Theorem List for Metamath Proof Explorer - 33501-33600   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremaltopth2 33501 Equality of the second members of equal alternate ordered pairs, which holds regardless of the first members' sethood. (Contributed by Scott Fenton, 22-Mar-2012.)
(𝐵𝑉 → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ → 𝐵 = 𝐷))
 
Theoremaltopthg 33502 Alternate ordered pair theorem. (Contributed by Scott Fenton, 22-Mar-2012.)
((𝐴𝑉𝐵𝑊) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
 
Theoremaltopthbg 33503 Alternate ordered pair theorem. (Contributed by Scott Fenton, 14-Apr-2012.)
((𝐴𝑉𝐷𝑊) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
 
Theoremaltopth 33504 The alternate ordered pair theorem. If two alternate ordered pairs are equal, their first elements are equal and their second elements are equal. Note that 𝐶 and 𝐷 are not required to be a set due to a peculiarity of our specific ordered pair definition, as opposed to the regular ordered pairs used here, which (as in opth 5345), requires 𝐷 to be a set. (Contributed by Scott Fenton, 23-Mar-2012.)
𝐴 ∈ V    &   𝐵 ∈ V       (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremaltopthb 33505 Alternate ordered pair theorem with different sethood requirements. See altopth 33504 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
𝐴 ∈ V    &   𝐷 ∈ V       (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremaltopthc 33506 Alternate ordered pair theorem with different sethood requirements. See altopth 33504 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
𝐵 ∈ V    &   𝐶 ∈ V       (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremaltopthd 33507 Alternate ordered pair theorem with different sethood requirements. See altopth 33504 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
𝐶 ∈ V    &   𝐷 ∈ V       (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremaltxpeq1 33508 Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
(𝐴 = 𝐵 → (𝐴 ×× 𝐶) = (𝐵 ×× 𝐶))
 
Theoremaltxpeq2 33509 Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
(𝐴 = 𝐵 → (𝐶 ×× 𝐴) = (𝐶 ×× 𝐵))
 
Theoremelaltxp 33510* Membership in alternate Cartesian products. (Contributed by Scott Fenton, 23-Mar-2012.)
(𝑋 ∈ (𝐴 ×× 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑋 = ⟪𝑥, 𝑦⟫)
 
Theoremaltopelaltxp 33511 Alternate ordered pair membership in a Cartesian product. Note that, unlike opelxp 5568, there is no sethood requirement here. (Contributed by Scott Fenton, 22-Mar-2012.)
(⟪𝑋, 𝑌⟫ ∈ (𝐴 ×× 𝐵) ↔ (𝑋𝐴𝑌𝐵))
 
Theoremaltxpsspw 33512 An inclusion rule for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
(𝐴 ×× 𝐵) ⊆ 𝒫 𝒫 (𝐴 ∪ 𝒫 𝐵)
 
Theoremaltxpexg 33513 The alternate Cartesian product of two sets is a set. (Contributed by Scott Fenton, 24-Mar-2012.)
((𝐴𝑉𝐵𝑊) → (𝐴 ×× 𝐵) ∈ V)
 
Theoremrankaltopb 33514 Compute the rank of an alternate ordered pair. (Contributed by Scott Fenton, 18-Dec-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝐴 (𝑅1 “ On) ∧ 𝐵 (𝑅1 “ On)) → (rank‘⟪𝐴, 𝐵⟫) = suc suc ((rank‘𝐴) ∪ suc (rank‘𝐵)))
 
Theoremnfaltop 33515 Bound-variable hypothesis builder for alternate ordered pairs. (Contributed by Scott Fenton, 25-Sep-2015.)
𝑥𝐴    &   𝑥𝐵       𝑥𝐴, 𝐵
 
Theoremsbcaltop 33516* Distribution of class substitution over alternate ordered pairs. (Contributed by Scott Fenton, 25-Sep-2015.)
(𝐴 ∈ V → 𝐴 / 𝑥𝐶, 𝐷⟫ = ⟪𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷⟫)
 
20.9.32  Geometry in the Euclidean space
 
20.9.32.1  Congruence properties
 
Syntaxcofs 33517 Declare the syntax for the outer five segment configuration.
class OuterFiveSeg
 
Definitiondf-ofs 33518* The outer five segment configuration is an abbreviation for the conditions of the Five Segment Axiom (ax5seg 26730). See brofs 33540 and 5segofs 33541 for how it is used. Definition 2.10 of [Schwabhauser] p. 28. (Contributed by Scott Fenton, 21-Sep-2013.)
OuterFiveSeg = {⟨𝑝, 𝑞⟩ ∣ ∃𝑛 ∈ ℕ ∃𝑎 ∈ (𝔼‘𝑛)∃𝑏 ∈ (𝔼‘𝑛)∃𝑐 ∈ (𝔼‘𝑛)∃𝑑 ∈ (𝔼‘𝑛)∃𝑥 ∈ (𝔼‘𝑛)∃𝑦 ∈ (𝔼‘𝑛)∃𝑧 ∈ (𝔼‘𝑛)∃𝑤 ∈ (𝔼‘𝑛)(𝑝 = ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∧ 𝑞 = ⟨⟨𝑥, 𝑦⟩, ⟨𝑧, 𝑤⟩⟩ ∧ ((𝑏 Btwn ⟨𝑎, 𝑐⟩ ∧ 𝑦 Btwn ⟨𝑥, 𝑧⟩) ∧ (⟨𝑎, 𝑏⟩Cgr⟨𝑥, 𝑦⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑦, 𝑧⟩) ∧ (⟨𝑎, 𝑑⟩Cgr⟨𝑥, 𝑤⟩ ∧ ⟨𝑏, 𝑑⟩Cgr⟨𝑦, 𝑤⟩)))}
 
Theoremcgrrflx2d 33519 Deduction form of axcgrrflx 26706. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))       (𝜑 → ⟨𝐴, 𝐵⟩Cgr⟨𝐵, 𝐴⟩)
 
Theoremcgrtr4d 33520 Deduction form of axcgrtr 26707. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   (𝜑𝐸 ∈ (𝔼‘𝑁))    &   (𝜑𝐹 ∈ (𝔼‘𝑁))    &   (𝜑 → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)    &   (𝜑 → ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩)       (𝜑 → ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩)
 
Theoremcgrtr4and 33521 Deduction form of axcgrtr 26707. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   (𝜑𝐸 ∈ (𝔼‘𝑁))    &   (𝜑𝐹 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩)       ((𝜑𝜓) → ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩)
 
Theoremcgrrflx 33522 Reflexivity law for congruence. Theorem 2.1 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ⟨𝐴, 𝐵⟩Cgr⟨𝐴, 𝐵⟩)
 
Theoremcgrrflxd 33523 Deduction form of cgrrflx 33522. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))       (𝜑 → ⟨𝐴, 𝐵⟩Cgr⟨𝐴, 𝐵⟩)
 
Theoremcgrcomim 33524 Congruence commutes on the two sides. Implication version. Theorem 2.2 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐷⟩Cgr⟨𝐴, 𝐵⟩))
 
Theoremcgrcom 33525 Congruence commutes between the two sides. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩Cgr⟨𝐴, 𝐵⟩))
 
Theoremcgrcomand 33526 Deduction form of cgrcom 33525. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)       ((𝜑𝜓) → ⟨𝐶, 𝐷⟩Cgr⟨𝐴, 𝐵⟩)
 
Theoremcgrtr 33527 Transitivity law for congruence. Theorem 2.3 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 24-Sep-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → ((⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ∧ ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩) → ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩))
 
Theoremcgrtrand 33528 Deduction form of cgrtr 33527. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   (𝜑𝐸 ∈ (𝔼‘𝑁))    &   (𝜑𝐹 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)    &   ((𝜑𝜓) → ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩)       ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩)
 
Theoremcgrtr3 33529 Transitivity law for congruence. (Contributed by Scott Fenton, 7-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → ((⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩ ∧ ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩))
 
Theoremcgrtr3and 33530 Deduction form of cgrtr3 33529. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   (𝜑𝐸 ∈ (𝔼‘𝑁))    &   (𝜑𝐹 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩)    &   ((𝜑𝜓) → ⟨𝐶, 𝐷⟩Cgr⟨𝐸, 𝐹⟩)       ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)
 
Theoremcgrcoml 33531 Congruence commutes on the left. Biconditional version of Theorem 2.4 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ↔ ⟨𝐵, 𝐴⟩Cgr⟨𝐶, 𝐷⟩))
 
Theoremcgrcomr 33532 Congruence commutes on the right. Biconditional version of Theorem 2.5 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ↔ ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐶⟩))
 
Theoremcgrcomlr 33533 Congruence commutes on both sides. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ ↔ ⟨𝐵, 𝐴⟩Cgr⟨𝐷, 𝐶⟩))
 
Theoremcgrcomland 33534 Deduction form of cgrcoml 33531. (Contributed by Scott Fenton, 14-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)       ((𝜑𝜓) → ⟨𝐵, 𝐴⟩Cgr⟨𝐶, 𝐷⟩)
 
Theoremcgrcomrand 33535 Deduction form of cgrcoml 33531. (Contributed by Scott Fenton, 14-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)       ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐶⟩)
 
Theoremcgrcomlrand 33536 Deduction form of cgrcomlr 33533. (Contributed by Scott Fenton, 14-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩)       ((𝜑𝜓) → ⟨𝐵, 𝐴⟩Cgr⟨𝐷, 𝐶⟩)
 
Theoremcgrtriv 33537 Degenerate segments are congruent. Theorem 2.8 of [Schwabhauser] p. 28. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ⟨𝐴, 𝐴⟩Cgr⟨𝐵, 𝐵⟩)
 
Theoremcgrid2 33538 Identity law for congruence. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐴⟩Cgr⟨𝐵, 𝐶⟩ → 𝐵 = 𝐶))
 
Theoremcgrdegen 33539 Two congruent segments are either both degenerate or both nondegenerate. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → (⟨𝐴, 𝐵⟩Cgr⟨𝐶, 𝐷⟩ → (𝐴 = 𝐵𝐶 = 𝐷)))
 
Theorembrofs 33540 Binary relation form of the outer five segment predicate. (Contributed by Scott Fenton, 21-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → (⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩ OuterFiveSeg ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ ↔ ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐹 Btwn ⟨𝐸, 𝐺⟩) ∧ (⟨𝐴, 𝐵⟩Cgr⟨𝐸, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐹, 𝐺⟩) ∧ (⟨𝐴, 𝐷⟩Cgr⟨𝐸, 𝐻⟩ ∧ ⟨𝐵, 𝐷⟩Cgr⟨𝐹, 𝐻⟩))))
 
Theorem5segofs 33541 Rephrase ax5seg 26730 using the outer five segment predicate. Theorem 2.10 of [Schwabhauser] p. 28. (Contributed by Scott Fenton, 21-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → ((⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩ OuterFiveSeg ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ ∧ 𝐴𝐵) → ⟨𝐶, 𝐷⟩Cgr⟨𝐺, 𝐻⟩))
 
Theoremofscom 33542 The outer five segment predicate commutes. (Contributed by Scott Fenton, 26-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → (⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩ OuterFiveSeg ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ ↔ ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ OuterFiveSeg ⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩))
 
Theoremcgrextend 33543 Link congruence over a pair of line segments. Theorem 2.11 of [Schwabhauser] p. 29. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐸 Btwn ⟨𝐷, 𝐹⟩) ∧ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)) → ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩))
 
Theoremcgrextendand 33544 Deduction form of cgrextend 33543. (Contributed by Scott Fenton, 14-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   (𝜑𝐸 ∈ (𝔼‘𝑁))    &   (𝜑𝐹 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → 𝐵 Btwn ⟨𝐴, 𝐶⟩)    &   ((𝜑𝜓) → 𝐸 Btwn ⟨𝐷, 𝐹⟩)    &   ((𝜑𝜓) → ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩)    &   ((𝜑𝜓) → ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)       ((𝜑𝜓) → ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩)
 
Theoremsegconeq 33545 Two points that satisfy the conclusion of axsegcon 26719 are identical. Uniqueness portion of Theorem 2.12 of [Schwabhauser] p. 29. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝑄 ∈ (𝔼‘𝑁) ∧ 𝑋 ∈ (𝔼‘𝑁) ∧ 𝑌 ∈ (𝔼‘𝑁))) → ((𝑄𝐴 ∧ (𝐴 Btwn ⟨𝑄, 𝑋⟩ ∧ ⟨𝐴, 𝑋⟩Cgr⟨𝐵, 𝐶⟩) ∧ (𝐴 Btwn ⟨𝑄, 𝑌⟩ ∧ ⟨𝐴, 𝑌⟩Cgr⟨𝐵, 𝐶⟩)) → 𝑋 = 𝑌))
 
Theoremsegconeu 33546* Existential uniqueness version of segconeq 33545. (Contributed by Scott Fenton, 19-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)) ∧ 𝐶𝐷)) → ∃!𝑟 ∈ (𝔼‘𝑁)(𝐷 Btwn ⟨𝐶, 𝑟⟩ ∧ ⟨𝐷, 𝑟⟩Cgr⟨𝐴, 𝐵⟩))
 
20.9.32.2  Betweenness properties
 
Theorembtwntriv2 33547 Betweenness always holds for the second endpoint. Theorem 3.1 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐵 Btwn ⟨𝐴, 𝐵⟩)
 
Theorembtwncomim 33548 Betweenness commutes. Implication version. Theorem 3.2 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Btwn ⟨𝐵, 𝐶⟩ → 𝐴 Btwn ⟨𝐶, 𝐵⟩))
 
Theorembtwncom 33549 Betweenness commutes. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Btwn ⟨𝐵, 𝐶⟩ ↔ 𝐴 Btwn ⟨𝐶, 𝐵⟩))
 
Theorembtwncomand 33550 Deduction form of btwncom 33549. (Contributed by Scott Fenton, 14-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → 𝐴 Btwn ⟨𝐵, 𝐶⟩)       ((𝜑𝜓) → 𝐴 Btwn ⟨𝐶, 𝐵⟩)
 
Theorembtwntriv1 33551 Betweenness always holds for the first endpoint. Theorem 3.3 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐴 Btwn ⟨𝐴, 𝐵⟩)
 
Theorembtwnswapid 33552 If you can swap the first two arguments of a betweenness statement, then those arguments are identical. Theorem 3.4 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → ((𝐴 Btwn ⟨𝐵, 𝐶⟩ ∧ 𝐵 Btwn ⟨𝐴, 𝐶⟩) → 𝐴 = 𝐵))
 
Theorembtwnswapid2 33553 If you can swap arguments one and three of a betweenness statement, then those arguments are identical. (Contributed by Scott Fenton, 7-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → ((𝐴 Btwn ⟨𝐵, 𝐶⟩ ∧ 𝐶 Btwn ⟨𝐵, 𝐴⟩) → 𝐴 = 𝐶))
 
Theorembtwnintr 33554 Inner transitivity law for betweenness. Left-hand side of Theorem 3.5 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐷⟩ ∧ 𝐶 Btwn ⟨𝐵, 𝐷⟩) → 𝐵 Btwn ⟨𝐴, 𝐶⟩))
 
Theorembtwnexch3 33555 Exchange the first endpoint in betweenness. Left-hand side of Theorem 3.6 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐶 Btwn ⟨𝐴, 𝐷⟩) → 𝐶 Btwn ⟨𝐵, 𝐷⟩))
 
Theorembtwnexch3and 33556 Deduction form of btwnexch3 33555. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → 𝐵 Btwn ⟨𝐴, 𝐶⟩)    &   ((𝜑𝜓) → 𝐶 Btwn ⟨𝐴, 𝐷⟩)       ((𝜑𝜓) → 𝐶 Btwn ⟨𝐵, 𝐷⟩)
 
Theorembtwnouttr2 33557 Outer transitivity law for betweenness. Left-hand side of Theorem 3.1 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 12-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵𝐶𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐶 Btwn ⟨𝐵, 𝐷⟩) → 𝐶 Btwn ⟨𝐴, 𝐷⟩))
 
Theorembtwnexch2 33558 Exchange the outer point of two betweenness statements. Right-hand side of Theorem 3.5 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 14-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐷⟩ ∧ 𝐶 Btwn ⟨𝐵, 𝐷⟩) → 𝐶 Btwn ⟨𝐴, 𝐷⟩))
 
Theorembtwnouttr 33559 Outer transitivity law for betweenness. Right-hand side of Theorem 3.7 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 14-Jun-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵𝐶𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐶 Btwn ⟨𝐵, 𝐷⟩) → 𝐵 Btwn ⟨𝐴, 𝐷⟩))
 
Theorembtwnexch 33560 Outer transitivity law for betweenness. Right-hand side of Theorem 3.6 of [Schwabhauser] p. 30. (Contributed by Scott Fenton, 24-Sep-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐶 Btwn ⟨𝐴, 𝐷⟩) → 𝐵 Btwn ⟨𝐴, 𝐷⟩))
 
Theorembtwnexchand 33561 Deduction form of btwnexch 33560. (Contributed by Scott Fenton, 13-Oct-2013.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝐴 ∈ (𝔼‘𝑁))    &   (𝜑𝐵 ∈ (𝔼‘𝑁))    &   (𝜑𝐶 ∈ (𝔼‘𝑁))    &   (𝜑𝐷 ∈ (𝔼‘𝑁))    &   ((𝜑𝜓) → 𝐵 Btwn ⟨𝐴, 𝐶⟩)    &   ((𝜑𝜓) → 𝐶 Btwn ⟨𝐴, 𝐷⟩)       ((𝜑𝜓) → 𝐵 Btwn ⟨𝐴, 𝐷⟩)
 
Theorembtwndiff 33562* There is always a 𝑐 distinct from 𝐵 such that 𝐵 lies between 𝐴 and 𝑐. Theorem 3.14 of [Schwabhauser] p. 32. (Contributed by Scott Fenton, 24-Sep-2013.)
((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ∃𝑐 ∈ (𝔼‘𝑁)(𝐵 Btwn ⟨𝐴, 𝑐⟩ ∧ 𝐵𝑐))
 
Theoremtrisegint 33563* A line segment between two sides of a triange intersects a segment crossing from the remaining side to the opposite vertex. Theorem 3.17 of [Schwabhauser] p. 33. (Contributed by Scott Fenton, 24-Sep-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝑃 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐸 Btwn ⟨𝐷, 𝐶⟩ ∧ 𝑃 Btwn ⟨𝐴, 𝐷⟩) → ∃𝑞 ∈ (𝔼‘𝑁)(𝑞 Btwn ⟨𝑃, 𝐶⟩ ∧ 𝑞 Btwn ⟨𝐵, 𝐸⟩)))
 
20.9.32.3  Segment Transportation
 
Syntaxctransport 33564 Declare the syntax for the segment transport function.
class TransportTo
 
Definitiondf-transport 33565* Define the segment transport function. See fvtransport 33567 for an explanation of the function. (Contributed by Scott Fenton, 18-Oct-2013.)
TransportTo = {⟨⟨𝑝, 𝑞⟩, 𝑥⟩ ∣ ∃𝑛 ∈ ℕ ((𝑝 ∈ ((𝔼‘𝑛) × (𝔼‘𝑛)) ∧ 𝑞 ∈ ((𝔼‘𝑛) × (𝔼‘𝑛)) ∧ (1st𝑞) ≠ (2nd𝑞)) ∧ 𝑥 = (𝑟 ∈ (𝔼‘𝑛)((2nd𝑞) Btwn ⟨(1st𝑞), 𝑟⟩ ∧ ⟨(2nd𝑞), 𝑟⟩Cgr𝑝)))}
 
Theoremfuntransport 33566 The TransportTo relationship is a function. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
Fun TransportTo
 
Theoremfvtransport 33567* Calculate the value of the TransportTo function. This function takes four points, 𝐴 through 𝐷, where 𝐶 and 𝐷 are distinct. It then returns the point that extends 𝐶𝐷 by the length of 𝐴𝐵. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)) ∧ 𝐶𝐷)) → (⟨𝐴, 𝐵⟩TransportTo⟨𝐶, 𝐷⟩) = (𝑟 ∈ (𝔼‘𝑁)(𝐷 Btwn ⟨𝐶, 𝑟⟩ ∧ ⟨𝐷, 𝑟⟩Cgr⟨𝐴, 𝐵⟩)))
 
Theoremtransportcl 33568 Closure law for segment transport. (Contributed by Scott Fenton, 19-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)) ∧ 𝐶𝐷)) → (⟨𝐴, 𝐵⟩TransportTo⟨𝐶, 𝐷⟩) ∈ (𝔼‘𝑁))
 
Theoremtransportprops 33569 Calculate the defining properties of the transport function. (Contributed by Scott Fenton, 19-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁)) ∧ 𝐶𝐷)) → (𝐷 Btwn ⟨𝐶, (⟨𝐴, 𝐵⟩TransportTo⟨𝐶, 𝐷⟩)⟩ ∧ ⟨𝐷, (⟨𝐴, 𝐵⟩TransportTo⟨𝐶, 𝐷⟩)⟩Cgr⟨𝐴, 𝐵⟩))
 
20.9.32.4  Properties relating betweenness and congruence
 
Syntaxcifs 33570 Declare the syntax for the inner five segment predicate.
class InnerFiveSeg
 
Syntaxccgr3 33571 Declare the syntax for the three place congruence predicate.
class Cgr3
 
Syntaxccolin 33572 Declare the syntax for the colinearity predicate.
class Colinear
 
Syntaxcfs 33573 Declare the syntax for the five segment predicate.
class FiveSeg
 
Definitiondf-colinear 33574* The colinearity predicate states that the three points in its arguments sit on one line. Definition 4.10 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 25-Oct-2013.)
Colinear = {⟨⟨𝑏, 𝑐⟩, 𝑎⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑐 ∈ (𝔼‘𝑛)) ∧ (𝑎 Btwn ⟨𝑏, 𝑐⟩ ∨ 𝑏 Btwn ⟨𝑐, 𝑎⟩ ∨ 𝑐 Btwn ⟨𝑎, 𝑏⟩))}
 
Definitiondf-ifs 33575* The inner five segment configuration is an abbreviation for another congruence condition. See brifs 33578 and ifscgr 33579 for how it is used. Definition 4.1 of [Schwabhauser] p. 34. (Contributed by Scott Fenton, 26-Sep-2013.)
InnerFiveSeg = {⟨𝑝, 𝑞⟩ ∣ ∃𝑛 ∈ ℕ ∃𝑎 ∈ (𝔼‘𝑛)∃𝑏 ∈ (𝔼‘𝑛)∃𝑐 ∈ (𝔼‘𝑛)∃𝑑 ∈ (𝔼‘𝑛)∃𝑥 ∈ (𝔼‘𝑛)∃𝑦 ∈ (𝔼‘𝑛)∃𝑧 ∈ (𝔼‘𝑛)∃𝑤 ∈ (𝔼‘𝑛)(𝑝 = ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∧ 𝑞 = ⟨⟨𝑥, 𝑦⟩, ⟨𝑧, 𝑤⟩⟩ ∧ ((𝑏 Btwn ⟨𝑎, 𝑐⟩ ∧ 𝑦 Btwn ⟨𝑥, 𝑧⟩) ∧ (⟨𝑎, 𝑐⟩Cgr⟨𝑥, 𝑧⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑦, 𝑧⟩) ∧ (⟨𝑎, 𝑑⟩Cgr⟨𝑥, 𝑤⟩ ∧ ⟨𝑐, 𝑑⟩Cgr⟨𝑧, 𝑤⟩)))}
 
Definitiondf-cgr3 33576* The three place congruence predicate. This is an abbreviation for saying that all three pair in a triple are congruent with each other. Three place form of Definition 4.4 of [Schwabhauser] p. 35. (Contributed by Scott Fenton, 4-Oct-2013.)
Cgr3 = {⟨𝑝, 𝑞⟩ ∣ ∃𝑛 ∈ ℕ ∃𝑎 ∈ (𝔼‘𝑛)∃𝑏 ∈ (𝔼‘𝑛)∃𝑐 ∈ (𝔼‘𝑛)∃𝑑 ∈ (𝔼‘𝑛)∃𝑒 ∈ (𝔼‘𝑛)∃𝑓 ∈ (𝔼‘𝑛)(𝑝 = ⟨𝑎, ⟨𝑏, 𝑐⟩⟩ ∧ 𝑞 = ⟨𝑑, ⟨𝑒, 𝑓⟩⟩ ∧ (⟨𝑎, 𝑏⟩Cgr⟨𝑑, 𝑒⟩ ∧ ⟨𝑎, 𝑐⟩Cgr⟨𝑑, 𝑓⟩ ∧ ⟨𝑏, 𝑐⟩Cgr⟨𝑒, 𝑓⟩))}
 
Definitiondf-fs 33577* The general five segment configuration is a generalization of the outer and inner five segment configurations. See brfs 33614 and fscgr 33615 for its use. Definition 4.15 of [Schwabhauser] p. 37. (Contributed by Scott Fenton, 5-Oct-2013.)
FiveSeg = {⟨𝑝, 𝑞⟩ ∣ ∃𝑛 ∈ ℕ ∃𝑎 ∈ (𝔼‘𝑛)∃𝑏 ∈ (𝔼‘𝑛)∃𝑐 ∈ (𝔼‘𝑛)∃𝑑 ∈ (𝔼‘𝑛)∃𝑥 ∈ (𝔼‘𝑛)∃𝑦 ∈ (𝔼‘𝑛)∃𝑧 ∈ (𝔼‘𝑛)∃𝑤 ∈ (𝔼‘𝑛)(𝑝 = ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∧ 𝑞 = ⟨⟨𝑥, 𝑦⟩, ⟨𝑧, 𝑤⟩⟩ ∧ (𝑎 Colinear ⟨𝑏, 𝑐⟩ ∧ ⟨𝑎, ⟨𝑏, 𝑐⟩⟩Cgr3⟨𝑥, ⟨𝑦, 𝑧⟩⟩ ∧ (⟨𝑎, 𝑑⟩Cgr⟨𝑥, 𝑤⟩ ∧ ⟨𝑏, 𝑑⟩Cgr⟨𝑦, 𝑤⟩)))}
 
Theorembrifs 33578 Binary relation form of the inner five segment predicate. (Contributed by Scott Fenton, 26-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → (⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩ InnerFiveSeg ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ ↔ ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐹 Btwn ⟨𝐸, 𝐺⟩) ∧ (⟨𝐴, 𝐶⟩Cgr⟨𝐸, 𝐺⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐹, 𝐺⟩) ∧ (⟨𝐴, 𝐷⟩Cgr⟨𝐸, 𝐻⟩ ∧ ⟨𝐶, 𝐷⟩Cgr⟨𝐺, 𝐻⟩))))
 
Theoremifscgr 33579 Inner five segment congruence. Take two triangles, 𝐴𝐷𝐶 and 𝐸𝐻𝐺, with 𝐵 between 𝐴 and 𝐶 and 𝐹 between 𝐸 and 𝐺. If the other components of the triangles are congruent, then so are 𝐵𝐷 and 𝐹𝐻. Theorem 4.2 of [Schwabhauser] p. 34. (Contributed by Scott Fenton, 27-Sep-2013.)
(((𝑁 ∈ ℕ ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ (𝐶 ∈ (𝔼‘𝑁) ∧ 𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁)) ∧ (𝐹 ∈ (𝔼‘𝑁) ∧ 𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁))) → (⟨⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩⟩ InnerFiveSeg ⟨⟨𝐸, 𝐹⟩, ⟨𝐺, 𝐻⟩⟩ → ⟨𝐵, 𝐷⟩Cgr⟨𝐹, 𝐻⟩))
 
Theoremcgrsub 33580 Removing identical parts from the end of a line segment preserves congruence. Theorem 4.3 of [Schwabhauser] p. 35. (Contributed by Scott Fenton, 4-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ 𝐸 Btwn ⟨𝐷, 𝐹⟩) ∧ (⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)) → ⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩))
 
Theorembrcgr3 33581 Binary relation form of the three-place congruence predicate. (Contributed by Scott Fenton, 4-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ (⟨𝐴, 𝐵⟩Cgr⟨𝐷, 𝐸⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩ ∧ ⟨𝐵, 𝐶⟩Cgr⟨𝐸, 𝐹⟩)))
 
Theoremcgr3permute3 33582 Permutation law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐵, ⟨𝐶, 𝐴⟩⟩Cgr3⟨𝐸, ⟨𝐹, 𝐷⟩⟩))
 
Theoremcgr3permute1 33583 Permutation law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐴, ⟨𝐶, 𝐵⟩⟩Cgr3⟨𝐷, ⟨𝐹, 𝐸⟩⟩))
 
Theoremcgr3permute2 33584 Permutation law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐵, ⟨𝐴, 𝐶⟩⟩Cgr3⟨𝐸, ⟨𝐷, 𝐹⟩⟩))
 
Theoremcgr3permute4 33585 Permutation law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐶, ⟨𝐴, 𝐵⟩⟩Cgr3⟨𝐹, ⟨𝐷, 𝐸⟩⟩))
 
Theoremcgr3permute5 33586 Permutation law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐶, ⟨𝐵, 𝐴⟩⟩Cgr3⟨𝐹, ⟨𝐸, 𝐷⟩⟩))
 
Theoremcgr3tr4 33587 Transitivity law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁)) ∧ (𝐺 ∈ (𝔼‘𝑁) ∧ 𝐻 ∈ (𝔼‘𝑁) ∧ 𝐼 ∈ (𝔼‘𝑁)))) → ((⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ∧ ⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐺, ⟨𝐻, 𝐼⟩⟩) → ⟨𝐷, ⟨𝐸, 𝐹⟩⟩Cgr3⟨𝐺, ⟨𝐻, 𝐼⟩⟩))
 
Theoremcgr3com 33588 Commutativity law for three-place congruence. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → (⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩ ↔ ⟨𝐷, ⟨𝐸, 𝐹⟩⟩Cgr3⟨𝐴, ⟨𝐵, 𝐶⟩⟩))
 
Theoremcgr3rflx 33589 Identity law for three-place congruence. (Contributed by Scott Fenton, 6-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → ⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐴, ⟨𝐵, 𝐶⟩⟩)
 
Theoremcgrxfr 33590* A line segment can be divided at the same place as a congruent line segment is divided. Theorem 4.5 of [Schwabhauser] p. 35. (Contributed by Scott Fenton, 4-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ ⟨𝐴, 𝐶⟩Cgr⟨𝐷, 𝐹⟩) → ∃𝑒 ∈ (𝔼‘𝑁)(𝑒 Btwn ⟨𝐷, 𝐹⟩ ∧ ⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝑒, 𝐹⟩⟩)))
 
Theorembtwnxfr 33591 A condition for extending betweenness to a new set of points based on congruence with another set of points. Theorem 4.6 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 4-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁)) ∧ (𝐷 ∈ (𝔼‘𝑁) ∧ 𝐸 ∈ (𝔼‘𝑁) ∧ 𝐹 ∈ (𝔼‘𝑁))) → ((𝐵 Btwn ⟨𝐴, 𝐶⟩ ∧ ⟨𝐴, ⟨𝐵, 𝐶⟩⟩Cgr3⟨𝐷, ⟨𝐸, 𝐹⟩⟩) → 𝐸 Btwn ⟨𝐷, 𝐹⟩))
 
Theoremcolinrel 33592 Colinearity is a relationship. (Contributed by Scott Fenton, 7-Nov-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
Rel Colinear
 
Theorembrcolinear2 33593* Alternate colinearity binary relation. (Contributed by Scott Fenton, 7-Nov-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑄𝑉𝑅𝑊) → (𝑃 Colinear ⟨𝑄, 𝑅⟩ ↔ ∃𝑛 ∈ ℕ ((𝑃 ∈ (𝔼‘𝑛) ∧ 𝑄 ∈ (𝔼‘𝑛) ∧ 𝑅 ∈ (𝔼‘𝑛)) ∧ (𝑃 Btwn ⟨𝑄, 𝑅⟩ ∨ 𝑄 Btwn ⟨𝑅, 𝑃⟩ ∨ 𝑅 Btwn ⟨𝑃, 𝑄⟩))))
 
Theorembrcolinear 33594 The binary relation form of the colinearity predicate. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ ↔ (𝐴 Btwn ⟨𝐵, 𝐶⟩ ∨ 𝐵 Btwn ⟨𝐶, 𝐴⟩ ∨ 𝐶 Btwn ⟨𝐴, 𝐵⟩)))
 
Theoremcolinearex 33595 The colinear predicate exists. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
Colinear ∈ V
 
Theoremcolineardim1 33596 If 𝐴 is colinear with 𝐵 and 𝐶, then 𝐴 is in the same space as 𝐵. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
((𝑁 ∈ ℕ ∧ (𝐴𝑉𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶𝑊)) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ → 𝐴 ∈ (𝔼‘𝑁)))
 
Theoremcolinearperm1 33597 Permutation law for colinearity. Part of theorem 4.11 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ ↔ 𝐴 Colinear ⟨𝐶, 𝐵⟩))
 
Theoremcolinearperm3 33598 Permutation law for colinearity. Part of theorem 4.11 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ ↔ 𝐵 Colinear ⟨𝐶, 𝐴⟩))
 
Theoremcolinearperm2 33599 Permutation law for colinearity. Part of theorem 4.11 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ ↔ 𝐵 Colinear ⟨𝐴, 𝐶⟩))
 
Theoremcolinearperm4 33600 Permutation law for colinearity. Part of theorem 4.11 of [Schwabhauser] p. 36. (Contributed by Scott Fenton, 5-Oct-2013.)
((𝑁 ∈ ℕ ∧ (𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁) ∧ 𝐶 ∈ (𝔼‘𝑁))) → (𝐴 Colinear ⟨𝐵, 𝐶⟩ ↔ 𝐶 Colinear ⟨𝐴, 𝐵⟩))
    < 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-42900 430 42901-43000 431 43001-43100 432 43101-43200 433 43201-43300 434 43301-43400 435 43401-43500 436 43501-43600 437 43601-43700 438 43701-43800 439 43801-43900 440 43901-44000 441 44001-44100 442 44101-44200 443 44201-44300 444 44301-44400 445 44401-44500 446 44501-44600 447 44601-44700 448 44701-44800 449 44801-44900 450 44901-45000 451 45001-45100 452 45101-45200 453 45201-45272
  Copyright terms: Public domain < Previous  Next >