P. 19 of Theorem List - Intuitionistic Logic Explorer

Home	Intuitionistic Logic Explorer Theorem List (p. 19 of 140)	< 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 -** 1801-1900 *Has distinct variable group(s)
Type	Label	Description
Statement

Theorem	ax16 1801*	Theorem showing that ax-16 1802 is redundant if ax-17 1514 is included in the axiom system. The important part of the proof is provided by aev 1800. See ax16ALT 1847 for an alternate proof that does not require ax-10 1493 or ax12 1500. This theorem should not be referenced in any proof. Instead, use ax-16 1802 below so that theorems needing ax-16 1802 can be more easily identified. (Contributed by NM, 8-Nov-2006.)


Axiom	ax-16 1802*	Axiom of Distinct Variables. The only axiom of predicate calculus requiring that variables be distinct (if we consider ax-17 1514 to be a metatheorem and not an axiom). Axiom scheme C16' in [Megill] p. 448 (p. 16 of the preprint). It apparently does not otherwise appear in the literature but is easily proved from textbook predicate calculus by cases. It is a somewhat bizarre axiom since the antecedent is always false in set theory, but nonetheless it is technically necessary as you can see from its uses. This axiom is redundant if we include ax-17 1514; see Theorem ax16 1801. This axiom is obsolete and should no longer be used. It is proved above as Theorem ax16 1801. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.)


Theorem	dveeq2 1803*	Quantifier introduction when one pair of variables is distinct. (Contributed by NM, 2-Jan-2002.)


Theorem	dveeq2or 1804*	Quantifier introduction when one pair of variables is distinct. Like dveeq2 1803 but connecting by a disjunction rather than negation and implication makes the theorem stronger in intuitionistic logic. (Contributed by Jim Kingdon, 1-Feb-2018.)
$\/$

Theorem	dvelimfALT2 1805*	Proof of dvelimf 2003 using dveeq2 1803 (shown as the last hypothesis) instead of ax12 1500. This shows that ax12 1500 could be replaced by dveeq2 1803 (the last hypothesis). (Contributed by Andrew Salmon, 21-Jul-2011.)


Theorem	nd5 1806*	A lemma for proving conditionless ZFC axioms. (Contributed by NM, 8-Jan-2002.)


Theorem	exlimdv 1807*	Deduction from Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 27-Apr-1994.)


Theorem	ax11v2 1808*	Recovery of ax11o 1810 from ax11v 1815 without using ax-11 1494. The hypothesis is even weaker than ax11v 1815, with both distinct from and not occurring in . Thus the hypothesis provides an alternate axiom that can be used in place of ax11o 1810. (Contributed by NM, 2-Feb-2007.)


Theorem	ax11a2 1809*	Derive ax-11o 1811 from a hypothesis in the form of ax-11 1494. The hypothesis is even weaker than ax-11 1494, with both distinct from and not occurring in . Thus the hypothesis provides an alternate axiom that can be used in place of ax11o 1810. (Contributed by NM, 2-Feb-2007.)


1.4.2 Derive the obsolete axiom of variable substitution ax-11o

Theorem	ax11o 1810	Derivation of set.mm's original ax-11o 1811 from the shorter ax-11 1494 that has replaced it. An open problem is whether this theorem can be proved without relying on ax-16 1802 or ax-17 1514. Normally, ax11o 1810 should be used rather than ax-11o 1811, except by theorems specifically studying the latter's properties. (Contributed by NM, 3-Feb-2007.)


Axiom	ax-11o 1811	Axiom ax-11o 1811 ("o" for "old") was the original version of ax-11 1494, before it was discovered (in Jan. 2007) that the shorter ax-11 1494 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 1810. This axiom is obsolete and should no longer be used. It is proved above as Theorem ax11o 1810. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.)


1.4.3 More theorems related to ax-11 and substitution

Theorem	albidv 1812*	Formula-building rule for universal quantifier (deduction form). (Contributed by NM, 5-Aug-1993.)


Theorem	exbidv 1813*	Formula-building rule for existential quantifier (deduction form). (Contributed by NM, 5-Aug-1993.)


Theorem	ax11b 1814	A bidirectional version of ax-11o 1811. (Contributed by NM, 30-Jun-2006.)
$/\$

Theorem	ax11v 1815*	This is a version of ax-11o 1811 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 1816*	Analogue to ax11v 1815 for existential quantification. (Contributed by Jim Kingdon, 9-Jan-2018.)
$/\$

Theorem	equs5 1817	Lemma used in proofs of substitution properties. (Contributed by NM, 5-Aug-1993.)
$/\$

Theorem	equs5or 1818	Lemma used in proofs of substitution properties. Like equs5 1817 but, in intuitionistic logic, replacing negation and implication with disjunction makes this a stronger result. (Contributed by Jim Kingdon, 2-Feb-2018.)
$\/$ $/\$

Theorem	sb3 1819	One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.)
$/\$

Theorem	sb4 1820	One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.)


Theorem	sb4or 1821	One direction of a simplified definition of substitution when variables are distinct. Similar to sb4 1820 but stronger in intuitionistic logic. (Contributed by Jim Kingdon, 2-Feb-2018.)
$\/$

Theorem	sb4b 1822	Simplified definition of substitution when variables are distinct. (Contributed by NM, 27-May-1997.)


Theorem	sb4bor 1823	Simplified definition of substitution when variables are distinct, expressed via disjunction. (Contributed by Jim Kingdon, 18-Mar-2018.)
$\/$

Theorem	hbsb2 1824	Bound-variable hypothesis builder for substitution. (Contributed by NM, 5-Aug-1993.)


Theorem	nfsb2or 1825	Bound-variable hypothesis builder for substitution. Similar to hbsb2 1824 but in intuitionistic logic a disjunction is stronger than an implication. (Contributed by Jim Kingdon, 2-Feb-2018.)
$\/$

Theorem	sbequilem 1826	Propositional logic lemma used in the sbequi 1827 proof. (Contributed by Jim Kingdon, 1-Feb-2018.)
$\/$ $\/$ $\/$ $\/$

Theorem	sbequi 1827	An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.) (Proof modified by Jim Kingdon, 1-Feb-2018.)


Theorem	sbequ 1828	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 1829	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 1830	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 1831	Specialization of implication. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.)


Theorem	spsbbi 1832	Specialization of biconditional. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.)


Theorem	sbbidh 1833	Deduction substituting both sides of a biconditional. New proofs should use sbbid 1834 instead. (Contributed by NM, 5-Aug-1993.) (New usage is discouraged.)


Theorem	sbbid 1834	Deduction substituting both sides of a biconditional. (Contributed by NM, 30-Jun-1993.)


Theorem	sbequ8 1835	Elimination of equality from antecedent after substitution. (Contributed by NM, 5-Aug-1993.) (Proof revised by Jim Kingdon, 20-Jan-2018.)


Theorem	sbft 1836	Substitution has no effect on a nonfree variable. (Contributed by NM, 30-May-2009.) (Revised by Mario Carneiro, 12-Oct-2016.) (Proof shortened by Wolf Lammen, 3-May-2018.)


Theorem	sbid2h 1837	An identity law for substitution. (Contributed by NM, 5-Aug-1993.)


Theorem	sbid2 1838	An identity law for substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.)


Theorem	sbidm 1839	An idempotent law for substitution. (Contributed by NM, 30-Jun-1994.) (Proof rewritten by Jim Kingdon, 21-Jan-2018.)


Theorem	sb5rf 1840	Reversed substitution. (Contributed by NM, 3-Feb-2005.) (Proof shortened by Andrew Salmon, 25-May-2011.)
$/\$

Theorem	sb6rf 1841	Reversed substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)


Theorem	sb8h 1842	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 1843	Substitution of variable in existential quantifier. (Contributed by NM, 12-Aug-1993.) (Proof rewritten by Jim Kingdon, 15-Jan-2018.)


Theorem	sb8 1844	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 1845	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.)


1.4.4 Predicate calculus with distinct variables (cont.)

Theorem	ax16i 1846*	Inference with ax-16 1802 as its conclusion, that does not require ax-10 1493, ax-11 1494, or ax12 1500 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 1847*	Version of ax16 1801 that does not require ax-10 1493 or ax12 1500 for its proof. (Contributed by NM, 17-May-2008.) (Proof modification is discouraged.) (New usage is discouraged.)


Theorem	spv 1848*	Specialization, using implicit substitition. (Contributed by NM, 30-Aug-1993.)


Theorem	spimev 1849*	Distinct-variable version of spime 1729. (Contributed by NM, 5-Aug-1993.)


Theorem	speiv 1850*	Inference from existential specialization, using implicit substitition. (Contributed by NM, 19-Aug-1993.)


Theorem	equvin 1851*	A variable introduction law for equality. Lemma 15 of [Monk2] p. 109. (Contributed by NM, 5-Aug-1993.)
$/\$

Theorem	a16g 1852*	A generalization of Axiom ax-16 1802. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)


Theorem	a16gb 1853*	A generalization of Axiom ax-16 1802. (Contributed by NM, 5-Aug-1993.)


Theorem	a16nf 1854*	If there is only one element in the universe, then everything satisfies . (Contributed by Mario Carneiro, 7-Oct-2016.)


Theorem	2albidv 1855*	Formula-building rule for 2 existential quantifiers (deduction form). (Contributed by NM, 4-Mar-1997.)


Theorem	2exbidv 1856*	Formula-building rule for 2 existential quantifiers (deduction form). (Contributed by NM, 1-May-1995.)


Theorem	3exbidv 1857*	Formula-building rule for 3 existential quantifiers (deduction form). (Contributed by NM, 1-May-1995.)


Theorem	4exbidv 1858*	Formula-building rule for 4 existential quantifiers (deduction form). (Contributed by NM, 3-Aug-1995.)


Theorem	19.9v 1859*	Special case of Theorem 19.9 of [Margaris] p. 89. (Contributed by NM, 28-May-1995.) (Revised by NM, 21-May-2007.)


Theorem	exlimdd 1860	Existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.)
$/\$

Theorem	19.21v 1861*	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 1571 via the use of distinct variable conditions combined with ax-17 1514. 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 2019 derived from df-eu 2017. The "f" stands for "not free in" which is less restrictive than "does not occur in". (Contributed by NM, 5-Aug-1993.)


Theorem	alrimiv 1862*	Inference from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.)


Theorem	alrimivv 1863*	Inference from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 31-Jul-1995.)


Theorem	alrimdv 1864*	Deduction from Theorem 19.21 of [Margaris] p. 90. (Contributed by NM, 10-Feb-1997.)


Theorem	nfdv 1865*	Apply the definition of not-free in a context. (Contributed by Mario Carneiro, 11-Aug-2016.)


Theorem	2ax17 1866*	Quantification of two variables over a formula in which they do not occur. (Contributed by Alan Sare, 12-Apr-2011.)


Theorem	alimdv 1867*	Deduction from Theorem 19.20 of [Margaris] p. 90. (Contributed by NM, 3-Apr-1994.)


Theorem	eximdv 1868*	Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 27-Apr-1994.)


Theorem	2alimdv 1869*	Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 27-Apr-2004.)


Theorem	2eximdv 1870*	Deduction from Theorem 19.22 of [Margaris] p. 90. (Contributed by NM, 3-Aug-1995.)


Theorem	19.23v 1871*	Special case of Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 28-Jun-1998.)


Theorem	19.23vv 1872*	Theorem 19.23 of [Margaris] p. 90 extended to two variables. (Contributed by NM, 10-Aug-2004.)


Theorem	sb56 1873*	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 1751. (Contributed by NM, 14-Apr-2008.)
$/\$

Theorem	sb6 1874*	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 1875*	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 1876*	Version of sbn 1940 where and are distinct. (Contributed by Jim Kingdon, 18-Dec-2017.)


Theorem	sbanv 1877*	Version of sban 1943 where and are distinct. (Contributed by Jim Kingdon, 24-Dec-2017.)
$/\$ $/\$

Theorem	sborv 1878*	Version of sbor 1942 where and are distinct. (Contributed by Jim Kingdon, 3-Feb-2018.)
$\/$ $\/$

Theorem	sbi1v 1879*	Forward direction of sbimv 1881. (Contributed by Jim Kingdon, 25-Dec-2017.)


Theorem	sbi2v 1880*	Reverse direction of sbimv 1881. (Contributed by Jim Kingdon, 18-Jan-2018.)


Theorem	sbimv 1881*	Intuitionistic proof of sbim 1941 where and are distinct. (Contributed by Jim Kingdon, 18-Jan-2018.)


Theorem	sblimv 1882*	Version of sblim 1945 where and are distinct. (Contributed by Jim Kingdon, 19-Jan-2018.)


Theorem	pm11.53 1883*	Theorem *11.53 in [WhiteheadRussell] p. 164. (Contributed by Andrew Salmon, 24-May-2011.)


Theorem	exlimivv 1884*	Inference from Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 1-Aug-1995.)


Theorem	exlimdvv 1885*	Deduction from Theorem 19.23 of [Margaris] p. 90. (Contributed by NM, 31-Jul-1995.)


Theorem	exlimddv 1886*	Existential elimination rule of natural deduction. (Contributed by Mario Carneiro, 15-Jun-2016.)
$/\$

Theorem	19.27v 1887*	Theorem 19.27 of [Margaris] p. 90. (Contributed by NM, 3-Jun-2004.)
$/\$ $/\$

Theorem	19.28v 1888*	Theorem 19.28 of [Margaris] p. 90. (Contributed by NM, 25-Mar-2004.)
$/\$ $/\$

Theorem	19.36aiv 1889*	Inference from Theorem 19.36 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.)


Theorem	19.41v 1890*	Special case of Theorem 19.41 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.)
$/\$ $/\$

Theorem	19.41vv 1891*	Theorem 19.41 of [Margaris] p. 90 with 2 quantifiers. (Contributed by NM, 30-Apr-1995.)
$/\$ $/\$

Theorem	19.41vvv 1892*	Theorem 19.41 of [Margaris] p. 90 with 3 quantifiers. (Contributed by NM, 30-Apr-1995.)
$/\$ $/\$

Theorem	19.41vvvv 1893*	Theorem 19.41 of [Margaris] p. 90 with 4 quantifiers. (Contributed by FL, 14-Jul-2007.)
$/\$ $/\$

Theorem	19.42v 1894*	Special case of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.)
$/\$ $/\$

Theorem	spvv 1895*	Version of spv 1848 with a disjoint variable condition. (Contributed by BJ, 31-May-2019.)


Theorem	chvarvv 1896*	Version of chvarv 1925 with a disjoint variable condition. (Contributed by BJ, 31-May-2019.)


Theorem	exdistr 1897*	Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.)
$/\$ $/\$

Theorem	exdistrv 1898*	Distribute a pair of existential quantifiers (over disjoint variables) over a conjunction. Combination of 19.41v 1890 and 19.42v 1894. For a version with fewer disjoint variable conditions but requiring more axioms, see eeanv 1920. (Contributed by BJ, 30-Sep-2022.)
$/\$ $/\$

Theorem	19.42vv 1899*	Theorem 19.42 of [Margaris] p. 90 with 2 quantifiers. (Contributed by NM, 16-Mar-1995.)
$/\$ $/\$

Theorem	19.42vvv 1900*	Theorem 19.42 of [Margaris] p. 90 with 3 quantifiers. (Contributed by NM, 21-Sep-2011.)
$/\$ $/\$

< Previous Next >

Page List Jump to page: Contents 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-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-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-13970

< Previous Next >