Home | Intuitionistic Logic Explorer Theorem List (p. 18 of 94) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Axiom | ax-11o 1701 |
Axiom ax-11o 1701 ("o" for "old") was the
original version of ax-11 1394,
before it was discovered (in Jan. 2007) that the shorter ax-11 1394 could
replace it. It appears as Axiom scheme C15' in [Megill] p. 448 (p. 16 of
the preprint). It is based on Lemma 16 of [Tarski] p. 70 and Axiom C8 of
[Monk2] p. 105, from which it can be proved
by cases. To understand this
theorem more easily, think of " ..." as informally
meaning "if
and are distinct
variables then..." The
antecedent becomes false if the same variable is substituted for and
, ensuring the
theorem is sound whenever this is the case. In some
later theorems, we call an antecedent of the form a
"distinctor."
This axiom is redundant, as shown by theorem ax11o 1700. This axiom is obsolete and should no longer be used. It is proved above as theorem ax11o 1700. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.) |
Theorem | albidv 1702* | Formula-building rule for universal quantifier (deduction rule). (Contributed by NM, 5-Aug-1993.) |
Theorem | exbidv 1703* | Formula-building rule for existential quantifier (deduction rule). (Contributed by NM, 5-Aug-1993.) |
Theorem | ax11b 1704 | A bidirectional version of ax-11o 1701. (Contributed by NM, 30-Jun-2006.) |
Theorem | ax11v 1705* | This is a version of ax-11o 1701 when the variables are distinct. Axiom (C8) of [Monk2] p. 105. (Contributed by NM, 5-Aug-1993.) (Revised by Jim Kingdon, 15-Dec-2017.) |
Theorem | ax11ev 1706* | Analogue to ax11v 1705 for existential quantification. (Contributed by Jim Kingdon, 9-Jan-2018.) |
Theorem | equs5 1707 | Lemma used in proofs of substitution properties. (Contributed by NM, 5-Aug-1993.) |
Theorem | equs5or 1708 | Lemma used in proofs of substitution properties. Like equs5 1707 but, in intuitionistic logic, replacing negation and implication with disjunction makes this a stronger result. (Contributed by Jim Kingdon, 2-Feb-2018.) |
Theorem | sb3 1709 | One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.) |
Theorem | sb4 1710 | One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.) |
Theorem | sb4or 1711 | One direction of a simplified definition of substitution when variables are distinct. Similar to sb4 1710 but stronger in intuitionistic logic. (Contributed by Jim Kingdon, 2-Feb-2018.) |
Theorem | sb4b 1712 | Simplified definition of substitution when variables are distinct. (Contributed by NM, 27-May-1997.) |
Theorem | sb4bor 1713 | Simplified definition of substitution when variables are distinct, expressed via disjunction. (Contributed by Jim Kingdon, 18-Mar-2018.) |
Theorem | hbsb2 1714 | Bound-variable hypothesis builder for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | nfsb2or 1715 | Bound-variable hypothesis builder for substitution. Similar to hbsb2 1714 but in intuitionistic logic a disjunction is stronger than an implication. (Contributed by Jim Kingdon, 2-Feb-2018.) |
Theorem | sbequilem 1716 | Propositional logic lemma used in the sbequi 1717 proof. (Contributed by Jim Kingdon, 1-Feb-2018.) |
Theorem | sbequi 1717 | An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) (Proof modified by Jim Kingdon, 1-Feb-2018.) |
Theorem | sbequ 1718 | An equality theorem for substitution. Used in proof of Theorem 9.7 in [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 5-Aug-1993.) |
Theorem | drsb2 1719 | Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 27-Feb-2005.) |
Theorem | spsbe 1720 | A specialization theorem, mostly the same as Theorem 19.8 of [Margaris] p. 89. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 29-Dec-2017.) |
Theorem | spsbim 1721 | Specialization of implication. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.) |
Theorem | spsbbi 1722 | Specialization of biconditional. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.) |
Theorem | sbbid 1723 | Deduction substituting both sides of a biconditional. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbequ8 1724 | Elimination of equality from antecedent after substitution. (Contributed by NM, 5-Aug-1993.) (Proof revised by Jim Kingdon, 20-Jan-2018.) |
Theorem | sbft 1725 | Substitution has no effect on a non-free variable. (Contributed by NM, 30-May-2009.) (Revised by Mario Carneiro, 12-Oct-2016.) (Proof shortened by Wolf Lammen, 3-May-2018.) |
Theorem | sbid2h 1726 | An identity law for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbid2 1727 | An identity law for substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.) |
Theorem | sbidm 1728 | An idempotent law for substitution. (Contributed by NM, 30-Jun-1994.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.) |
Theorem | sb5rf 1729 | Reversed substitution. (Contributed by NM, 3-Feb-2005.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | sb6rf 1730 | Reversed substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | sb8h 1731 | Substitution of variable in universal quantifier. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Jim Kingdon, 15-Jan-2018.) |
Theorem | sb8eh 1732 | Substitution of variable in existential quantifier. (Contributed by NM, 12-Aug-1993.) (Proof rewritten by Jim Kingdon, 15-Jan-2018.) |
Theorem | sb8 1733 | Substitution of variable in universal quantifier. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Jim Kingdon, 15-Jan-2018.) |
Theorem | sb8e 1734 | Substitution of variable in existential quantifier. (Contributed by NM, 12-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Jim Kingdon, 15-Jan-2018.) |
Theorem | ax16i 1735* | Inference with ax-16 1692 as its conclusion, that doesn't require ax-10 1393, ax-11 1394, or ax-12 1399 for its proof. The hypotheses may be eliminable without one or more of these axioms in special cases. (Contributed by NM, 20-May-2008.) |
Theorem | ax16ALT 1736* | Version of ax16 1691 that doesn't require ax-10 1393 or ax-12 1399 for its proof. (Contributed by NM, 17-May-2008.) (Proof modification is discouraged.) (New usage is discouraged.) |
Theorem | spv 1737* | Specialization, using implicit substitition. (Contributed by NM, 30-Aug-1993.) |
Theorem | spimev 1738* | Distinct-variable version of spime 1626. (Contributed by NM, 5-Aug-1993.) |
Theorem | speiv 1739* | Inference from existential specialization, using implicit substitition. (Contributed by NM, 19-Aug-1993.) |
Theorem | equvin 1740* | A variable introduction law for equality. Lemma 15 of [Monk2] p. 109. (Contributed by NM, 5-Aug-1993.) |
Theorem | a16g 1741* | A generalization of axiom ax-16 1692. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | a16gb 1742* | A generalization of axiom ax-16 1692. (Contributed by NM, 5-Aug-1993.) |
Theorem | a16nf 1743* | If there is only one element in the universe, then everything satisfies . (Contributed by Mario Carneiro, 7-Oct-2016.) |
Theorem | 2albidv 1744* | Formula-building rule for 2 existential quantifiers (deduction rule). (Contributed by NM, 4-Mar-1997.) |
Theorem | 2exbidv 1745* | Formula-building rule for 2 existential quantifiers (deduction rule). (Contributed by NM, 1-May-1995.) |
Theorem | 3exbidv 1746* | Formula-building rule for 3 existential quantifiers (deduction rule). (Contributed by NM, 1-May-1995.) |
Theorem | 4exbidv 1747* | Formula-building rule for 4 existential quantifiers (deduction rule). (Contributed by NM, 3-Aug-1995.) |
Theorem | 19.9v 1748* | Special case of Theorem 19.9 of [Margaris] p. 89. (Contributed by NM, 28-May-1995.) (Revised by NM, 21-May-2007.) |
Theorem | exlimdd 1749 | Existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.) |
Theorem | 19.21v 1750* | Special case of Theorem 19.21 of [Margaris] p. 90. Notational convention: We sometimes suffix with "v" the label of a theorem eliminating a hypothesis such as in 19.21 1472 via the use of distinct variable conditions combined with ax-17 1416. Conversely, we sometimes suffix with "f" the label of a theorem introducing such a hypothesis to eliminate the need for the distinct variable condition; e.g. euf 1902 derived from df-eu 1900. The "f" stands for "not free in" which is less restrictive than "does not occur in." (Contributed by NM, 5-Aug-1993.) |
Theorem | alrimiv 1751* | Inference from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | alrimivv 1752* | Inference from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 31-Jul-1995.) |
Theorem | alrimdv 1753* | Deduction from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 10-Feb-1997.) |
Theorem | nfdv 1754* | Apply the definition of not-free in a context. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Theorem | 2ax17 1755* | Quantification of two variables over a formula in which they do not occur. (Contributed by Alan Sare, 12-Apr-2011.) |
Theorem | alimdv 1756* | Deduction from Theorem 19.20 of [Margaris] p. 90. (Contributed by NM, 3-Apr-1994.) |
Theorem | eximdv 1757* | Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 27-Apr-1994.) |
Theorem | 2alimdv 1758* | Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 27-Apr-2004.) |
Theorem | 2eximdv 1759* | Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 3-Aug-1995.) |
Theorem | 19.23v 1760* | Special case of Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 28-Jun-1998.) |
Theorem | 19.23vv 1761* | Theorem 19.23 of [Margaris] p. 90 extended to two variables. (Contributed by NM, 10-Aug-2004.) |
Theorem | sb56 1762* | Two equivalent ways of expressing the proper substitution of for in , when and are distinct. Theorem 6.2 of [Quine] p. 40. The proof does not involve df-sb 1643. (Contributed by NM, 14-Apr-2008.) |
Theorem | sb6 1763* | Equivalence for substitution. Compare Theorem 6.2 of [Quine] p. 40. Also proved as Lemmas 16 and 17 of [Tarski] p. 70. (Contributed by NM, 18-Aug-1993.) (Revised by NM, 14-Apr-2008.) |
Theorem | sb5 1764* | Equivalence for substitution. Similar to Theorem 6.1 of [Quine] p. 40. (Contributed by NM, 18-Aug-1993.) (Revised by NM, 14-Apr-2008.) |
Theorem | sbnv 1765* | Version of sbn 1823 where and are distinct. (Contributed by Jim Kingdon, 18-Dec-2017.) |
Theorem | sbanv 1766* | Version of sban 1826 where and are distinct. (Contributed by Jim Kingdon, 24-Dec-2017.) |
Theorem | sborv 1767* | Version of sbor 1825 where and are distinct. (Contributed by Jim Kingdon, 3-Feb-2018.) |
Theorem | sbi1v 1768* | Forward direction of sbimv 1770. (Contributed by Jim Kingdon, 25-Dec-2017.) |
Theorem | sbi2v 1769* | Reverse direction of sbimv 1770. (Contributed by Jim Kingdon, 18-Jan-2018.) |
Theorem | sbimv 1770* | Intuitionistic proof of sbim 1824 where and are distinct. (Contributed by Jim Kingdon, 18-Jan-2018.) |
Theorem | sblimv 1771* | Version of sblim 1828 where and are distinct. (Contributed by Jim Kingdon, 19-Jan-2018.) |
Theorem | pm11.53 1772* | Theorem *11.53 in [WhiteheadRussell] p. 164. (Contributed by Andrew Salmon, 24-May-2011.) |
Theorem | exlimivv 1773* | Inference from Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 1-Aug-1995.) |
Theorem | exlimdvv 1774* | Deduction from Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 31-Jul-1995.) |
Theorem | exlimddv 1775* | Existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 15-Jun-2016.) |
Theorem | 19.27v 1776* | Theorem 19.27 of [Margaris] p. 90. (Contributed by NM, 3-Jun-2004.) |
Theorem | 19.28v 1777* | Theorem 19.28 of [Margaris] p. 90. (Contributed by NM, 25-Mar-2004.) |
Theorem | 19.36aiv 1778* | Inference from Theorem 19.36 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | 19.41v 1779* | Special case of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | 19.41vv 1780* | Theorem 19.41 of [Margaris] p. 90 with 2 quantifiers. (Contributed by NM, 30-Apr-1995.) |
Theorem | 19.41vvv 1781* | Theorem 19.41 of [Margaris] p. 90 with 3 quantifiers. (Contributed by NM, 30-Apr-1995.) |
Theorem | 19.41vvvv 1782* | Theorem 19.41 of [Margaris] p. 90 with 4 quantifiers. (Contributed by FL, 14-Jul-2007.) |
Theorem | 19.42v 1783* | Special case of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | exdistr 1784* | Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.) |
Theorem | 19.42vv 1785* | Theorem 19.42 of [Margaris] p. 90 with 2 quantifiers. (Contributed by NM, 16-Mar-1995.) |
Theorem | 19.42vvv 1786* | Theorem 19.42 of [Margaris] p. 90 with 3 quantifiers. (Contributed by NM, 21-Sep-2011.) |
Theorem | 19.42vvvv 1787* | Theorem 19.42 of [Margaris] p. 90 with 4 quantifiers. (Contributed by Jim Kingdon, 23-Nov-2019.) |
Theorem | exdistr2 1788* | Distribution of existential quantifiers. (Contributed by NM, 17-Mar-1995.) |
Theorem | 3exdistr 1789* | Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | 4exdistr 1790* | Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.) |
Theorem | cbvalv 1791* | Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) |
Theorem | cbvexv 1792* | Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) |
Theorem | cbval2 1793* | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 22-Dec-2003.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Wolf Lammen, 22-Apr-2018.) |
Theorem | cbvex2 1794* | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 14-Sep-2003.) (Revised by Mario Carneiro, 6-Oct-2016.) |
Theorem | cbval2v 1795* | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 4-Feb-2005.) |
Theorem | cbvex2v 1796* | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.) |
Theorem | cbvald 1797* | Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1890. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Revised by Wolf Lammen, 13-May-2018.) |
Theorem | cbvexdh 1798* | Deduction used to change bound variables, using implicit substitition, particularly useful in conjunction with dvelim 1890. (Contributed by NM, 2-Jan-2002.) (Proof rewritten by Jim Kingdon, 30-Dec-2017.) |
Theorem | cbvexd 1799* | Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1890. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.) |
Theorem | cbvaldva 1800* | Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |