HomeHome Intuitionistic Logic Explorer
Theorem List (p. 68 of 95)
< 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 - 6701-6800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Definitiondf-r 6701 Define the set of real numbers. (Contributed by NM, 22-Feb-1996.)
ℝ = (R × {0R})
 
Definitiondf-add 6702* Define addition over complex numbers. (Contributed by NM, 28-May-1995.)
+ = {⟨⟨x, y⟩, z⟩ ∣ ((x y ℂ) wvuf((x = ⟨w, v y = ⟨u, f⟩) z = ⟨(w +R u), (v +R f)⟩))}
 
Definitiondf-mul 6703* Define multiplication over complex numbers. (Contributed by NM, 9-Aug-1995.)
· = {⟨⟨x, y⟩, z⟩ ∣ ((x y ℂ) wvuf((x = ⟨w, v y = ⟨u, f⟩) z = ⟨((w ·R u) +R (-1R ·R (v ·R f))), ((v ·R u) +R (w ·R f))⟩))}
 
Definitiondf-lt 6704* Define 'less than' on the real subset of complex numbers. (Contributed by NM, 22-Feb-1996.)
< = {⟨x, y⟩ ∣ ((x y ℝ) zw((x = ⟨z, 0R y = ⟨w, 0R⟩) z <R w))}
 
Theoremopelcn 6705 Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.)
(⟨A, B ℂ ↔ (A R B R))
 
Theoremopelreal 6706 Ordered pair membership in class of real subset of complex numbers. (Contributed by NM, 22-Feb-1996.)
(⟨A, 0R ℝ ↔ A R)
 
Theoremelreal 6707* Membership in class of real numbers. (Contributed by NM, 31-Mar-1996.)
(A ℝ ↔ x Rx, 0R⟩ = A)
 
Theoremelreal2 6708 Ordered pair membership in the class of complex numbers. (Contributed by Mario Carneiro, 15-Jun-2013.)
(A ℝ ↔ ((1stA) R A = ⟨(1stA), 0R⟩))
 
Theorem0ncn 6709 The empty set is not a complex number. Note: do not use this after the real number axioms are developed, since it is a construction-dependent property. (Contributed by NM, 2-May-1996.)
¬ ∅
 
Theoremltrelre 6710 'Less than' is a relation on real numbers. (Contributed by NM, 22-Feb-1996.)
< ⊆ (ℝ × ℝ)
 
Theoremaddcnsr 6711 Addition of complex numbers in terms of signed reals. (Contributed by NM, 28-May-1995.)
(((A R B R) (𝐶 R 𝐷 R)) → (⟨A, B⟩ + ⟨𝐶, 𝐷⟩) = ⟨(A +R 𝐶), (B +R 𝐷)⟩)
 
Theoremmulcnsr 6712 Multiplication of complex numbers in terms of signed reals. (Contributed by NM, 9-Aug-1995.)
(((A R B R) (𝐶 R 𝐷 R)) → (⟨A, B⟩ · ⟨𝐶, 𝐷⟩) = ⟨((A ·R 𝐶) +R (-1R ·R (B ·R 𝐷))), ((B ·R 𝐶) +R (A ·R 𝐷))⟩)
 
Theoremeqresr 6713 Equality of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
A V       (⟨A, 0R⟩ = ⟨B, 0R⟩ ↔ A = B)
 
Theoremaddresr 6714 Addition of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
((A R B R) → (⟨A, 0R⟩ + ⟨B, 0R⟩) = ⟨(A +R B), 0R⟩)
 
Theoremmulresr 6715 Multiplication of real numbers in terms of intermediate signed reals. (Contributed by NM, 10-May-1996.)
((A R B R) → (⟨A, 0R⟩ · ⟨B, 0R⟩) = ⟨(A ·R B), 0R⟩)
 
Theoremltresr 6716 Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.)
(⟨A, 0R⟩ <B, 0R⟩ ↔ A <R B)
 
Theoremltresr2 6717 Ordering of real subset of complex numbers in terms of signed reals. (Contributed by NM, 22-Feb-1996.)
((A B ℝ) → (A < B ↔ (1stA) <R (1stB)))
 
Theoremdfcnqs 6718 Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in from those in R. The trick involves qsid 6107, which shows that the coset of the converse epsilon relation (which is not an equivalence relation) acts as an identity divisor for the quotient set operation. This lets us "pretend" that is a quotient set, even though it is not (compare df-c 6697), and allows us to reuse some of the equivalence class lemmas we developed for the transition from positive reals to signed reals, etc. (Contributed by NM, 13-Aug-1995.)
ℂ = ((R × R) / E )
 
Theoremaddcnsrec 6719 Technical trick to permit re-use of some equivalence class lemmas for operation laws. See dfcnqs 6718 and mulcnsrec 6720. (Contributed by NM, 13-Aug-1995.)
(((A R B R) (𝐶 R 𝐷 R)) → ([⟨A, B⟩] E + [⟨𝐶, 𝐷⟩] E ) = [⟨(A +R 𝐶), (B +R 𝐷)⟩] E )
 
Theoremmulcnsrec 6720 Technical trick to permit re-use of some equivalence class lemmas for operation laws. The trick involves ecidg 6106, which shows that the coset of the converse epsilon relation (which is not an equivalence relation) leaves a set unchanged. See also dfcnqs 6718. (Contributed by NM, 13-Aug-1995.)
(((A R B R) (𝐶 R 𝐷 R)) → ([⟨A, B⟩] E · [⟨𝐶, 𝐷⟩] E ) = [⟨((A ·R 𝐶) +R (-1R ·R (B ·R 𝐷))), ((B ·R 𝐶) +R (A ·R 𝐷))⟩] E )
 
Theorempitonnlem1 6721* Lemma for pitonn 6724. Two ways to write the number one. (Contributed by Jim Kingdon, 24-Apr-2020.)
⟨[⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {u ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q u}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
 
Theorempitonnlem1p1 6722 Lemma for pitonn 6724. Simplifying an expression involving signed reals. (Contributed by Jim Kingdon, 26-Apr-2020.)
(A P → [⟨(A +P (1P +P 1P)), (1P +P 1P)⟩] ~R = [⟨(A +P 1P), 1P⟩] ~R )
 
Theorempitonnlem2 6723* Lemma for pitonn 6724. Two ways to add one to a number. (Contributed by Jim Kingdon, 24-Apr-2020.)
(𝐾 N → (⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐾, 1𝑜⟩] ~Q }, {u ∣ [⟨𝐾, 1𝑜⟩] ~Q <Q u}⟩ +P 1P), 1P⟩] ~R , 0R⟩ + 1) = ⟨[⟨(⟨{𝑙𝑙 <Q [⟨(𝐾 +N 1𝑜), 1𝑜⟩] ~Q }, {u ∣ [⟨(𝐾 +N 1𝑜), 1𝑜⟩] ~Q <Q u}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
 
Theorempitonn 6724* Mapping from N to . (Contributed by Jim Kingdon, 22-Apr-2020.)
(𝑛 N → ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑛, 1𝑜⟩] ~Q }, {u ∣ [⟨𝑛, 1𝑜⟩] ~Q <Q u}⟩ +P 1P), 1P⟩] ~R , 0R {x ∣ (1 x y x (y + 1) x)})
 
3.1.2  Final derivation of real and complex number postulates
 
Theoremaxcnex 6725 The complex numbers form a set. Use cnex 6783 instead. (Contributed by Mario Carneiro, 17-Nov-2014.) (New usage is discouraged.)
V
 
Theoremaxresscn 6726 The real numbers are a subset of the complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-resscn 6755. (Contributed by NM, 1-Mar-1995.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (New usage is discouraged.)
ℝ ⊆ ℂ
 
Theoremax1cn 6727 1 is a complex number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1cn 6756. (Contributed by NM, 12-Apr-2007.) (New usage is discouraged.)
1
 
Theoremax1re 6728 1 is a real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-1re 6757.

In the Metamath Proof Explorer, this is not a complex number axiom but is proved from ax-1cn 6756 and the other axioms. It is not known whether we can do so here, but the Metamath Proof Explorer proof (accessed 13-Jan-2020) uses excluded middle. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)

1
 
Theoremaxicn 6729 i is a complex number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-icn 6758. (Contributed by NM, 23-Feb-1996.) (New usage is discouraged.)
i
 
Theoremaxaddcl 6730 Closure law for addition of complex numbers. 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-addcl 6759 be used later. Instead, in most cases use addcl 6784. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.)
((A B ℂ) → (A + B) ℂ)
 
Theoremaxaddrcl 6731 Closure law for addition in the real subfield of complex numbers. 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-addrcl 6760 be used later. Instead, in most cases use readdcl 6785. (Contributed by NM, 31-Mar-1996.) (New usage is discouraged.)
((A B ℝ) → (A + B) ℝ)
 
Theoremaxmulcl 6732 Closure law for multiplication of complex numbers. 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-mulcl 6761 be used later. Instead, in most cases use mulcl 6786. (Contributed by NM, 10-Aug-1995.) (New usage is discouraged.)
((A B ℂ) → (A · B) ℂ)
 
Theoremaxmulrcl 6733 Closure law for multiplication in the real subfield of complex numbers. 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-mulrcl 6762 be used later. Instead, in most cases use remulcl 6787. (New usage is discouraged.) (Contributed by NM, 31-Mar-1996.)
((A B ℝ) → (A · B) ℝ)
 
Theoremaxaddcom 6734 Addition commutes. 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-addcom 6763 be used later. Instead, use addcom 6927.

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

((A B ℂ) → (A + B) = (B + A))
 
Theoremaxmulcom 6735 Multiplication of complex numbers is commutative. 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-mulcom 6764 be used later. Instead, use mulcom 6788. (Contributed by NM, 31-Aug-1995.) (New usage is discouraged.)
((A B ℂ) → (A · B) = (B · A))
 
Theoremaxaddass 6736 Addition of complex numbers is associative. This theorem transfers the associative laws for the real and imaginary signed real components of complex number pairs, to complex number addition itself. 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-addass 6765 be used later. Instead, use addass 6789. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
((A B 𝐶 ℂ) → ((A + B) + 𝐶) = (A + (B + 𝐶)))
 
Theoremaxmulass 6737 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 6766. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)
((A B 𝐶 ℂ) → ((A · B) · 𝐶) = (A · (B · 𝐶)))
 
Theoremaxdistr 6738 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 6767 be used later. Instead, use adddi 6791. (Contributed by NM, 2-Sep-1995.) (New usage is discouraged.)
((A B 𝐶 ℂ) → (A · (B + 𝐶)) = ((A · B) + (A · 𝐶)))
 
Theoremaxi2m1 6739 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 6768. (Contributed by NM, 5-May-1996.) (New usage is discouraged.)
((i · i) + 1) = 0
 
Theoremax0lt1 6740 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 6769.

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 6741 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 6770. (Contributed by Scott Fenton, 3-Jan-2013.) (New usage is discouraged.)
(A ℝ → (A · 1) = A)
 
Theoremax0id 6742 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 6771.

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.)

(A ℂ → (A + 0) = A)
 
Theoremaxrnegex 6743* 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 6772. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)
(A ℝ → x ℝ (A + x) = 0)
 
Theoremaxprecex 6744* 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 6773.

In treatments which assume excluded middle, the 0 < A condition is generally replaced by A ≠ 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.)

((A 0 < A) → x ℝ (0 < x (A · x) = 1))
 
Theoremaxcnre 6745* 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 6774. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
(A ℂ → x y A = (x + (i · y)))
 
Theoremaxpre-ltirr 6746 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 6775. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
(A ℝ → ¬ A < A)
 
Theoremaxpre-ltwlin 6747 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 6776. (Contributed by Jim Kingdon, 12-Jan-2020.) (New usage is discouraged.)
((A B 𝐶 ℝ) → (A < B → (A < 𝐶 𝐶 < B)))
 
Theoremaxpre-lttrn 6748 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 6777. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.)
((A B 𝐶 ℝ) → ((A < B B < 𝐶) → A < 𝐶))
 
Theoremaxpre-apti 6749 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 6778.

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

((A B ¬ (A < B B < A)) → A = B)
 
Theoremaxpre-ltadd 6750 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 6779. (Contributed by NM, 11-May-1996.) (New usage is discouraged.)
((A B 𝐶 ℝ) → (A < B → (𝐶 + A) < (𝐶 + B)))
 
Theoremaxpre-mulgt0 6751 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 6780. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
((A B ℝ) → ((0 < A 0 < B) → 0 < (A · B)))
 
Theoremaxpre-mulext 6752 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 6781.

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

((A B 𝐶 ℝ) → ((A · 𝐶) < (B · 𝐶) → (A < B B < A)))
 
Theoremaxarch 6753* 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 7677 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 6782. (Contributed by Jim Kingdon, 22-Apr-2020.) (New usage is discouraged.)

(A ℝ → 𝑛 {x ∣ (1 x y x (y + 1) x)}A < 𝑛)
 
3.1.3  Real and complex number postulates restated as axioms
 
Axiomax-cnex 6754 The complex numbers form a set. Proofs should normally use cnex 6783 instead. (New usage is discouraged.) (Contributed by NM, 1-Mar-1995.)
V
 
Axiomax-resscn 6755 The real numbers are a subset of the complex numbers. Axiom for real and complex numbers, justified by theorem axresscn 6726. (Contributed by NM, 1-Mar-1995.)
ℝ ⊆ ℂ
 
Axiomax-1cn 6756 1 is a complex number. Axiom for real and complex numbers, justified by theorem ax1cn 6727. (Contributed by NM, 1-Mar-1995.)
1
 
Axiomax-1re 6757 1 is a real number. Axiom for real and complex numbers, justified by theorem ax1re 6728. Proofs should use 1re 6804 instead. (Contributed by Jim Kingdon, 13-Jan-2020.) (New usage is discouraged.)
1
 
Axiomax-icn 6758 i is a complex number. Axiom for real and complex numbers, justified by theorem axicn 6729. (Contributed by NM, 1-Mar-1995.)
i
 
Axiomax-addcl 6759 Closure law for addition of complex numbers. Axiom for real and complex numbers, justified by theorem axaddcl 6730. Proofs should normally use addcl 6784 instead, which asserts the same thing but follows our naming conventions for closures. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B ℂ) → (A + B) ℂ)
 
Axiomax-addrcl 6760 Closure law for addition in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axaddrcl 6731. Proofs should normally use readdcl 6785 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B ℝ) → (A + B) ℝ)
 
Axiomax-mulcl 6761 Closure law for multiplication of complex numbers. Axiom for real and complex numbers, justified by theorem axmulcl 6732. Proofs should normally use mulcl 6786 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B ℂ) → (A · B) ℂ)
 
Axiomax-mulrcl 6762 Closure law for multiplication in the real subfield of complex numbers. Axiom for real and complex numbers, justified by theorem axmulrcl 6733. Proofs should normally use remulcl 6787 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B ℝ) → (A · B) ℝ)
 
Axiomax-addcom 6763 Addition commutes. Axiom for real and complex numbers, justified by theorem axaddcom 6734. Proofs should normally use addcom 6927 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 17-Jan-2020.)
((A B ℂ) → (A + B) = (B + A))
 
Axiomax-mulcom 6764 Multiplication of complex numbers is commutative. Axiom for real and complex numbers, justified by theorem axmulcom 6735. Proofs should normally use mulcom 6788 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B ℂ) → (A · B) = (B · A))
 
Axiomax-addass 6765 Addition of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axaddass 6736. Proofs should normally use addass 6789 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B 𝐶 ℂ) → ((A + B) + 𝐶) = (A + (B + 𝐶)))
 
Axiomax-mulass 6766 Multiplication of complex numbers is associative. Axiom for real and complex numbers, justified by theorem axmulass 6737. Proofs should normally use mulass 6790 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B 𝐶 ℂ) → ((A · B) · 𝐶) = (A · (B · 𝐶)))
 
Axiomax-distr 6767 Distributive law for complex numbers (left-distributivity). Axiom for real and complex numbers, justified by theorem axdistr 6738. Proofs should normally use adddi 6791 instead. (New usage is discouraged.) (Contributed by NM, 22-Nov-1994.)
((A B 𝐶 ℂ) → (A · (B + 𝐶)) = ((A · B) + (A · 𝐶)))
 
Axiomax-i2m1 6768 i-squared equals -1 (expressed as i-squared plus 1 is 0). Axiom for real and complex numbers, justified by theorem axi2m1 6739. (Contributed by NM, 29-Jan-1995.)
((i · i) + 1) = 0
 
Theoremax-0lt1 6769 0 is less than 1. Axiom for real and complex numbers, justified by theorem ax0lt1 6740. Proofs should normally use 0lt1 6918 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 12-Jan-2020.)
0 < 1
 
Axiomax-1rid 6770 1 is an identity element for real multiplication. Axiom for real and complex numbers, justified by theorem ax1rid 6741. (Contributed by NM, 29-Jan-1995.)
(A ℝ → (A · 1) = A)
 
Axiomax-0id 6771 0 is an identity element for real addition. Axiom for real and complex numbers, justified by theorem ax0id 6742.

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

(A ℂ → (A + 0) = A)
 
Axiomax-rnegex 6772* Existence of negative of real number. Axiom for real and complex numbers, justified by theorem axrnegex 6743. (Contributed by Eric Schmidt, 21-May-2007.)
(A ℝ → x ℝ (A + x) = 0)
 
Axiomax-precex 6773* Existence of reciprocal of positive real number. Axiom for real and complex numbers, justified by theorem axprecex 6744. (Contributed by Jim Kingdon, 6-Feb-2020.)
((A 0 < A) → x ℝ (0 < x (A · x) = 1))
 
Axiomax-cnre 6774* 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 6745. For naming consistency, use cnre 6801 for new proofs. (New usage is discouraged.) (Contributed by NM, 9-May-1999.)
(A ℂ → x y A = (x + (i · y)))
 
Axiomax-pre-ltirr 6775 Real number less-than is irreflexive. Axiom for real and complex numbers, justified by theorem ax-pre-ltirr 6775. (Contributed by Jim Kingdon, 12-Jan-2020.)
(A ℝ → ¬ A < A)
 
Axiomax-pre-ltwlin 6776 Real number less-than is weakly linear. Axiom for real and complex numbers, justified by theorem axpre-ltwlin 6747. (Contributed by Jim Kingdon, 12-Jan-2020.)
((A B 𝐶 ℝ) → (A < B → (A < 𝐶 𝐶 < B)))
 
Axiomax-pre-lttrn 6777 Ordering on reals is transitive. Axiom for real and complex numbers, justified by theorem axpre-lttrn 6748. (Contributed by NM, 13-Oct-2005.)
((A B 𝐶 ℝ) → ((A < B B < 𝐶) → A < 𝐶))
 
Axiomax-pre-apti 6778 Apartness of reals is tight. Axiom for real and complex numbers, justified by theorem axpre-apti 6749. (Contributed by Jim Kingdon, 29-Jan-2020.)
((A B ¬ (A < B B < A)) → A = B)
 
Axiomax-pre-ltadd 6779 Ordering property of addition on reals. Axiom for real and complex numbers, justified by theorem axpre-ltadd 6750. (Contributed by NM, 13-Oct-2005.)
((A B 𝐶 ℝ) → (A < B → (𝐶 + A) < (𝐶 + B)))
 
Axiomax-pre-mulgt0 6780 The product of two positive reals is positive. Axiom for real and complex numbers, justified by theorem axpre-mulgt0 6751. (Contributed by NM, 13-Oct-2005.)
((A B ℝ) → ((0 < A 0 < B) → 0 < (A · B)))
 
Axiomax-pre-mulext 6781 Strong extensionality of multiplication (expressed in terms of <). Axiom for real and complex numbers, justified by theorem axpre-mulext 6752

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

((A B 𝐶 ℝ) → ((A · 𝐶) < (B · 𝐶) → (A < B B < A)))
 
Axiomax-arch 6782* Archimedean axiom. Definition 3.1(2) of [Geuvers], p. 9. Axiom for real and complex numbers, justified by theorem axarch 6753.

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

(A ℝ → 𝑛 {x ∣ (1 x y x (y + 1) x)}A < 𝑛)
 
3.2  Derive the basic properties from the field axioms
 
3.2.1  Some deductions from the field axioms for complex numbers
 
Theoremcnex 6783 Alias for ax-cnex 6754. (Contributed by Mario Carneiro, 17-Nov-2014.)
V
 
Theoremaddcl 6784 Alias for ax-addcl 6759, for naming consistency with addcli 6809. Use this theorem instead of ax-addcl 6759 or axaddcl 6730. (Contributed by NM, 10-Mar-2008.)
((A B ℂ) → (A + B) ℂ)
 
Theoremreaddcl 6785 Alias for ax-addrcl 6760, for naming consistency with readdcli 6818. (Contributed by NM, 10-Mar-2008.)
((A B ℝ) → (A + B) ℝ)
 
Theoremmulcl 6786 Alias for ax-mulcl 6761, for naming consistency with mulcli 6810. (Contributed by NM, 10-Mar-2008.)
((A B ℂ) → (A · B) ℂ)
 
Theoremremulcl 6787 Alias for ax-mulrcl 6762, for naming consistency with remulcli 6819. (Contributed by NM, 10-Mar-2008.)
((A B ℝ) → (A · B) ℝ)
 
Theoremmulcom 6788 Alias for ax-mulcom 6764, for naming consistency with mulcomi 6811. (Contributed by NM, 10-Mar-2008.)
((A B ℂ) → (A · B) = (B · A))
 
Theoremaddass 6789 Alias for ax-addass 6765, for naming consistency with addassi 6813. (Contributed by NM, 10-Mar-2008.)
((A B 𝐶 ℂ) → ((A + B) + 𝐶) = (A + (B + 𝐶)))
 
Theoremmulass 6790 Alias for ax-mulass 6766, for naming consistency with mulassi 6814. (Contributed by NM, 10-Mar-2008.)
((A B 𝐶 ℂ) → ((A · B) · 𝐶) = (A · (B · 𝐶)))
 
Theoremadddi 6791 Alias for ax-distr 6767, for naming consistency with adddii 6815. (Contributed by NM, 10-Mar-2008.)
((A B 𝐶 ℂ) → (A · (B + 𝐶)) = ((A · B) + (A · 𝐶)))
 
Theoremrecn 6792 A real number is a complex number. (Contributed by NM, 10-Aug-1999.)
(A ℝ → A ℂ)
 
Theoremreex 6793 The real numbers form a set. (Contributed by Mario Carneiro, 17-Nov-2014.)
V
 
Theoremreelprrecn 6794 Reals are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
{ℝ, ℂ}
 
Theoremcnelprrecn 6795 Complex numbers are a subset of the pair of real and complex numbers (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
{ℝ, ℂ}
 
Theoremadddir 6796 Distributive law for complex numbers (right-distributivity). (Contributed by NM, 10-Oct-2004.)
((A B 𝐶 ℂ) → ((A + B) · 𝐶) = ((A · 𝐶) + (B · 𝐶)))
 
Theorem0cn 6797 0 is a complex number. (Contributed by NM, 19-Feb-2005.)
0
 
Theorem0cnd 6798 0 is a complex number, deductive form. (Contributed by David A. Wheeler, 8-Dec-2018.)
(φ → 0 ℂ)
 
Theoremc0ex 6799 0 is a set (common case). (Contributed by David A. Wheeler, 7-Jul-2016.)
0 V
 
Theorem1ex 6800 1 is a set. Common special case. (Contributed by David A. Wheeler, 7-Jul-2016.)
1 V
    < 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-9427
  Copyright terms: Public domain < Previous  Next >