Home Intuitionistic Logic ExplorerTheorem List (p. 21 of 111) < 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 - 2001-2100   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremeuor2 2001 Introduce or eliminate a disjunct in a uniqueness quantifier. (Contributed by NM, 21-Oct-2005.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
(¬ ∃𝑥𝜑 → (∃!𝑥(𝜑𝜓) ↔ ∃!𝑥𝜓))

Theoremsbmo 2002* Substitution into "at most one". (Contributed by Jeff Madsen, 2-Sep-2009.)
([𝑦 / 𝑥]∃*𝑧𝜑 ↔ ∃*𝑧[𝑦 / 𝑥]𝜑)

Theoremmo4f 2003* "At most one" expressed using implicit substitution. (Contributed by NM, 10-Apr-2004.)
𝑥𝜓    &   (𝑥 = 𝑦 → (𝜑𝜓))       (∃*𝑥𝜑 ↔ ∀𝑥𝑦((𝜑𝜓) → 𝑥 = 𝑦))

Theoremmo4 2004* "At most one" expressed using implicit substitution. (Contributed by NM, 26-Jul-1995.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∃*𝑥𝜑 ↔ ∀𝑥𝑦((𝜑𝜓) → 𝑥 = 𝑦))

Theoremeu4 2005* Uniqueness using implicit substitution. (Contributed by NM, 26-Jul-1995.)
(𝑥 = 𝑦 → (𝜑𝜓))       (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∀𝑥𝑦((𝜑𝜓) → 𝑥 = 𝑦)))

Theoremexmoeudc 2006 Existence in terms of "at most one" and uniqueness. (Contributed by Jim Kingdon, 3-Jul-2018.)
(DECID𝑥𝜑 → (∃𝑥𝜑 ↔ (∃*𝑥𝜑 → ∃!𝑥𝜑)))

Theoremmoim 2007 "At most one" is preserved through implication (notice wff reversal). (Contributed by NM, 22-Apr-1995.)
(∀𝑥(𝜑𝜓) → (∃*𝑥𝜓 → ∃*𝑥𝜑))

Theoremmoimi 2008 "At most one" is preserved through implication (notice wff reversal). (Contributed by NM, 15-Feb-2006.)
(𝜑𝜓)       (∃*𝑥𝜓 → ∃*𝑥𝜑)

Theoremmoimv 2009* Move antecedent outside of "at most one." (Contributed by NM, 28-Jul-1995.)
(∃*𝑥(𝜑𝜓) → (𝜑 → ∃*𝑥𝜓))

Theoremeuimmo 2010 Uniqueness implies "at most one" through implication. (Contributed by NM, 22-Apr-1995.)
(∀𝑥(𝜑𝜓) → (∃!𝑥𝜓 → ∃*𝑥𝜑))

Theoremeuim 2011 Add existential uniqueness quantifiers to an implication. Note the reversed implication in the antecedent. (Contributed by NM, 19-Oct-2005.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)
((∃𝑥𝜑 ∧ ∀𝑥(𝜑𝜓)) → (∃!𝑥𝜓 → ∃!𝑥𝜑))

Theoremmoan 2012 "At most one" is still the case when a conjunct is added. (Contributed by NM, 22-Apr-1995.)
(∃*𝑥𝜑 → ∃*𝑥(𝜓𝜑))

Theoremmoani 2013 "At most one" is still true when a conjunct is added. (Contributed by NM, 9-Mar-1995.)
∃*𝑥𝜑       ∃*𝑥(𝜓𝜑)

Theoremmoor 2014 "At most one" is still the case when a disjunct is removed. (Contributed by NM, 5-Apr-2004.)
(∃*𝑥(𝜑𝜓) → ∃*𝑥𝜑)

Theoremmooran1 2015 "At most one" imports disjunction to conjunction. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
((∃*𝑥𝜑 ∨ ∃*𝑥𝜓) → ∃*𝑥(𝜑𝜓))

Theoremmooran2 2016 "At most one" exports disjunction to conjunction. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
(∃*𝑥(𝜑𝜓) → (∃*𝑥𝜑 ∧ ∃*𝑥𝜓))

Theoremmoanim 2017 Introduction of a conjunct into "at most one" quantifier. (Contributed by NM, 3-Dec-2001.)
𝑥𝜑       (∃*𝑥(𝜑𝜓) ↔ (𝜑 → ∃*𝑥𝜓))

Theoremmoanimv 2018* Introduction of a conjunct into "at most one" quantifier. (Contributed by NM, 23-Mar-1995.)
(∃*𝑥(𝜑𝜓) ↔ (𝜑 → ∃*𝑥𝜓))

Theoremmoaneu 2019 Nested "at most one" and uniqueness quantifiers. (Contributed by NM, 25-Jan-2006.)
∃*𝑥(𝜑 ∧ ∃!𝑥𝜑)

Theoremmoanmo 2020 Nested "at most one" quantifiers. (Contributed by NM, 25-Jan-2006.)
∃*𝑥(𝜑 ∧ ∃*𝑥𝜑)

Theoremmopick 2021 "At most one" picks a variable value, eliminating an existential quantifier. (Contributed by NM, 27-Jan-1997.)
((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))

Theoremeupick 2022 Existential uniqueness "picks" a variable value for which another wff is true. If there is only one thing 𝑥 such that 𝜑 is true, and there is also an 𝑥 (actually the same one) such that 𝜑 and 𝜓 are both true, then 𝜑 implies 𝜓 regardless of 𝑥. This theorem can be useful for eliminating existential quantifiers in a hypothesis. Compare Theorem *14.26 in [WhiteheadRussell] p. 192. (Contributed by NM, 10-Jul-1994.)
((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))

Theoremeupicka 2023 Version of eupick 2022 with closed formulas. (Contributed by NM, 6-Sep-2008.)
((∃!𝑥𝜑 ∧ ∃𝑥(𝜑𝜓)) → ∀𝑥(𝜑𝜓))

Theoremeupickb 2024 Existential uniqueness "pick" showing wff equivalence. (Contributed by NM, 25-Nov-1994.)
((∃!𝑥𝜑 ∧ ∃!𝑥𝜓 ∧ ∃𝑥(𝜑𝜓)) → (𝜑𝜓))

Theoremeupickbi 2025 Theorem *14.26 in [WhiteheadRussell] p. 192. (Contributed by Andrew Salmon, 11-Jul-2011.)
(∃!𝑥𝜑 → (∃𝑥(𝜑𝜓) ↔ ∀𝑥(𝜑𝜓)))

Theoremmopick2 2026 "At most one" can show the existence of a common value. In this case we can infer existence of conjunction from a conjunction of existence, and it is one way to achieve the converse of 19.40 1563. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
((∃*𝑥𝜑 ∧ ∃𝑥(𝜑𝜓) ∧ ∃𝑥(𝜑𝜒)) → ∃𝑥(𝜑𝜓𝜒))

Theoremmoexexdc 2027 "At most one" double quantification. (Contributed by Jim Kingdon, 5-Jul-2018.)
𝑦𝜑       (DECID𝑥𝜑 → ((∃*𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦𝑥(𝜑𝜓)))

Theoremeuexex 2028 Existential uniqueness and "at most one" double quantification. (Contributed by Jim Kingdon, 28-Dec-2018.)
𝑦𝜑       ((∃!𝑥𝜑 ∧ ∀𝑥∃*𝑦𝜓) → ∃*𝑦𝑥(𝜑𝜓))

Theorem2moex 2029 Double quantification with "at most one." (Contributed by NM, 3-Dec-2001.)
(∃*𝑥𝑦𝜑 → ∀𝑦∃*𝑥𝜑)

Theorem2euex 2030 Double quantification with existential uniqueness. (Contributed by NM, 3-Dec-2001.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
(∃!𝑥𝑦𝜑 → ∃𝑦∃!𝑥𝜑)

Theorem2eumo 2031 Double quantification with existential uniqueness and "at most one." (Contributed by NM, 3-Dec-2001.)
(∃!𝑥∃*𝑦𝜑 → ∃*𝑥∃!𝑦𝜑)

Theorem2eu2ex 2032 Double existential uniqueness. (Contributed by NM, 3-Dec-2001.)
(∃!𝑥∃!𝑦𝜑 → ∃𝑥𝑦𝜑)

Theorem2moswapdc 2033 A condition allowing swap of "at most one" and existential quantifiers. (Contributed by Jim Kingdon, 6-Jul-2018.)
(DECID𝑥𝑦𝜑 → (∀𝑥∃*𝑦𝜑 → (∃*𝑥𝑦𝜑 → ∃*𝑦𝑥𝜑)))

Theorem2euswapdc 2034 A condition allowing swap of uniqueness and existential quantifiers. (Contributed by Jim Kingdon, 7-Jul-2018.)
(DECID𝑥𝑦𝜑 → (∀𝑥∃*𝑦𝜑 → (∃!𝑥𝑦𝜑 → ∃!𝑦𝑥𝜑)))

Theorem2exeu 2035 Double existential uniqueness implies double uniqueness quantification. (Contributed by NM, 3-Dec-2001.)
((∃!𝑥𝑦𝜑 ∧ ∃!𝑦𝑥𝜑) → ∃!𝑥∃!𝑦𝜑)

Theorem2eu4 2036* This theorem provides us with a definition of double existential uniqueness ("exactly one 𝑥 and exactly one 𝑦"). Naively one might think (incorrectly) that it could be defined by ∃!𝑥∃!𝑦𝜑. See 2exeu 2035 for a one-way implication. (Contributed by NM, 3-Dec-2001.)
((∃!𝑥𝑦𝜑 ∧ ∃!𝑦𝑥𝜑) ↔ (∃𝑥𝑦𝜑 ∧ ∃𝑧𝑤𝑥𝑦(𝜑 → (𝑥 = 𝑧𝑦 = 𝑤))))

Theorem2eu7 2037 Two equivalent expressions for double existential uniqueness. (Contributed by NM, 19-Feb-2005.)
((∃!𝑥𝑦𝜑 ∧ ∃!𝑦𝑥𝜑) ↔ ∃!𝑥∃!𝑦(∃𝑥𝜑 ∧ ∃𝑦𝜑))

Theoremeuequ1 2038* Equality has existential uniqueness. (Contributed by Stefan Allan, 4-Dec-2008.)
∃!𝑥 𝑥 = 𝑦

Theoremexists1 2039* Two ways to express "only one thing exists." The left-hand side requires only one variable to express this. Both sides are false in set theory. (Contributed by NM, 5-Apr-2004.)
(∃!𝑥 𝑥 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)

Theoremexists2 2040 A condition implying that at least two things exist. (Contributed by NM, 10-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
((∃𝑥𝜑 ∧ ∃𝑥 ¬ 𝜑) → ¬ ∃!𝑥 𝑥 = 𝑥)

1.4.7  Aristotelian logic: Assertic syllogisms

Model the Aristotelian assertic syllogisms using modern notation. This section shows that the Aristotelian assertic syllogisms can be proven with our axioms of logic, and also provides generally useful theorems.

In antiquity Aristotelian logic and Stoic logic (see mptnan 1355) were the leading logical systems. Aristotelian logic became the leading system in medieval Europe; this section models this system (including later refinements to it). Aristotle defined syllogisms very generally ("a discourse in which certain (specific) things having been supposed, something different from the things supposed results of necessity because these things are so") Aristotle, Prior Analytics 24b18-20. However, in Prior Analytics he limits himself to categorical syllogisms that consist of three categorical propositions with specific structures. The syllogisms are the valid subset of the possible combinations of these structures. The medieval schools used vowels to identify the types of terms (a=all, e=none, i=some, and o=some are not), and named the different syllogisms with Latin words that had the vowels in the intended order.

"There is a surprising amount of scholarly debate about how best to formalize Aristotle's syllogisms..." according to Aristotle's Modal Proofs: Prior Analytics A8-22 in Predicate Logic, Adriane Rini, Springer, 2011, ISBN 978-94-007-0049-9, page 28. For example, Lukasiewicz believes it is important to note that "Aristotle does not introduce singular terms or premisses into his system". Lukasiewicz also believes that Aristotelian syllogisms are predicates (having a true/false value), not inference rules: "The characteristic sign of an inference is the word 'therefore'... no syllogism is formulated by Aristotle primarily as an inference, but they are all implications." Jan Lukasiewicz, Aristotle's Syllogistic from the Standpoint of Modern Formal Logic, Second edition, Oxford, 1957, page 1-2. Lukasiewicz devised a specialized prefix notation for representing Aristotelian syllogisms instead of using standard predicate logic notation.

We instead translate each Aristotelian syllogism into an inference rule, and each rule is defined using standard predicate logic notation and predicates. The predicates are represented by wff variables that may depend on the quantified variable 𝑥. Our translation is essentially identical to the one use in Rini page 18, Table 2 "Non-Modal Syllogisms in Lower Predicate Calculus (LPC)", which uses standard predicate logic with predicates. Rini states, "the crucial point is that we capture the meaning Aristotle intends, and the method by which we represent that meaning is less important." There are two differences: we make the existence criteria explicit, and we use 𝜑, 𝜓, and 𝜒 in the order they appear (a common Metamath convention). Patzig also uses standard predicate logic notation and predicates (though he interprets them as conditional propositions, not as inference rules); see Gunther Patzig, Aristotle's Theory of the Syllogism second edition, 1963, English translation by Jonathan Barnes, 1968, page 38. Terms such as "all" and "some" are translated into predicate logic using the aproach devised by Frege and Russell. "Frege (and Russell) devised an ingenious procedure for regimenting binary quantifiers like "every" and "some" in terms of unary quantifiers like "everything" and "something": they formalized sentences of the form "Some A is B" and "Every A is B" as exists x (Ax and Bx) and all x (Ax implies Bx), respectively." "Quantifiers and Quantification", Stanford Encyclopedia of Philosophy, http://plato.stanford.edu/entries/quantification/. See Principia Mathematica page 22 and *10 for more information (especially *10.3 and *10.26).

Expressions of the form "no 𝜑 is 𝜓 " are consistently translated as 𝑥(𝜑 → ¬ 𝜓). These can also be expressed as ¬ ∃𝑥(𝜑𝜓), per alinexa 1535. We translate "all 𝜑 is 𝜓 " to 𝑥(𝜑𝜓), "some 𝜑 is 𝜓 " to 𝑥(𝜑𝜓), and "some 𝜑 is not 𝜓 " to 𝑥(𝜑 ∧ ¬ 𝜓). It is traditional to use the singular verb "is", not the plural verb "are", in the generic expressions. By convention the major premise is listed first.

In traditional Aristotelian syllogisms the predicates have a restricted form ("x is a ..."); those predicates could be modeled in modern notation by constructs such as 𝑥 = 𝐴, 𝑥𝐴, or 𝑥𝐴. Here we use wff variables instead of specialized restricted forms. This generalization makes the syllogisms more useful in more circumstances. In addition, these expressions make it clearer that the syllogisms of Aristolean logic are the forerunners of predicate calculus. If we used restricted forms like 𝑥𝐴 instead, we would not only unnecessarily limit their use, but we would also need to use set and class axioms, making their relationship to predicate calculus less clear.

There are some widespread misconceptions about the existential assumptions made by Aristotle (aka "existential import"). Aristotle was not trying to develop something exactly corresponding to modern logic. Aristotle devised "a companion-logic for science. He relegates fictions like fairy godmothers and mermaids and unicorns to the realms of poetry and literature. In his mind, they exist outside the ambit of science. This is why he leaves no room for such non-existent entities in his logic. This is a thoughtful choice, not an inadvertent omission. Technically, Aristotelian science is a search for definitions, where a definition is "a phrase signifying a thing's essence." (Topics, I.5.102a37, Pickard-Cambridge.)... Because non-existent entities cannot be anything, they do not, in Aristotle's mind, possess an essence... This is why he leaves no place for fictional entities like goat-stags (or unicorns)." Source: Louis F. Groarke, "Aristotle: Logic", section 7. (Existential Assumptions), Internet Encyclopedia of Philosophy (A Peer-Reviewed Academic Resource), http://www.iep.utm.edu/aris-log/. Thus, some syllogisms have "extra" existence hypotheses that do not directly appear in Aristotle's original materials (since they were always assumed); they are added where they are needed. This affects barbari 2045, celaront 2046, cesaro 2051, camestros 2052, felapton 2057, darapti 2058, calemos 2062, fesapo 2063, and bamalip 2064.

These are only the assertic syllogisms. Aristotle also defined modal syllogisms that deal with modal qualifiers such as "necessarily" and "possibly". Historically Aristotelian modal syllogisms were not as widely used. For more about modal syllogisms in a modern context, see Rini as well as Aristotle's Modal Syllogistic by Marko Malink, Harvard University Press, November 2013. We do not treat them further here.

Aristotelean logic is essentially the forerunner of predicate calculus (as well as set theory since it discusses membership in groups), while Stoic logic is essentially the forerunner of propositional calculus.

Theorembarbara 2041 "Barbara", one of the fundamental syllogisms of Aristotelian logic. All 𝜑 is 𝜓, and all 𝜒 is 𝜑, therefore all 𝜒 is 𝜓. (In Aristotelian notation, AAA-1: MaP and SaM therefore SaP.) For example, given "All men are mortal" and "Socrates is a man", we can prove "Socrates is mortal". If H is the set of men, M is the set of mortal beings, and S is Socrates, these word phrases can be represented as 𝑥(𝑥𝐻𝑥𝑀) (all men are mortal) and 𝑥(𝑥 = 𝑆𝑥𝐻) (Socrates is a man) therefore 𝑥(𝑥 = 𝑆𝑥𝑀) (Socrates is mortal). Russell and Whitehead note that the "syllogism in Barbara is derived..." from syl 14. (quote after Theorem *2.06 of [WhiteheadRussell] p. 101). Most of the proof is in alsyl 1567. There are a legion of sources for Barbara, including http://www.friesian.com/aristotl.htm, http://plato.stanford.edu/entries/aristotle-logic/, and https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 24-Aug-2016.)
𝑥(𝜑𝜓)    &   𝑥(𝜒𝜑)       𝑥(𝜒𝜓)

Theoremcelarent 2042 "Celarent", one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, and all 𝜒 is 𝜑, therefore no 𝜒 is 𝜓. (In Aristotelian notation, EAE-1: MeP and SaM therefore SeP.) For example, given the "No reptiles have fur" and "All snakes are reptiles", therefore "No snakes have fur". Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 24-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)
𝑥(𝜑 → ¬ 𝜓)    &   𝑥(𝜒𝜑)       𝑥(𝜒 → ¬ 𝜓)

Theoremdarii 2043 "Darii", one of the syllogisms of Aristotelian logic. All 𝜑 is 𝜓, and some 𝜒 is 𝜑, therefore some 𝜒 is 𝜓. (In Aristotelian notation, AII-1: MaP and SiM therefore SiP.) For example, given "All rabbits have fur" and "Some pets are rabbits", therefore "Some pets have fur". Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 24-Aug-2016.)
𝑥(𝜑𝜓)    &   𝑥(𝜒𝜑)       𝑥(𝜒𝜓)

Theoremferio 2044 "Ferio" ("Ferioque"), one of the syllogisms of Aristotelian logic. No 𝜑 is 𝜓, and some 𝜒 is 𝜑, therefore some 𝜒 is not 𝜓. (In Aristotelian notation, EIO-1: MeP and SiM therefore SoP.) For example, given "No homework is fun" and "Some reading is homework", therefore "Some reading is not fun". This is essentially a logical axiom in Aristotelian logic. Example from https://en.wikipedia.org/wiki/Syllogism. (Contributed by David A. Wheeler, 24-Aug-2016.) (Revised by David A. Wheeler, 2-Sep-2016.)
𝑥(𝜑 → ¬ 𝜓)    &   𝑥(𝜒𝜑)       𝑥(𝜒 ∧ ¬ 𝜓)

Theorembarbari 2045 "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 2046 "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 2047 "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 2042. (Contributed by David A. Wheeler, 27-Aug-2016.) (Revised by David A. Wheeler, 13-Nov-2016.)
𝑥(𝜑 → ¬ 𝜓)    &   𝑥(𝜒𝜓)       𝑥(𝜒 → ¬ 𝜑)

Theoremcamestres 2048 "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 2049 "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 2050 "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 2051 "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 2052 "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 2053 "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 2054 "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 2055 "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 2056 "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 2054; prefer using that instead. (Contributed by David A. Wheeler, 28-Aug-2016.) (New usage is discouraged.)
𝑥(𝜑 ∧ ¬ 𝜓)    &   𝑥(𝜑𝜒)       𝑥(𝜒 ∧ ¬ 𝜓)

Theoremfelapton 2057 "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 2058 "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 2059 "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 2060 "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 2043 with positions interchanged. (Contributed by David A. Wheeler, 28-Aug-2016.)
𝑥(𝜑𝜓)    &   𝑥(𝜓𝜒)       𝑥(𝜒𝜑)

Theoremfresison 2061 "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 2062 "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 2063 "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 2064 "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 2045. (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 1688) and our definition of the nonfreeness predicate (df-nf 1391), 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 10888.

2.1  IZF Set Theory - start with the Axiom of Extensionality

2.1.1  Introduce the Axiom of Extensionality

Axiomax-ext 2065* 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 1436 through ax-16 1737 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 2065 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 2065 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 2066* 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 2067* 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 2065. (Contributed by NM, 14-Nov-2008.)
(𝑥 = 𝑦 ↔ ∀𝑧(𝑧𝑥𝑧𝑦))

Theorembm1.1 2068* 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 2069 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 2078, justifying the assignment of setvar variables to class variables via the use of cv 1284.
class {𝑥𝜑}

Definitiondf-clab 2070 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 1434, which extends or "overloads" the wel 1435 definition connecting setvar variables, requires that both sides of be a class. In df-cleq 2076 and df-clel 2079, 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 1284 allows us to substitute a setvar variable 𝑥 for a class variable: all sets are classes by cvjust 2078 (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 2191 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 http://us.metamath.org/mpeuni/mmset.html#class. (Contributed by NM, 5-Aug-1993.)

(𝑥 ∈ {𝑦𝜑} ↔ [𝑥 / 𝑦]𝜑)

Theoremabid 2071 Simplification of class abstraction notation when the free and bound variables are identical. (Contributed by NM, 5-Aug-1993.)
(𝑥 ∈ {𝑥𝜑} ↔ 𝜑)

Theoremhbab1 2072* Bound-variable hypothesis builder for a class abstraction. (Contributed by NM, 5-Aug-1993.)
(𝑦 ∈ {𝑥𝜑} → ∀𝑥 𝑦 ∈ {𝑥𝜑})

Theoremnfsab1 2073* Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
𝑥 𝑦 ∈ {𝑥𝜑}

Theoremhbab 2074* Bound-variable hypothesis builder for a class abstraction. (Contributed by NM, 1-Mar-1995.)
(𝜑 → ∀𝑥𝜑)       (𝑧 ∈ {𝑦𝜑} → ∀𝑥 𝑧 ∈ {𝑦𝜑})

Theoremnfsab 2075* Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.)
𝑥𝜑       𝑥 𝑧 ∈ {𝑦𝜑}

Definitiondf-cleq 2076* 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 2067). 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 2070, df-clel 2079, and abeq2 2191.

In the form of dfcleq 2077, 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 http://us.metamath.org/mpeuni/mmset.html#class. (Contributed by NM, 15-Sep-1993.)

(∀𝑥(𝑥𝑦𝑥𝑧) → 𝑦 = 𝑧)       (𝐴 = 𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))

Theoremdfcleq 2077* The same as df-cleq 2076 with the hypothesis removed using the Axiom of Extensionality ax-ext 2065. (Contributed by NM, 15-Sep-1993.)
(𝐴 = 𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))

Theoremcvjust 2078* 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 1284, which allows us to substitute a setvar variable for a class variable. See also cab 2069 and df-clab 2070. Note that this is not a rigorous justification, because cv 1284 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 2079* 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 2076 it extends or "overloads" the use of the existing membership symbol, but unlike df-cleq 2076 it does not strengthen the set of valid wffs of logic when the class variables are replaced with setvar variables (see cleljust 1856), so we don't include any set theory axiom as a hypothesis. See also comments about the syntax under df-clab 2070.

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 http://us.metamath.org/mpeuni/mmset.html#class. (Contributed by NM, 5-Aug-1993.)

(𝐴𝐵 ↔ ∃𝑥(𝑥 = 𝐴𝑥𝐵))

Theoremeqriv 2080* Infer equality of classes from equivalence of membership. (Contributed by NM, 5-Aug-1993.)
(𝑥𝐴𝑥𝐵)       𝐴 = 𝐵

Theoremeqrdv 2081* Deduce equality of classes from equivalence of membership. (Contributed by NM, 17-Mar-1996.)
(𝜑 → (𝑥𝐴𝑥𝐵))       (𝜑𝐴 = 𝐵)

Theoremeqrdav 2082* Deduce equality of classes from an equivalence of membership that depends on the membership variable. (Contributed by NM, 7-Nov-2008.)
((𝜑𝑥𝐴) → 𝑥𝐶)    &   ((𝜑𝑥𝐵) → 𝑥𝐶)    &   ((𝜑𝑥𝐶) → (𝑥𝐴𝑥𝐵))       (𝜑𝐴 = 𝐵)

Theoremeqid 2083 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 2084 Class identity law with antecedent. (Contributed by NM, 21-Aug-2008.)
(𝜑𝐴 = 𝐴)

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

Theoremeqcoms 2086 Inference applying commutative law for class equality to an antecedent. (Contributed by NM, 5-Aug-1993.)
(𝐴 = 𝐵𝜑)       (𝐵 = 𝐴𝜑)

Theoremeqcomi 2087 Inference from commutative law for class equality. (Contributed by NM, 5-Aug-1993.)
𝐴 = 𝐵       𝐵 = 𝐴

Theoremeqcomd 2088 Deduction from commutative law for class equality. (Contributed by NM, 15-Aug-1994.)
(𝜑𝐴 = 𝐵)       (𝜑𝐵 = 𝐴)

Theoremeqeq1 2089 Equality implies equivalence of equalities. (Contributed by NM, 5-Aug-1993.)
(𝐴 = 𝐵 → (𝐴 = 𝐶𝐵 = 𝐶))

Theoremeqeq1i 2090 Inference from equality to equivalence of equalities. (Contributed by NM, 5-Aug-1993.)
𝐴 = 𝐵       (𝐴 = 𝐶𝐵 = 𝐶)

Theoremeqeq1d 2091 Deduction from equality to equivalence of equalities. (Contributed by NM, 27-Dec-1993.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐴 = 𝐶𝐵 = 𝐶))

Theoremeqeq2 2092 Equality implies equivalence of equalities. (Contributed by NM, 5-Aug-1993.)
(𝐴 = 𝐵 → (𝐶 = 𝐴𝐶 = 𝐵))

Theoremeqeq2i 2093 Inference from equality to equivalence of equalities. (Contributed by NM, 5-Aug-1993.)
𝐴 = 𝐵       (𝐶 = 𝐴𝐶 = 𝐵)

Theoremeqeq2d 2094 Deduction from equality to equivalence of equalities. (Contributed by NM, 27-Dec-1993.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐶 = 𝐴𝐶 = 𝐵))

Theoremeqeq12 2095 Equality relationship among 4 classes. (Contributed by NM, 3-Aug-1994.)
((𝐴 = 𝐵𝐶 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷))

Theoremeqeq12i 2096 A useful inference for substituting definitions into an equality. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)
𝐴 = 𝐵    &   𝐶 = 𝐷       (𝐴 = 𝐶𝐵 = 𝐷)

Theoremeqeq12d 2097 A useful inference for substituting definitions into an equality. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)
(𝜑𝐴 = 𝐵)    &   (𝜑𝐶 = 𝐷)       (𝜑 → (𝐴 = 𝐶𝐵 = 𝐷))

Theoremeqeqan12d 2098 A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)
(𝜑𝐴 = 𝐵)    &   (𝜓𝐶 = 𝐷)       ((𝜑𝜓) → (𝐴 = 𝐶𝐵 = 𝐷))

Theoremeqeqan12rd 2099 A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.)
(𝜑𝐴 = 𝐵)    &   (𝜓𝐶 = 𝐷)       ((𝜓𝜑) → (𝐴 = 𝐶𝐵 = 𝐷))

Theoremeqtr 2100 Transitive law for class equality. Proposition 4.7(3) of [TakeutiZaring] p. 13. (Contributed by NM, 25-Jan-2004.)
((𝐴 = 𝐵𝐵 = 𝐶) → 𝐴 = 𝐶)

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