Home Intuitionistic Logic ExplorerTheorem List (p. 22 of 134) < Previous  Next > Browser slow? Try the Unicode version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 2101-2200   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theorembarbari 2101 "Barbari", one of the syllogisms of Aristotelian logic. All is , all is , and some exist, therefore some is . (In Aristotelian notation, AAI-1: MaP and SaM therefore SiP.) For example, given "All men are mortal", "All Greeks are men", and "Greeks exist", therefore "Some Greeks are mortal". Note the existence hypothesis (to prove the "some" in the conclusion). Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 30-Aug-2016.)

Theoremcelaront 2102 "Celaront", one of the syllogisms of Aristotelian logic. No is , all is , and some exist, therefore some is not . (In Aristotelian notation, EAO-1: MeP and SaM therefore SoP.) For example, given "No reptiles have fur", "All snakes are reptiles.", and "Snakes exist.", prove "Some snakes have no fur". Note the existence hypothesis. Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremcesare 2103 "Cesare", one of the syllogisms of Aristotelian logic. No is , and all is , therefore no is . (In Aristotelian notation, EAE-2: PeM and SaM therefore SeP.) Related to celarent 2098. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 13-Nov-2016.)

Theoremcamestres 2104 "Camestres", one of the syllogisms of Aristotelian logic. All is , and no is , therefore no is . (In Aristotelian notation, AEE-2: PaM and SeM therefore SeP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremfestino 2105 "Festino", one of the syllogisms of Aristotelian logic. No is , and some is , therefore some is not . (In Aristotelian notation, EIO-2: PeM and SiM therefore SoP.) (Contributed by David A. Wheeler, 25-Nov-2016.)

Theorembaroco 2106 "Baroco", one of the syllogisms of Aristotelian logic. All is , and some is not , therefore some is not . (In Aristotelian notation, AOO-2: PaM and SoM therefore SoP.) For example, "All informative things are useful", "Some websites are not useful", therefore "Some websites are not informative." (Contributed by David A. Wheeler, 28-Aug-2016.)

Theoremcesaro 2107 "Cesaro", one of the syllogisms of Aristotelian logic. No is , all is , and exist, therefore some is not . (In Aristotelian notation, EAO-2: PeM and SaM therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremcamestros 2108 "Camestros", one of the syllogisms of Aristotelian logic. All is , no is , and exist, therefore some is not . (In Aristotelian notation, AEO-2: PaM and SeM therefore SoP.) For example, "All horses have hooves", "No humans have hooves", and humans exist, therefore "Some humans are not horses". (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremdatisi 2109 "Datisi", one of the syllogisms of Aristotelian logic. All is , and some is , therefore some is . (In Aristotelian notation, AII-3: MaP and MiS therefore SiP.) (Contributed by David A. Wheeler, 28-Aug-2016.)

Theoremdisamis 2110 "Disamis", one of the syllogisms of Aristotelian logic. Some is , and all is , therefore some is . (In Aristotelian notation, IAI-3: MiP and MaS therefore SiP.) (Contributed by David A. Wheeler, 28-Aug-2016.)

Theoremferison 2111 "Ferison", one of the syllogisms of Aristotelian logic. No is , and some is , therefore some is not . (In Aristotelian notation, EIO-3: MeP and MiS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theorembocardo 2112 "Bocardo", one of the syllogisms of Aristotelian logic. Some is not , and all is , therefore some is not . (In Aristotelian notation, OAO-3: MoP and MaS therefore SoP.) For example, "Some cats have no tails", "All cats are mammals", therefore "Some mammals have no tails". A reorder of disamis 2110; prefer using that instead. (Contributed by David A. Wheeler, 28-Aug-2016.) (New usage is discouraged.)

Theoremfelapton 2113 "Felapton", one of the syllogisms of Aristotelian logic. No is , all is , and some exist, therefore some is not . (In Aristotelian notation, EAO-3: MeP and MaS therefore SoP.) For example, "No flowers are animals" and "All flowers are plants", therefore "Some plants are not animals". (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremdarapti 2114 "Darapti", one of the syllogisms of Aristotelian logic. All is , all is , and some exist, therefore some is . (In Aristotelian notation, AAI-3: MaP and MaS therefore SiP.) For example, "All squares are rectangles" and "All squares are rhombuses", therefore "Some rhombuses are rectangles". (Contributed by David A. Wheeler, 28-Aug-2016.)

Theoremcalemes 2115 "Calemes", one of the syllogisms of Aristotelian logic. All is , and no is , therefore no is . (In Aristotelian notation, AEE-4: PaM and MeS therefore SeP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremdimatis 2116 "Dimatis", one of the syllogisms of Aristotelian logic. Some is , and all is , therefore some is . (In Aristotelian notation, IAI-4: PiM and MaS therefore SiP.) For example, "Some pets are rabbits.", "All rabbits have fur", therefore "Some fur bearing animals are pets". Like darii 2099 with positions interchanged. (Contributed by David A. Wheeler, 28-Aug-2016.)

Theoremfresison 2117 "Fresison", one of the syllogisms of Aristotelian logic. No is (PeM), and some is (MiS), therefore some is not (SoP). (In Aristotelian notation, EIO-4: PeM and MiS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremcalemos 2118 "Calemos", one of the syllogisms of Aristotelian logic. All is (PaM), no is (MeS), and exist, therefore some is not (SoP). (In Aristotelian notation, AEO-4: PaM and MeS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theoremfesapo 2119 "Fesapo", one of the syllogisms of Aristotelian logic. No is , all is , and exist, therefore some is not . (In Aristotelian notation, EAO-4: PeM and MaS therefore SoP.) (Contributed by David A. Wheeler, 28-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)

Theorembamalip 2120 "Bamalip", one of the syllogisms of Aristotelian logic. All is , all is , and exist, therefore some is . (In Aristotelian notation, AAI-4: PaM and MaS therefore SiP.) Like barbari 2101. (Contributed by David A. Wheeler, 28-Aug-2016.)

PART 2  SET THEORY

Set theory uses the formalism of propositional and predicate calculus to assert properties of arbitrary mathematical objects called "sets." A set can be an element of another set, and this relationship is indicated by the symbol. Starting with the simplest mathematical object, called the empty set, set theory builds up more and more complex structures whose existence follows from the axioms, eventually resulting in extremely complicated sets that we identify with the real numbers and other familiar mathematical objects.

Here we develop set theory based on the Intuitionistic Zermelo-Fraenkel (IZF) system, mostly following the IZF axioms as laid out in [Crosilla]. Constructive Zermelo-Fraenkel (CZF), also described in Crosilla, is not as easy to formalize in Metamath because the statement of some of its axioms uses the notion of "bounded formula". Since Metamath has, purposefully, a very weak metalogic, that notion must be developed in the logic itself. This is similar to our treatment of substitution (df-sb 1736) and our definition of the nonfreeness predicate (df-nf 1437), whereas substitution and bound and free variables are ordinarily defined in the metalogic. The development of CZF has begun in BJ's mathbox, see wbd 13069.

2.1  IZF Set Theory - start with the Axiom of Extensionality

2.1.1  Introduce the Axiom of Extensionality

Axiomax-ext 2121* Axiom of Extensionality. It states that two sets are identical if they contain the same elements. Axiom 1 of [Crosilla] p. "Axioms of CZF and IZF" (with unnecessary quantifiers removed).

Set theory can also be formulated with a single primitive predicate on top of traditional predicate calculus without equality. In that case the Axiom of Extensionality becomes , and equality is defined as . All of the usual axioms of equality then become theorems of set theory. See, for example, Axiom 1 of [TakeutiZaring] p. 8.

To use the above "equality-free" version of Extensionality with Metamath's logical axioms, we would rewrite ax-8 1482 through ax-16 1786 with equality expanded according to the above definition. Some of those axioms could be proved from set theory and would be redundant. Not all of them are redundant, since our axioms of predicate calculus make essential use of equality for the proper substitution that is a primitive notion in traditional predicate calculus. A study of such an axiomatization would be an interesting project for someone exploring the foundations of logic.

It is important to understand that strictly speaking, all of our set theory axioms are really schemes that represent an infinite number of actual axioms. This is inherent in the design of Metamath ("metavariable math"), which manipulates only metavariables. For example, the metavariable in ax-ext 2121 can represent any actual variable v1, v2, v3,... . Distinct variable restrictions (\$d) prevent us from substituting say v1 for both and . This is in contrast to typical textbook presentations that present actual axioms (except for axioms which involve wff metavariables). In practice, though, the theorems and proofs are essentially the same. The \$d restrictions make each of the infinite axioms generated by the ax-ext 2121 scheme exactly logically equivalent to each other and in particular to the actual axiom of the textbook version. (Contributed by NM, 5-Aug-1993.)

Theoremaxext3 2122* A generalization of the Axiom of Extensionality in which and need not be distinct. (Contributed by NM, 15-Sep-1993.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)

Theoremaxext4 2123* A bidirectional version of Extensionality. Although this theorem "looks" like it is just a definition of equality, it requires the Axiom of Extensionality for its proof under our axiomatization. See the comments for ax-ext 2121. (Contributed by NM, 14-Nov-2008.)

Theorembm1.1 2124* Any set defined by a property is the only set defined by that property. Theorem 1.1 of [BellMachover] p. 462. (Contributed by NM, 30-Jun-1994.)

2.1.2  Class abstractions (a.k.a. class builders)

Syntaxcab 2125 Introduce the class builder or class abstraction notation ("the class of sets such that is true"). Our class variables , , etc. range over class builders (sometimes implicitly). Note that a setvar variable can be expressed as a class builder per theorem cvjust 2134, justifying the assignment of setvar variables to class variables via the use of cv 1330.

Definitiondf-clab 2126 Define class abstraction notation (so-called by Quine), also called a "class builder" in the literature. and need not be distinct. Definition 2.1 of [Quine] p. 16. Typically, will have as a free variable, and " " is read "the class of all sets such that is true." We do not define in isolation but only as part of an expression that extends or "overloads" the relationship.

This is our first use of the symbol to connect classes instead of sets. The syntax definition wcel 1480, which extends or "overloads" the wel 1481 definition connecting setvar variables, requires that both sides of be a class. In df-cleq 2132 and df-clel 2135, we introduce a new kind of variable (class variable) that can substituted with expressions such as . In the present definition, the on the left-hand side is a setvar variable. Syntax definition cv 1330 allows us to substitute a setvar variable for a class variable: all sets are classes by cvjust 2134 (but not necessarily vice-versa). For a full description of how classes are introduced and how to recover the primitive language, see the discussion in Quine (and under abeq2 2248 for a quick overview).

Because class variables can be substituted with compound expressions and setvar variables cannot, it is often useful to convert a theorem containing a free setvar variable to a more general version with a class variable.

This is called the "axiom of class comprehension" by [Levy] p. 338, who treats the theory of classes as an extralogical extension to our logic and set theory axioms. He calls the construction a "class term".

For a general discussion of the theory of classes, see https://us.metamath.org/mpeuni/mmset.html#class 2248. (Contributed by NM, 5-Aug-1993.)

Theoremabid 2127 Simplification of class abstraction notation when the free and bound variables are identical. (Contributed by NM, 5-Aug-1993.)

Theoremhbab1 2128* Bound-variable hypothesis builder for a class abstraction. (Contributed by NM, 5-Aug-1993.)

Theoremnfsab1 2129* Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)

Theoremhbab 2130* Bound-variable hypothesis builder for a class abstraction. (Contributed by NM, 1-Mar-1995.)

Theoremnfsab 2131* Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)

Definitiondf-cleq 2132* Define the equality connective between classes. Definition 2.7 of [Quine] p. 18. Also Definition 4.5 of [TakeutiZaring] p. 13; Chapter 4 provides its justification and methods for eliminating it. Note that its elimination will not necessarily result in a single wff in the original language but possibly a "scheme" of wffs.

This is an example of a somewhat "risky" definition, meaning that it has a more complex than usual soundness justification (outside of Metamath), because it "overloads" or reuses the existing equality symbol rather than introducing a new symbol. This allows us to make statements that may not hold for the original symbol. For example, it permits us to deduce , which is not a theorem of logic but rather presupposes the Axiom of Extensionality (see theorem axext4 2123). We therefore include this axiom as a hypothesis, so that the use of Extensionality is properly indicated.

We could avoid this complication by introducing a new symbol, say =2, in place of . This would also have the advantage of making elimination of the definition straightforward, so that we could eliminate Extensionality as a hypothesis. We would then also have the advantage of being able to identify in various proofs exactly where Extensionality truly comes into play rather than just being an artifact of a definition. One of our theorems would then be =2 by invoking Extensionality.

However, to conform to literature usage, we retain this overloaded definition. This also makes some proofs shorter and probably easier to read, without the constant switching between two kinds of equality.

See also comments under df-clab 2126, df-clel 2135, and abeq2 2248.

In the form of dfcleq 2133, this is called the "axiom of extensionality" by [Levy] p. 338, who treats the theory of classes as an extralogical extension to our logic and set theory axioms.

For a general discussion of the theory of classes, see https://us.metamath.org/mpeuni/mmset.html#class 2133. (Contributed by NM, 15-Sep-1993.)

Theoremdfcleq 2133* The same as df-cleq 2132 with the hypothesis removed using the Axiom of Extensionality ax-ext 2121. (Contributed by NM, 15-Sep-1993.)

Theoremcvjust 2134* Every set is a class. Proposition 4.9 of [TakeutiZaring] p. 13. This theorem shows that a setvar variable can be expressed as a class abstraction. This provides a motivation for the class syntax construction cv 1330, which allows us to substitute a setvar variable for a class variable. See also cab 2125 and df-clab 2126. Note that this is not a rigorous justification, because cv 1330 is used as part of the proof of this theorem, but a careful argument can be made outside of the formalism of Metamath, for example as is done in Chapter 4 of Takeuti and Zaring. See also the discussion under the definition of class in [Jech] p. 4 showing that "Every set can be considered to be a class." (Contributed by NM, 7-Nov-2006.)

Definitiondf-clel 2135* Define the membership connective between classes. Theorem 6.3 of [Quine] p. 41, or Proposition 4.6 of [TakeutiZaring] p. 13, which we adopt as a definition. See these references for its metalogical justification. Note that like df-cleq 2132 it extends or "overloads" the use of the existing membership symbol, but unlike df-cleq 2132 it does not strengthen the set of valid wffs of logic when the class variables are replaced with setvar variables (see cleljust 1910), so we don't include any set theory axiom as a hypothesis. See also comments about the syntax under df-clab 2126.

This is called the "axiom of membership" by [Levy] p. 338, who treats the theory of classes as an extralogical extension to our logic and set theory axioms.

For a general discussion of the theory of classes, see https://us.metamath.org/mpeuni/mmset.html#class 2126. (Contributed by NM, 5-Aug-1993.)

Theoremeqriv 2136* Infer equality of classes from equivalence of membership. (Contributed by NM, 5-Aug-1993.)

Theoremeqrdv 2137* Deduce equality of classes from equivalence of membership. (Contributed by NM, 17-Mar-1996.)

Theoremeqrdav 2138* Deduce equality of classes from an equivalence of membership that depends on the membership variable. (Contributed by NM, 7-Nov-2008.)

Theoremeqid 2139 Law of identity (reflexivity of class equality). Theorem 6.4 of [Quine] p. 41.

This law is thought to have originated with Aristotle (Metaphysics, Zeta, 17, 1041 a, 10-20). (Thanks to Stefan Allan and BJ for this information.) (Contributed by NM, 5-Aug-1993.) (Revised by BJ, 14-Oct-2017.)

Theoremeqidd 2140 Class identity law with antecedent. (Contributed by NM, 21-Aug-2008.)

Theoremeqcom 2141 Commutative law for class equality. Theorem 6.5 of [Quine] p. 41. (Contributed by NM, 5-Aug-1993.)

Theoremeqcoms 2142 Inference applying commutative law for class equality to an antecedent. (Contributed by NM, 5-Aug-1993.)

Theoremeqcomi 2143 Inference from commutative law for class equality. (Contributed by NM, 5-Aug-1993.)

Theoremneqcomd 2144 Commute an inequality. (Contributed by Rohan Ridenour, 3-Aug-2023.)

Theoremeqcomd 2145 Deduction from commutative law for class equality. (Contributed by NM, 15-Aug-1994.)

Theoremeqeq1 2146 Equality implies equivalence of equalities. (Contributed by NM, 5-Aug-1993.)

Theoremeqeq1i 2147 Inference from equality to equivalence of equalities. (Contributed by NM, 5-Aug-1993.)

Theoremeqeq1d 2148 Deduction from equality to equivalence of equalities. (Contributed by NM, 27-Dec-1993.)

Theoremeqeq2 2149 Equality implies equivalence of equalities. (Contributed by NM, 5-Aug-1993.)

Theoremeqeq2i 2150 Inference from equality to equivalence of equalities. (Contributed by NM, 5-Aug-1993.)

Theoremeqeq2d 2151 Deduction from equality to equivalence of equalities. (Contributed by NM, 27-Dec-1993.)

Theoremeqeq12 2152 Equality relationship among 4 classes. (Contributed by NM, 3-Aug-1994.)

Theoremeqeq12i 2153 A useful inference for substituting definitions into an equality. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeqeq12d 2154 A useful inference for substituting definitions into an equality. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeqeqan12d 2155 A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeqeqan12rd 2156 A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.)

Theoremeqtr 2157 Transitive law for class equality. Proposition 4.7(3) of [TakeutiZaring] p. 13. (Contributed by NM, 25-Jan-2004.)

Theoremeqtr2 2158 A transitive law for class equality. (Contributed by NM, 20-May-2005.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeqtr3 2159 A transitive law for class equality. (Contributed by NM, 20-May-2005.)

Theoremeqtri 2160 An equality transitivity inference. (Contributed by NM, 5-Aug-1993.)

Theoremeqtr2i 2161 An equality transitivity inference. (Contributed by NM, 21-Feb-1995.)

Theoremeqtr3i 2162 An equality transitivity inference. (Contributed by NM, 6-May-1994.)

Theoremeqtr4i 2163 An equality transitivity inference. (Contributed by NM, 5-Aug-1993.)

Theorem3eqtri 2164 An inference from three chained equalities. (Contributed by NM, 29-Aug-1993.)

Theorem3eqtrri 2165 An inference from three chained equalities. (Contributed by NM, 3-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr2i 2166 An inference from three chained equalities. (Contributed by NM, 3-Aug-2006.)

Theorem3eqtr2ri 2167 An inference from three chained equalities. (Contributed by NM, 3-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr3i 2168 An inference from three chained equalities. (Contributed by NM, 6-May-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr3ri 2169 An inference from three chained equalities. (Contributed by NM, 15-Aug-2004.)

Theorem3eqtr4i 2170 An inference from three chained equalities. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr4ri 2171 An inference from three chained equalities. (Contributed by NM, 2-Sep-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeqtrd 2172 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)

Theoremeqtr2d 2173 An equality transitivity deduction. (Contributed by NM, 18-Oct-1999.)

Theoremeqtr3d 2174 An equality transitivity equality deduction. (Contributed by NM, 18-Jul-1995.)

Theoremeqtr4d 2175 An equality transitivity equality deduction. (Contributed by NM, 18-Jul-1995.)

Theorem3eqtrd 2176 A deduction from three chained equalities. (Contributed by NM, 29-Oct-1995.)

Theorem3eqtrrd 2177 A deduction from three chained equalities. (Contributed by NM, 4-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr2d 2178 A deduction from three chained equalities. (Contributed by NM, 4-Aug-2006.)

Theorem3eqtr2rd 2179 A deduction from three chained equalities. (Contributed by NM, 4-Aug-2006.)

Theorem3eqtr3d 2180 A deduction from three chained equalities. (Contributed by NM, 4-Aug-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr3rd 2181 A deduction from three chained equalities. (Contributed by NM, 14-Jan-2006.)

Theorem3eqtr4d 2182 A deduction from three chained equalities. (Contributed by NM, 4-Aug-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3eqtr4rd 2183 A deduction from three chained equalities. (Contributed by NM, 21-Sep-1995.)

Theoremsyl5eq 2184 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5req 2185 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)

Theoremsyl5eqr 2186 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5reqr 2187 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)

Theoremsyl6eq 2188 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6req 2189 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)

Theoremsyl6eqr 2190 An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6reqr 2191 An equality transitivity deduction. (Contributed by NM, 29-Mar-1998.)

Theoremsylan9eq 2192 An equality transitivity deduction. (Contributed by NM, 8-May-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremsylan9req 2193 An equality transitivity deduction. (Contributed by NM, 23-Jun-2007.)

Theoremsylan9eqr 2194 An equality transitivity deduction. (Contributed by NM, 8-May-1994.)

Theorem3eqtr3g 2195 A chained equality inference, useful for converting from definitions. (Contributed by NM, 15-Nov-1994.)

Theorem3eqtr3a 2196 A chained equality inference, useful for converting from definitions. (Contributed by Mario Carneiro, 6-Nov-2015.)

Theorem3eqtr4g 2197 A chained equality inference, useful for converting to definitions. (Contributed by NM, 5-Aug-1993.)

Theorem3eqtr4a 2198 A chained equality inference, useful for converting to definitions. (Contributed by NM, 2-Feb-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremeq2tri 2199 A compound transitive inference for class equality. (Contributed by NM, 22-Jan-2004.)

Theoremeleq1w 2200 Weaker version of eleq1 2202 (but more general than elequ1 1690) not depending on ax-ext 2121 nor df-cleq 2132. (Contributed by BJ, 24-Jun-2019.)

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-13316
 Copyright terms: Public domain < Previous  Next >