Home | Intuitionistic Logic Explorer Theorem List (p. 17 of 108) | < 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 | ||
Theorem | nf4r 1601 | If is always true or always false, then variable is effectively not free in . The converse holds given a decidability condition, as seen at nf4dc 1600. (Contributed by Jim Kingdon, 21-Jul-2018.) |
Theorem | 19.36i 1602 | Inference from Theorem 19.36 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 2-Feb-2015.) |
Theorem | 19.36-1 1603 | Closed form of 19.36i 1602. One direction of Theorem 19.36 of [Margaris] p. 90. The converse holds in classical logic, but does not hold (for all propositions) in intuitionistic logic. (Contributed by Jim Kingdon, 20-Jun-2018.) |
Theorem | 19.37-1 1604 | One direction of Theorem 19.37 of [Margaris] p. 90. The converse holds in classical logic but not, in general, here. (Contributed by Jim Kingdon, 21-Jun-2018.) |
Theorem | 19.37aiv 1605* | Inference from Theorem 19.37 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | 19.38 1606 | Theorem 19.38 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | 19.23t 1607 | Closed form of Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 7-Nov-2005.) (Proof shortened by Wolf Lammen, 2-Jan-2018.) |
Theorem | 19.23 1608 | Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 24-Sep-2016.) |
Theorem | 19.32dc 1609 | Theorem 19.32 of [Margaris] p. 90, where is decidable. (Contributed by Jim Kingdon, 4-Jun-2018.) |
DECID | ||
Theorem | 19.32r 1610 | One direction of Theorem 19.32 of [Margaris] p. 90. The converse holds if is decidable, as seen at 19.32dc 1609. (Contributed by Jim Kingdon, 28-Jul-2018.) |
Theorem | 19.31r 1611 | One direction of Theorem 19.31 of [Margaris] p. 90. The converse holds in classical logic, but not intuitionistic logic. (Contributed by Jim Kingdon, 28-Jul-2018.) |
Theorem | 19.44 1612 | Theorem 19.44 of [Margaris] p. 90. (Contributed by NM, 12-Mar-1993.) |
Theorem | 19.45 1613 | Theorem 19.45 of [Margaris] p. 90. (Contributed by NM, 12-Mar-1993.) |
Theorem | 19.34 1614 | Theorem 19.34 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) |
Theorem | 19.41h 1615 | Theorem 19.41 of [Margaris] p. 90. New proofs should use 19.41 1616 instead. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (New usage is discouraged.) |
Theorem | 19.41 1616 | Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 12-Jan-2018.) |
Theorem | 19.42h 1617 | Theorem 19.42 of [Margaris] p. 90. New proofs should use 19.42 1618 instead. (Contributed by NM, 18-Aug-1993.) (New usage is discouraged.) |
Theorem | 19.42 1618 | Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 18-Aug-1993.) |
Theorem | excom13 1619 | Swap 1st and 3rd existential quantifiers. (Contributed by NM, 9-Mar-1995.) |
Theorem | exrot3 1620 | Rotate existential quantifiers. (Contributed by NM, 17-Mar-1995.) |
Theorem | exrot4 1621 | Rotate existential quantifiers twice. (Contributed by NM, 9-Mar-1995.) |
Theorem | nexr 1622 | Inference from 19.8a 1522. (Contributed by Jeff Hankins, 26-Jul-2009.) |
Theorem | exan 1623 | Place a conjunct in the scope of an existential quantifier. (Contributed by NM, 18-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | hbexd 1624 | Deduction form of bound-variable hypothesis builder hbex 1567. (Contributed by NM, 2-Jan-2002.) |
Theorem | eeor 1625 | Rearrange existential quantifiers. (Contributed by NM, 8-Aug-1994.) |
Theorem | a9e 1626 | At least one individual exists. This is not a theorem of free logic, which is sound in empty domains. For such a logic, we would add this theorem as an axiom of set theory (Axiom 0 of [Kunen] p. 10). In the system consisting of ax-5 1376 through ax-14 1445 and ax-17 1459, all axioms other than ax-9 1464 are believed to be theorems of free logic, although the system without ax-9 1464 is probably not complete in free logic. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 3-Feb-2015.) |
Theorem | a9ev 1627* | At least one individual exists. Weaker version of a9e 1626. (Contributed by NM, 3-Aug-2017.) |
Theorem | ax9o 1628 | An implication related to substitution. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 3-Feb-2015.) |
Theorem | equid 1629 |
Identity law for equality (reflexivity). Lemma 6 of [Tarski] p. 68.
This is often an axiom of equality in textbook systems, but we don't
need it as an axiom since it can be proved from our other axioms.
This proof is similar to Tarski's and makes use of a dummy variable . It also works in intuitionistic logic, unlike some other possible ways of proving this theorem. (Contributed by NM, 1-Apr-2005.) |
Theorem | nfequid 1630 | Bound-variable hypothesis builder for . This theorem tells us that any variable, including , is effectively not free in , even though is technically free according to the traditional definition of free variable. (Contributed by NM, 13-Jan-2011.) (Revised by NM, 21-Aug-2017.) |
Theorem | stdpc6 1631 | One of the two equality axioms of standard predicate calculus, called reflexivity of equality. (The other one is stdpc7 1693.) Axiom 6 of [Mendelson] p. 95. Mendelson doesn't say why he prepended the redundant quantifier, but it was probably to be compatible with free logic (which is valid in the empty domain). (Contributed by NM, 16-Feb-2005.) |
Theorem | equcomi 1632 | Commutative law for equality. Lemma 7 of [Tarski] p. 69. (Contributed by NM, 5-Aug-1993.) |
Theorem | equcom 1633 | Commutative law for equality. (Contributed by NM, 20-Aug-1993.) |
Theorem | equcoms 1634 | An inference commuting equality in antecedent. Used to eliminate the need for a syllogism. (Contributed by NM, 5-Aug-1993.) |
Theorem | equtr 1635 | A transitive law for equality. (Contributed by NM, 23-Aug-1993.) |
Theorem | equtrr 1636 | A transitive law for equality. Lemma L17 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 23-Aug-1993.) |
Theorem | equtr2 1637 | A transitive law for equality. (Contributed by NM, 12-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | equequ1 1638 | An equivalence law for equality. (Contributed by NM, 5-Aug-1993.) |
Theorem | equequ2 1639 | An equivalence law for equality. (Contributed by NM, 5-Aug-1993.) |
Theorem | elequ1 1640 | An identity law for the non-logical predicate. (Contributed by NM, 5-Aug-1993.) |
Theorem | elequ2 1641 | An identity law for the non-logical predicate. (Contributed by NM, 5-Aug-1993.) |
Theorem | ax11i 1642 | Inference that has ax-11 1437 (without ) as its conclusion and doesn't require ax-10 1436, ax-11 1437, or ax-12 1442 for its proof. The hypotheses may be eliminable without one or more of these axioms in special cases. Proof similar to Lemma 16 of [Tarski] p. 70. (Contributed by NM, 20-May-2008.) |
Theorem | ax10o 1643 |
Show that ax-10o 1644 can be derived from ax-10 1436. An open problem is
whether this theorem can be derived from ax-10 1436 and the others when
ax-11 1437 is replaced with ax-11o 1744. See theorem ax10 1645
for the
rederivation of ax-10 1436 from ax10o 1643.
Normally, ax10o 1643 should be used rather than ax-10o 1644, except by theorems specifically studying the latter's properties. (Contributed by NM, 16-May-2008.) |
Axiom | ax-10o 1644 |
Axiom ax-10o 1644 ("o" for "old") was the
original version of ax-10 1436,
before it was discovered (in May 2008) that the shorter ax-10 1436 could
replace it. It appears as Axiom scheme C11' in [Megill] p. 448 (p. 16 of
the preprint).
This axiom is redundant, as shown by theorem ax10o 1643. Normally, ax10o 1643 should be used rather than ax-10o 1644, except by theorems specifically studying the latter's properties. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.) |
Theorem | ax10 1645 |
Rederivation of ax-10 1436 from original version ax-10o 1644. See theorem
ax10o 1643 for the derivation of ax-10o 1644 from ax-10 1436.
This theorem should not be referenced in any proof. Instead, use ax-10 1436 above so that uses of ax-10 1436 can be more easily identified. (Contributed by NM, 16-May-2008.) (New usage is discouraged.) |
Theorem | hbae 1646 | All variables are effectively bound in an identical variable specifier. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 3-Feb-2015.) |
Theorem | nfae 1647 | All variables are effectively bound in an identical variable specifier. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Theorem | hbaes 1648 | Rule that applies hbae 1646 to antecedent. (Contributed by NM, 5-Aug-1993.) |
Theorem | hbnae 1649 | All variables are effectively bound in a distinct variable specifier. Lemma L19 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 5-Aug-1993.) |
Theorem | nfnae 1650 | All variables are effectively bound in a distinct variable specifier. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Theorem | hbnaes 1651 | Rule that applies hbnae 1649 to antecedent. (Contributed by NM, 5-Aug-1993.) |
Theorem | naecoms 1652 | A commutation rule for distinct variable specifiers. (Contributed by NM, 2-Jan-2002.) |
Theorem | equs4 1653 | Lemma used in proofs of substitution properties. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Mario Carneiro, 20-May-2014.) |
Theorem | equsalh 1654 | A useful equivalence related to substitution. New proofs should use equsal 1655 instead. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (New usage is discouraged.) |
Theorem | equsal 1655 | A useful equivalence related to substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof shortened by Wolf Lammen, 5-Feb-2018.) |
Theorem | equsex 1656 | A useful equivalence related to substitution. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 3-Feb-2015.) |
Theorem | equsexd 1657 | Deduction form of equsex 1656. (Contributed by Jim Kingdon, 29-Dec-2017.) |
Theorem | dral1 1658 | 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, 24-Nov-1994.) |
Theorem | dral2 1659 | 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 | drex2 1660 | 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 | drnf1 1661 | Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.) |
Theorem | drnf2 1662 | Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.) |
Theorem | spimth 1663 | Closed theorem form of spim 1666. (Contributed by NM, 15-Jan-2008.) (New usage is discouraged.) |
Theorem | spimt 1664 | Closed theorem form of spim 1666. (Contributed by NM, 15-Jan-2008.) (Revised by Mario Carneiro, 17-Oct-2016.) (Proof shortened by Wolf Lammen, 24-Feb-2018.) |
Theorem | spimh 1665 | Specialization, using implicit substitition. Compare Lemma 14 of [Tarski] p. 70. The spim 1666 series of theorems requires that only one direction of the substitution hypothesis hold. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 8-May-2008.) (New usage is discouraged.) |
Theorem | spim 1666 | Specialization, using implicit substitution. Compare Lemma 14 of [Tarski] p. 70. The spim 1666 series of theorems requires that only one direction of the substitution hypothesis hold. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.) |
Theorem | spimeh 1667 | Existential introduction, using implicit substitition. Compare Lemma 14 of [Tarski] p. 70. (Contributed by NM, 7-Aug-1994.) (Revised by NM, 3-Feb-2015.) (New usage is discouraged.) |
Theorem | spimed 1668 | Deduction version of spime 1669. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof shortened by Wolf Lammen, 19-Feb-2018.) |
Theorem | spime 1669 | Existential introduction, using implicit substitution. Compare Lemma 14 of [Tarski] p. 70. (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof shortened by Wolf Lammen, 6-Mar-2018.) |
Theorem | cbv3 1670 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-May-2018.) |
Theorem | cbv3h 1671 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 12-May-2018.) |
Theorem | cbv1 1672 | Rule used to change bound variables, using implicit substitution. Revised to format hypotheses to common style. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) (Revised by Wolf Lammen, 13-May-2018.) |
Theorem | cbv1h 1673 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-May-2018.) |
Theorem | cbv2h 1674 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | cbv2 1675 | Rule used to change bound variables, using implicit substitution. Revised to align format of hypotheses to common style. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) (Revised by Wolf Lammen, 13-May-2018.) |
Theorem | cbvalh 1676 | Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | cbval 1677 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) |
Theorem | cbvexh 1678 | Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Feb-2015.) |
Theorem | cbvex 1679 | Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | chvar 1680 | Implicit substitution of for into a theorem. (Contributed by Raph Levien, 9-Jul-2003.) (Revised by Mario Carneiro, 3-Oct-2016.) |
Theorem | equvini 1681 | A variable introduction law for equality. Lemma 15 of [Monk2] p. 109, however we do not require to be distinct from and (making the proof longer). (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Theorem | equveli 1682 | A variable elimination law for equality with no distinct variable requirements. (Compare equvini 1681.) (Contributed by NM, 1-Mar-2013.) (Revised by NM, 3-Feb-2015.) |
Theorem | nfald 1683 | If is not free in , it is not free in . (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 6-Jan-2018.) |
Theorem | nfexd 1684 | If is not free in , it is not free in . (Contributed by Mario Carneiro, 24-Sep-2016.) (Proof rewritten by Jim Kingdon, 7-Feb-2018.) |
Syntax | wsb 1685 | Extend wff definition to include proper substitution (read "the wff that results when is properly substituted for in wff "). (Contributed by NM, 24-Jan-2006.) |
Definition | df-sb 1686 |
Define proper substitution. Remark 9.1 in [Megill] p. 447 (p. 15 of the
preprint). For our notation, we use to mean "the wff
that results when
is properly substituted for in the wff
." We
can also use in
place of the "free for"
side condition used in traditional predicate calculus; see, for example,
stdpc4 1698.
Our notation was introduced in Haskell B. Curry's Foundations of Mathematical Logic (1977), p. 316 and is frequently used in textbooks of lambda calculus and combinatory logic. This notation improves the common but ambiguous notation, " is the wff that results when is properly substituted for in ." For example, if the original is , then is , from which we obtain that is . So what exactly does mean? Curry's notation solves this problem. In most books, proper substitution has a somewhat complicated recursive definition with multiple cases based on the occurrences of free and bound variables in the wff. Instead, we use a single formula that is exactly equivalent and gives us a direct definition. We later prove that our definition has the properties we expect of proper substitution (see theorems sbequ 1761, sbcom2 1904 and sbid2v 1913). Note that our definition is valid even when and are replaced with the same variable, as sbid 1697 shows. We achieve this by having free in the first conjunct and bound in the second. We can also achieve this by using a dummy variable, as the alternate definition dfsb7 1908 shows (which some logicians may prefer because it doesn't mix free and bound variables). Another alternate definition which uses a dummy variable is dfsb7a 1911. When and are distinct, we can express proper substitution with the simpler expressions of sb5 1808 and sb6 1807. In classical logic, another possible definition is but we do not have an intuitionistic proof that this is equivalent. There are no restrictions on any of the variables, including what variables may occur in wff . (Contributed by NM, 5-Aug-1993.) |
Theorem | sbimi 1687 | Infer substitution into antecedent and consequent of an implication. (Contributed by NM, 25-Jun-1998.) |
Theorem | sbbii 1688 | Infer substitution into both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) |
Theorem | sb1 1689 | One direction of a simplified definition of substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sb2 1690 | One direction of a simplified definition of substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbequ1 1691 | An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbequ2 1692 | An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | stdpc7 1693 | One of the two equality axioms of standard predicate calculus, called substitutivity of equality. (The other one is stdpc6 1631.) Translated to traditional notation, it can be read: " , , , provided that is free for in , ." Axiom 7 of [Mendelson] p. 95. (Contributed by NM, 15-Feb-2005.) |
Theorem | sbequ12 1694 | An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbequ12r 1695 | An equality theorem for substitution. (Contributed by NM, 6-Oct-2004.) (Proof shortened by Andrew Salmon, 21-Jun-2011.) |
Theorem | sbequ12a 1696 | An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbid 1697 | An identity theorem for substitution. Remark 9.1 in [Megill] p. 447 (p. 15 of the preprint). (Contributed by NM, 5-Aug-1993.) |
Theorem | stdpc4 1698 | The specialization axiom of standard predicate calculus. It states that if a statement holds for all , then it also holds for the specific case of (properly) substituted for . Translated to traditional notation, it can be read: " , provided that is free for in ." Axiom 4 of [Mendelson] p. 69. (Contributed by NM, 5-Aug-1993.) |
Theorem | sbh 1699 | Substitution for a variable not free in a wff does not affect it. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 17-Oct-2004.) |
Theorem | sbf 1700 | Substitution for a variable not free in a wff does not affect it. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |