HomeHome Intuitionistic Logic Explorer
Theorem List (p. 78 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 - 7701-7800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremaxmulass 7701 Multiplication of complex numbers is associative. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-mulass 7743. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶)))
 
Theoremaxdistr 7702 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-distr 7744 be used later. Instead, use adddi 7772. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))
 
Theoremaxi2m1 7703 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-i2m1 7745. (Contributed by NM, 5-May-1996.) (New usage is discouraged.)
((i · i) + 1) = 0
 
Theoremax0lt1 7704 0 is less than 1. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-0lt1 7746.

The version of this axiom in the Metamath Proof Explorer reads 1 ≠ 0; here we change it to 0 < 1. The proof of 0 < 1 from 1 ≠ 0 in the Metamath Proof Explorer (accessed 12-Jan-2020) relies on real number trichotomy. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)

0 < 1
 
Theoremax1rid 7705 1 is an identity element for real multiplication. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1rid 7747. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.)
(𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴)
 
Theoremax0id 7706 0 is an identity element for real addition. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-0id 7748.

In the Metamath Proof Explorer this is not a complex number axiom but is instead proved from other axioms. That proof relies on excluded middle and it is not known whether it is possible to prove this from the other axioms without excluded middle. (Contributed by Jim Kingdon, 16-Jan-2020.) (New usage is discouraged.)

(𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴)
 
Theoremaxrnegex 7707* Existence of negative of real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-rnegex 7749. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)
(𝐴 ∈ ℝ → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
 
Theoremaxprecex 7708* Existence of positive reciprocal of positive real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-precex 7750.

In treatments which assume excluded middle, the 0 < 𝐴 condition is generally replaced by 𝐴 ≠ 0, and it may not be necessary to state that the reciproacal is positive. (Contributed by Jim Kingdon, 6-Feb-2020.) (New usage is discouraged.)

((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1))
 
Theoremaxcnre 7709* A complex number can be expressed in terms of two reals. Definition 10-1.1(v) of [Gleason] p. 130. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-cnre 7751. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
(𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)))
 
Theoremaxpre-ltirr 7710 Real number less-than is irreflexive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltirr 7752. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
(𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴)
 
Theoremaxpre-ltwlin 7711 Real number less-than is weakly linear. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltwlin 7753. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 < 𝐶𝐶 < 𝐵)))
 
Theoremaxpre-lttrn 7712 Ordering on reals is transitive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttrn 7754. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵𝐵 < 𝐶) → 𝐴 < 𝐶))
 
Theoremaxpre-apti 7713 Apartness of reals is tight. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-apti 7755.

(Contributed by Jim Kingdon, 29-Jan-2020.) (New usage is discouraged.)

((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 < 𝐵𝐵 < 𝐴)) → 𝐴 = 𝐵)
 
Theoremaxpre-ltadd 7714 Ordering property of addition on reals. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltadd 7756. (Contributed by NM, 11-May-1996.) (New usage is discouraged.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵)))
 
Theoremaxpre-mulgt0 7715 The product of two positive reals is positive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 7757. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 · 𝐵)))
 
Theoremaxpre-mulext 7716 Strong extensionality of multiplication (expressed in terms of <). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulext 7758.

(Contributed by Jim Kingdon, 18-Feb-2020.) (New usage is discouraged.)

((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) → (𝐴 < 𝐵𝐵 < 𝐴)))
 
Theoremrereceu 7717* The reciprocal from axprecex 7708 is unique. (Contributed by Jim Kingdon, 15-Jul-2021.)
((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃!𝑥 ∈ ℝ (𝐴 · 𝑥) = 1)
 
Theoremrecriota 7718* Two ways to express the reciprocal of a natural number. (Contributed by Jim Kingdon, 11-Jul-2021.)
(𝑁N → (𝑟 ∈ ℝ (⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ · 𝑟) = 1) = ⟨[⟨(⟨{𝑙𝑙 <Q (*Q‘[⟨𝑁, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑁, 1o⟩] ~Q ) <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
 
Theoremaxarch 7719* Archimedean axiom. The Archimedean property is more naturally stated once we have defined . Unless we find another way to state it, we'll just use the right hand side of dfnn2 8742 in stating what we mean by "natural number" in the context of this axiom.

This construction-dependent theorem should not be referenced directly; instead, use ax-arch 7759. (Contributed by Jim Kingdon, 22-Apr-2020.) (New usage is discouraged.)

(𝐴 ∈ ℝ → ∃𝑛 {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 < 𝑛)
 
Theorempeano5nnnn 7720* Peano's inductive postulate. This is a counterpart to peano5nni 8743 designed for real number axioms which involve natural numbers (notably, axcaucvg 7728). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}       ((1 ∈ 𝐴 ∧ ∀𝑧𝐴 (𝑧 + 1) ∈ 𝐴) → 𝑁𝐴)
 
Theoremnnindnn 7721* Principle of Mathematical Induction (inference schema). This is a counterpart to nnind 8756 designed for real number axioms which involve natural numbers (notably, axcaucvg 7728). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝑧 = 1 → (𝜑𝜓))    &   (𝑧 = 𝑘 → (𝜑𝜒))    &   (𝑧 = (𝑘 + 1) → (𝜑𝜃))    &   (𝑧 = 𝐴 → (𝜑𝜏))    &   𝜓    &   (𝑘𝑁 → (𝜒𝜃))       (𝐴𝑁𝜏)
 
Theoremnntopi 7722* Mapping from to N. (Contributed by Jim Kingdon, 13-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}       (𝐴𝑁 → ∃𝑧N ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑧, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑧, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 𝐴)
 
Theoremaxcaucvglemcl 7723* Lemma for axcaucvg 7728. Mapping to N and R. (Contributed by Jim Kingdon, 10-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)       ((𝜑𝐽N) → (𝑧R (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨𝑧, 0R⟩) ∈ R)
 
Theoremaxcaucvglemf 7724* Lemma for axcaucvg 7728. Mapping to N and R yields a sequence. (Contributed by Jim Kingdon, 9-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))    &   𝐺 = (𝑗N ↦ (𝑧R (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑗, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑗, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨𝑧, 0R⟩))       (𝜑𝐺:NR)
 
Theoremaxcaucvglemval 7725* Lemma for axcaucvg 7728. Value of sequence when mapping to N and R. (Contributed by Jim Kingdon, 10-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))    &   𝐺 = (𝑗N ↦ (𝑧R (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑗, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑗, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨𝑧, 0R⟩))       ((𝜑𝐽N) → (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨(𝐺𝐽), 0R⟩)
 
Theoremaxcaucvglemcau 7726* Lemma for axcaucvg 7728. The result of mapping to N and R satisfies the Cauchy condition. (Contributed by Jim Kingdon, 9-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))    &   𝐺 = (𝑗N ↦ (𝑧R (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑗, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑗, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨𝑧, 0R⟩))       (𝜑 → ∀𝑛N𝑘N (𝑛 <N 𝑘 → ((𝐺𝑛) <R ((𝐺𝑘) +R [⟨(⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ) ∧ (𝐺𝑘) <R ((𝐺𝑛) +R [⟨(⟨{𝑙𝑙 <Q (*Q‘[⟨𝑛, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑛, 1o⟩] ~Q ) <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ))))
 
Theoremaxcaucvglemres 7727* Lemma for axcaucvg 7728. Mapping the limit from N and R. (Contributed by Jim Kingdon, 10-Jul-2021.)
𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))    &   𝐺 = (𝑗N ↦ (𝑧R (𝐹‘⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑗, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑗, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩) = ⟨𝑧, 0R⟩))       (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ (0 < 𝑥 → ∃𝑗𝑁𝑘𝑁 (𝑗 < 𝑘 → ((𝐹𝑘) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹𝑘) + 𝑥)))))
 
Theoremaxcaucvg 7728* Real number completeness axiom. A Cauchy sequence with a modulus of convergence converges. This is basically Corollary 11.2.13 of [HoTT], p. (varies). The HoTT book theorem has a modulus of convergence (that is, a rate of convergence) specified by (11.2.9) in HoTT whereas this theorem fixes the rate of convergence to say that all terms after the nth term must be within 1 / 𝑛 of the nth term (it should later be able to prove versions of this theorem with a different fixed rate or a modulus of convergence supplied as a hypothesis).

Because we are stating this axiom before we have introduced notations for or division, we use 𝑁 for the natural numbers and express a reciprocal in terms of .

This construction-dependent theorem should not be referenced directly; instead, use ax-caucvg 7760. (Contributed by Jim Kingdon, 8-Jul-2021.) (New usage is discouraged.)

𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))       (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ (0 < 𝑥 → ∃𝑗𝑁𝑘𝑁 (𝑗 < 𝑘 → ((𝐹𝑘) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹𝑘) + 𝑥)))))
 
Theoremaxpre-suploclemres 7729* Lemma for axpre-suploc 7730. The result. The proof just needs to define 𝐵 as basically the same set as 𝐴 (but expressed as a subset of R rather than a subset of ), and apply suplocsr 7637. (Contributed by Jim Kingdon, 24-Jan-2024.)
(𝜑𝐴 ⊆ ℝ)    &   (𝜑𝐶𝐴)    &   (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦 < 𝑥)    &   (𝜑 → ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → (∃𝑧𝐴 𝑥 < 𝑧 ∨ ∀𝑧𝐴 𝑧 < 𝑦)))    &   𝐵 = {𝑤R ∣ ⟨𝑤, 0R⟩ ∈ 𝐴}       (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧𝐴 𝑦 < 𝑧)))
 
Theoremaxpre-suploc 7730* An inhabited, bounded-above, located set of reals has a supremum.

Locatedness here means that given 𝑥 < 𝑦, either there is an element of the set greater than 𝑥, or 𝑦 is an upper bound.

This construction-dependent theorem should not be referenced directly; instead, use ax-pre-suploc 7761. (Contributed by Jim Kingdon, 23-Jan-2024.) (New usage is discouraged.)

(((𝐴 ⊆ ℝ ∧ ∃𝑥 𝑥𝐴) ∧ (∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦 < 𝑥 ∧ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → (∃𝑧𝐴 𝑥 < 𝑧 ∨ ∀𝑧𝐴 𝑧 < 𝑦)))) → ∃𝑥 ∈ ℝ (∀𝑦𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧𝐴 𝑦 < 𝑧)))
 
4.1.3  Real and complex number postulates restated as axioms
 
Axiomax-cnex 7731 The complex numbers form a set. Proofs should normally use cnex 7764 instead. (New usage is discouraged.) (Contributed by NM, 1-Mar-1995.)
ℂ ∈ V
 
Axiomax-resscn 7732 The real numbers are a subset of the complex numbers. Axiom for real and complex numbers, justified by theorem axresscn 7688. (Contributed by NM, 1-Mar-1995.)
ℝ ⊆ ℂ
 
Axiomax-1cn 7733 1 is a complex number. Axiom for real and complex numbers, justified by theorem ax1cn 7689. (Contributed by NM, 1-Mar-1995.)
1 ∈ ℂ
 
Axiomax-1re 7734 1 is a real number. Axiom for real and complex numbers, justified by theorem ax1re 7690. Proofs should use 1re 7785 instead. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)
1 ∈ ℝ
 
Axiomax-icn 7735 i is a complex number. Axiom for real and complex numbers, justified by theorem axicn 7691. (Contributed by NM, 1-Mar-1995.)
i ∈ ℂ
 
Axiomax-addcl 7736 Closure law for addition of complex numbers. Axiom for real and complex numbers, justified by theorem axaddcl 7692. Proofs should normally use addcl 7765 instead, which asserts the same thing but follows our naming conventions for closures. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)
 
Axiomax-addrcl 7737 Closure law for addition in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axaddrcl 7693. Proofs should normally use readdcl 7766 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ)
 
Axiomax-mulcl 7738 Closure law for multiplication of complex numbers. Axiom for real and complex numbers, justified by theorem axmulcl 7694. Proofs should normally use mulcl 7767 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)
 
Axiomax-mulrcl 7739 Closure law for multiplication in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axmulrcl 7695. Proofs should normally use remulcl 7768 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ)
 
Axiomax-addcom 7740 Addition commutes. Axiom for real and complex numbers, justified by theorem axaddcom 7698. Proofs should normally use addcom 7919 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 17-Jan-2020.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴))
 
Axiomax-mulcom 7741 Multiplication of complex numbers is commutative. Axiom for real and complex numbers, justified by theorem axmulcom 7699. Proofs should normally use mulcom 7769 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴))
 
Axiomax-addass 7742 Addition of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axaddass 7700. Proofs should normally use addass 7770 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))
 
Axiomax-mulass 7743 Multiplication of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axmulass 7701. Proofs should normally use mulass 7771 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶)))
 
Axiomax-distr 7744 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, justified by theorem axdistr 7702. Proofs should normally use adddi 7772 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))
 
Axiomax-i2m1 7745 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, justified by theorem axi2m1 7703. (Contributed by NM, 29-Jan-1995.)
((i · i) + 1) = 0
 
Axiomax-0lt1 7746 0 is less than 1. Axiom for real and complex numbers, justified by theorem ax0lt1 7704. Proofs should normally use 0lt1 7909 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 12-Jan-2020.)
0 < 1
 
Axiomax-1rid 7747 1 is an identity element for real multiplication. Axiom for real and complex numbers, justified by theorem ax1rid 7705. (Contributed by NM, 29-Jan-1995.)
(𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴)
 
Axiomax-0id 7748 0 is an identity element for real addition. Axiom for real and complex numbers, justified by theorem ax0id 7706.

Proofs should normally use addid1 7920 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 16-Jan-2020.)

(𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴)
 
Axiomax-rnegex 7749* Existence of negative of real number. Axiom for real and complex numbers, justified by theorem axrnegex 7707. (Contributed by Eric Schmidt, 21-May-2007.)
(𝐴 ∈ ℝ → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
 
Axiomax-precex 7750* Existence of reciprocal of positive real number. Axiom for real and complex numbers, justified by theorem axprecex 7708. (Contributed by Jim Kingdon, 6-Feb-2020.)
((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1))
 
Axiomax-cnre 7751* A complex number can be expressed in terms of two reals. Definition 10-1.1(v) of [Gleason] p. 130. Axiom for real and complex numbers, justified by theorem axcnre 7709. For naming consistency, use cnre 7782 for new proofs. (New usage is discouraged.) (Contributed by NM, 9-May-1999.)
(𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)))
 
Axiomax-pre-ltirr 7752 Real number less-than is irreflexive. Axiom for real and complex numbers, justified by theorem ax-pre-ltirr 7752. (Contributed by Jim Kingdon, 12-Jan-2020.)
(𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴)
 
Axiomax-pre-ltwlin 7753 Real number less-than is weakly linear. Axiom for real and complex numbers, justified by theorem axpre-ltwlin 7711. (Contributed by Jim Kingdon, 12-Jan-2020.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐴 < 𝐶𝐶 < 𝐵)))
 
Axiomax-pre-lttrn 7754 Ordering on reals is transitive. Axiom for real and complex numbers, justified by theorem axpre-lttrn 7712. (Contributed by NM, 13-Oct-2005.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵𝐵 < 𝐶) → 𝐴 < 𝐶))
 
Axiomax-pre-apti 7755 Apartness of reals is tight. Axiom for real and complex numbers, justified by theorem axpre-apti 7713. (Contributed by Jim Kingdon, 29-Jan-2020.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ¬ (𝐴 < 𝐵𝐵 < 𝐴)) → 𝐴 = 𝐵)
 
Axiomax-pre-ltadd 7756 Ordering property of addition on reals. Axiom for real and complex numbers, justified by theorem axpre-ltadd 7714. (Contributed by NM, 13-Oct-2005.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵)))
 
Axiomax-pre-mulgt0 7757 The product of two positive reals is positive. Axiom for real and complex numbers, justified by theorem axpre-mulgt0 7715. (Contributed by NM, 13-Oct-2005.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 · 𝐵)))
 
Axiomax-pre-mulext 7758 Strong extensionality of multiplication (expressed in terms of <). Axiom for real and complex numbers, justified by theorem axpre-mulext 7716

(Contributed by Jim Kingdon, 18-Feb-2020.)

((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) → (𝐴 < 𝐵𝐵 < 𝐴)))
 
Axiomax-arch 7759* Archimedean axiom. Definition 3.1(2) of [Geuvers], p. 9. Axiom for real and complex numbers, justified by theorem axarch 7719.

This axiom should not be used directly; instead use arch 8994 (which is the same, but stated in terms of and <). (Contributed by Jim Kingdon, 2-May-2020.) (New usage is discouraged.)

(𝐴 ∈ ℝ → ∃𝑛 {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 < 𝑛)
 
Axiomax-caucvg 7760* Completeness. Axiom for real and complex numbers, justified by theorem axcaucvg 7728.

A Cauchy sequence (as defined here, which has a rate convergence built in) of real numbers converges to a real number. Specifically on rate of convergence, all terms after the nth term must be within 1 / 𝑛 of the nth term.

This axiom should not be used directly; instead use caucvgre 10781 (which is the same, but stated in terms of the and 1 / 𝑛 notations). (Contributed by Jim Kingdon, 19-Jul-2021.) (New usage is discouraged.)

𝑁 = {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦𝑥 (𝑦 + 1) ∈ 𝑥)}    &   (𝜑𝐹:𝑁⟶ℝ)    &   (𝜑 → ∀𝑛𝑁𝑘𝑁 (𝑛 < 𝑘 → ((𝐹𝑛) < ((𝐹𝑘) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)) ∧ (𝐹𝑘) < ((𝐹𝑛) + (𝑟 ∈ ℝ (𝑛 · 𝑟) = 1)))))       (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ ℝ (0 < 𝑥 → ∃𝑗𝑁𝑘𝑁 (𝑗 < 𝑘 → ((𝐹𝑘) < (𝑦 + 𝑥) ∧ 𝑦 < ((𝐹𝑘) + 𝑥)))))
 
Axiomax-pre-suploc 7761* An inhabited, bounded-above, located set of reals has a supremum.

Locatedness here means that given 𝑥 < 𝑦, either there is an element of the set greater than 𝑥, or 𝑦 is an upper bound.

Although this and ax-caucvg 7760 are both completeness properties, countable choice would probably be needed to derive this from ax-caucvg 7760.

(Contributed by Jim Kingdon, 23-Jan-2024.)

(((𝐴 ⊆ ℝ ∧ ∃𝑥 𝑥𝐴) ∧ (∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦 < 𝑥 ∧ ∀𝑥 ∈ ℝ ∀𝑦 ∈ ℝ (𝑥 < 𝑦 → (∃𝑧𝐴 𝑥 < 𝑧 ∨ ∀𝑧𝐴 𝑧 < 𝑦)))) → ∃𝑥 ∈ ℝ (∀𝑦𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧𝐴 𝑦 < 𝑧)))
 
Axiomax-addf 7762 Addition is an operation on the complex numbers. This deprecated axiom is provided for historical compatibility but is not a bona fide axiom for complex numbers (independent of set theory) since it cannot be interpreted as a first- or second-order statement (see https://us.metamath.org/downloads/schmidt-cnaxioms.pdf). It may be deleted in the future and should be avoided for new theorems. Instead, the less specific addcl 7765 should be used. Note that uses of ax-addf 7762 can be eliminated by using the defined operation (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) in place of +, from which this axiom (with the defined operation in place of +) follows as a theorem.

This axiom is justified by theorem axaddf 7696. (New usage is discouraged.) (Contributed by NM, 19-Oct-2004.)

+ :(ℂ × ℂ)⟶ℂ
 
Axiomax-mulf 7763 Multiplication is an operation on the complex numbers. This deprecated axiom is provided for historical compatibility but is not a bona fide axiom for complex numbers (independent of set theory) since it cannot be interpreted as a first- or second-order statement (see https://us.metamath.org/downloads/schmidt-cnaxioms.pdf). It may be deleted in the future and should be avoided for new theorems. Instead, the less specific ax-mulcl 7738 should be used. Note that uses of ax-mulf 7763 can be eliminated by using the defined operation (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) in place of ·, from which this axiom (with the defined operation in place of ·) follows as a theorem.

This axiom is justified by theorem axmulf 7697. (New usage is discouraged.) (Contributed by NM, 19-Oct-2004.)

· :(ℂ × ℂ)⟶ℂ
 
4.2  Derive the basic properties from the field axioms
 
4.2.1  Some deductions from the field axioms for complex numbers
 
Theoremcnex 7764 Alias for ax-cnex 7731. (Contributed by Mario Carneiro, 17-Nov-2014.)
ℂ ∈ V
 
Theoremaddcl 7765 Alias for ax-addcl 7736, for naming consistency with addcli 7790. Use this theorem instead of ax-addcl 7736 or axaddcl 7692. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)
 
Theoremreaddcl 7766 Alias for ax-addrcl 7737, for naming consistency with readdcli 7799. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ)
 
Theoremmulcl 7767 Alias for ax-mulcl 7738, for naming consistency with mulcli 7791. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)
 
Theoremremulcl 7768 Alias for ax-mulrcl 7739, for naming consistency with remulcli 7800. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ)
 
Theoremmulcom 7769 Alias for ax-mulcom 7741, for naming consistency with mulcomi 7792. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴))
 
Theoremaddass 7770 Alias for ax-addass 7742, for naming consistency with addassi 7794. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶)))
 
Theoremmulass 7771 Alias for ax-mulass 7743, for naming consistency with mulassi 7795. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶)))
 
Theoremadddi 7772 Alias for ax-distr 7744, for naming consistency with adddii 7796. (Contributed by NM, 10-Mar-2008.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶)))
 
Theoremrecn 7773 A real number is a complex number. (Contributed by NM, 10-Aug-1999.)
(𝐴 ∈ ℝ → 𝐴 ∈ ℂ)
 
Theoremreex 7774 The real numbers form a set. (Contributed by Mario Carneiro, 17-Nov-2014.)
ℝ ∈ V
 
Theoremreelprrecn 7775 Reals are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
ℝ ∈ {ℝ, ℂ}
 
Theoremcnelprrecn 7776 Complex numbers are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
ℂ ∈ {ℝ, ℂ}
 
Theoremadddir 7777 Distributive law for complex numbers (right-distributivity). (Contributed by NM, 10-Oct-2004.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 + 𝐵) · 𝐶) = ((𝐴 · 𝐶) + (𝐵 · 𝐶)))
 
Theorem0cn 7778 0 is a complex number. (Contributed by NM, 19-Feb-2005.)
0 ∈ ℂ
 
Theorem0cnd 7779 0 is a complex number, deductive form. (Contributed by David A. Wheeler, 8-Dec-2018.)
(𝜑 → 0 ∈ ℂ)
 
Theoremc0ex 7780 0 is a set (common case). (Contributed by David A. Wheeler, 7-Jul-2016.)
0 ∈ V
 
Theorem1ex 7781 1 is a set. Common special case. (Contributed by David A. Wheeler, 7-Jul-2016.)
1 ∈ V
 
Theoremcnre 7782* Alias for ax-cnre 7751, for naming consistency. (Contributed by NM, 3-Jan-2013.)
(𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)))
 
Theoremmulid1 7783 1 is an identity element for multiplication. Based on ideas by Eric Schmidt. (Contributed by Scott Fenton, 3-Jan-2013.)
(𝐴 ∈ ℂ → (𝐴 · 1) = 𝐴)
 
Theoremmulid2 7784 Identity law for multiplication. Note: see mulid1 7783 for commuted version. (Contributed by NM, 8-Oct-1999.)
(𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴)
 
Theorem1re 7785 1 is a real number. (Contributed by Jim Kingdon, 13-Jan-2020.)
1 ∈ ℝ
 
Theorem0re 7786 0 is a real number. (Contributed by Eric Schmidt, 21-May-2007.) (Revised by Scott Fenton, 3-Jan-2013.)
0 ∈ ℝ
 
Theorem0red 7787 0 is a real number, deductive form. (Contributed by David A. Wheeler, 6-Dec-2018.)
(𝜑 → 0 ∈ ℝ)
 
Theoremmulid1i 7788 Identity law for multiplication. (Contributed by NM, 14-Feb-1995.)
𝐴 ∈ ℂ       (𝐴 · 1) = 𝐴
 
Theoremmulid2i 7789 Identity law for multiplication. (Contributed by NM, 14-Feb-1995.)
𝐴 ∈ ℂ       (1 · 𝐴) = 𝐴
 
Theoremaddcli 7790 Closure law for addition. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ       (𝐴 + 𝐵) ∈ ℂ
 
Theoremmulcli 7791 Closure law for multiplication. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ       (𝐴 · 𝐵) ∈ ℂ
 
Theoremmulcomi 7792 Commutative law for multiplication. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ       (𝐴 · 𝐵) = (𝐵 · 𝐴)
 
Theoremmulcomli 7793 Commutative law for multiplication. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   (𝐴 · 𝐵) = 𝐶       (𝐵 · 𝐴) = 𝐶
 
Theoremaddassi 7794 Associative law for addition. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       ((𝐴 + 𝐵) + 𝐶) = (𝐴 + (𝐵 + 𝐶))
 
Theoremmulassi 7795 Associative law for multiplication. (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))
 
Theoremadddii 7796 Distributive law (left-distributivity). (Contributed by NM, 23-Nov-1994.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       (𝐴 · (𝐵 + 𝐶)) = ((𝐴 · 𝐵) + (𝐴 · 𝐶))
 
Theoremadddiri 7797 Distributive law (right-distributivity). (Contributed by NM, 16-Feb-1995.)
𝐴 ∈ ℂ    &   𝐵 ∈ ℂ    &   𝐶 ∈ ℂ       ((𝐴 + 𝐵) · 𝐶) = ((𝐴 · 𝐶) + (𝐵 · 𝐶))
 
Theoremrecni 7798 A real number is a complex number. (Contributed by NM, 1-Mar-1995.)
𝐴 ∈ ℝ       𝐴 ∈ ℂ
 
Theoremreaddcli 7799 Closure law for addition of reals. (Contributed by NM, 17-Jan-1997.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴 + 𝐵) ∈ ℝ
 
Theoremremulcli 7800 Closure law for multiplication of reals. (Contributed by NM, 17-Jan-1997.)
𝐴 ∈ ℝ    &   𝐵 ∈ ℝ       (𝐴 · 𝐵) ∈ ℝ
    < 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-13424
  Copyright terms: Public domain < Previous  Next >