Home Intuitionistic Logic ExplorerTheorem List (p. 19 of 106) < 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)
TypeLabelDescription
Statement

Theorem19.41vvvv 1801* Theorem 19.41 of [Margaris] p. 90 with 4 quantifiers. (Contributed by FL, 14-Jul-2007.)

Theorem19.42v 1802* Special case of Theorem 19.42 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.)

Theoremexdistr 1803* Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.)

Theorem19.42vv 1804* Theorem 19.42 of [Margaris] p. 90 with 2 quantifiers. (Contributed by NM, 16-Mar-1995.)

Theorem19.42vvv 1805* Theorem 19.42 of [Margaris] p. 90 with 3 quantifiers. (Contributed by NM, 21-Sep-2011.)

Theorem19.42vvvv 1806* Theorem 19.42 of [Margaris] p. 90 with 4 quantifiers. (Contributed by Jim Kingdon, 23-Nov-2019.)

Theoremexdistr2 1807* Distribution of existential quantifiers. (Contributed by NM, 17-Mar-1995.)

Theorem3exdistr 1808* Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem4exdistr 1809* Distribution of existential quantifiers. (Contributed by NM, 9-Mar-1995.)

Theoremcbvalv 1810* Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.)

Theoremcbvexv 1811* Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.)

Theoremcbval2 1812* 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.)

Theoremcbvex2 1813* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 14-Sep-2003.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremcbval2v 1814* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 4-Feb-2005.)

Theoremcbvex2v 1815* Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.)

Theoremcbvald 1816* Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1909. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Revised by Wolf Lammen, 13-May-2018.)

Theoremcbvexdh 1817* Deduction used to change bound variables, using implicit substitition, particularly useful in conjunction with dvelim 1909. (Contributed by NM, 2-Jan-2002.) (Proof rewritten by Jim Kingdon, 30-Dec-2017.)

Theoremcbvexd 1818* Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 1909. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.)

Theoremcbvaldva 1819* Rule used to change the bound variable in a universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)

Theoremcbvexdva 1820* Rule used to change the bound variable in an existential quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.)

Theoremcbvex4v 1821* Rule used to change bound variables, using implicit substitition. (Contributed by NM, 26-Jul-1995.)

Theoremeean 1822 Rearrange existential quantifiers. (Contributed by NM, 27-Oct-2010.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremeeanv 1823* Rearrange existential quantifiers. (Contributed by NM, 26-Jul-1995.)

Theoremeeeanv 1824* Rearrange existential quantifiers. (Contributed by NM, 26-Jul-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremee4anv 1825* Rearrange existential quantifiers. (Contributed by NM, 31-Jul-1995.)

Theoremee8anv 1826* Rearrange existential quantifiers. (Contributed by Jim Kingdon, 23-Nov-2019.)

Theoremnexdv 1827* Deduction for generalization rule for negated wff. (Contributed by NM, 5-Aug-1993.)

Theoremchvarv 1828* Implicit substitution of for into a theorem. (Contributed by NM, 20-Apr-1994.)

Theoremcleljust 1829* When the class variables of set theory are replaced with setvar variables, this theorem of predicate calculus is the result. This theorem provides part of the justification for the consistency of that definition, which "overloads" the setvar variables in wel 1410 with the class variables in wcel 1409. (Contributed by NM, 28-Jan-2004.)

1.4.5  More substitution theorems

Theoremhbs1 1830* is not free in when and are distinct. (Contributed by NM, 5-Aug-1993.) (Proof by Jim Kingdon, 16-Dec-2017.) (New usage is discouraged.)

Theoremnfs1v 1831* is not free in when and are distinct. (Contributed by Mario Carneiro, 11-Aug-2016.)

Theoremsbhb 1832* Two ways of expressing " is (effectively) not free in ." (Contributed by NM, 29-May-2009.)

Theoremhbsbv 1833* This is a version of hbsb 1839 with an extra distinct variable constraint, on and . (Contributed by Jim Kingdon, 25-Dec-2017.)

Theoremnfsbxy 1834* Similar to hbsb 1839 but with an extra distinct variable constraint, on and . (Contributed by Jim Kingdon, 19-Mar-2018.)

Theoremnfsbxyt 1835* Closed form of nfsbxy 1834. (Contributed by Jim Kingdon, 9-May-2018.)

Theoremsbco2vlem 1836* This is a version of sbco2 1855 where is distinct from and from . It is a lemma on the way to proving sbco2v 1837 which only requires that and be distinct. (Contributed by Jim Kingdon, 25-Dec-2017.) (One distinct variable constraint removed by Jim Kingdon, 3-Feb-2018.)

Theoremsbco2v 1837* This is a version of sbco2 1855 where is distinct from . (Contributed by Jim Kingdon, 12-Feb-2018.)

Theoremnfsb 1838* If is not free in , it is not free in when and are distinct. (Contributed by Mario Carneiro, 11-Aug-2016.) (Proof rewritten by Jim Kingdon, 19-Mar-2018.)

Theoremhbsb 1839* If is not free in , it is not free in when and are distinct. (Contributed by NM, 12-Aug-1993.) (Proof rewritten by Jim Kingdon, 22-Mar-2018.)

Theoremequsb3lem 1840* Lemma for equsb3 1841. (Contributed by NM, 4-Dec-2005.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremequsb3 1841* Substitution applied to an atomic wff. (Contributed by Raph Levien and FL, 4-Dec-2005.)

Theoremsbn 1842 Negation inside and outside of substitution are equivalent. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 3-Feb-2018.)

Theoremsbim 1843 Implication inside and outside of substitution are equivalent. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 3-Feb-2018.)

Theoremsbor 1844 Logical OR inside and outside of substitution are equivalent. (Contributed by NM, 29-Sep-2002.) (Proof rewritten by Jim Kingdon, 3-Feb-2018.)

Theoremsban 1845 Conjunction inside and outside of a substitution are equivalent. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 3-Feb-2018.)

Theoremsbrim 1846 Substitution with a variable not free in antecedent affects only the consequent. (Contributed by NM, 5-Aug-1993.)

Theoremsblim 1847 Substitution with a variable not free in consequent affects only the antecedent. (Contributed by NM, 14-Nov-2013.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremsb3an 1848 Conjunction inside and outside of a substitution are equivalent. (Contributed by NM, 14-Dec-2006.)

Theoremsbbi 1849 Equivalence inside and outside of a substitution are equivalent. (Contributed by NM, 5-Aug-1993.)

Theoremsblbis 1850 Introduce left biconditional inside of a substitution. (Contributed by NM, 19-Aug-1993.)

Theoremsbrbis 1851 Introduce right biconditional inside of a substitution. (Contributed by NM, 18-Aug-1993.)

Theoremsbrbif 1852 Introduce right biconditional inside of a substitution. (Contributed by NM, 18-Aug-1993.)

Theoremsbco2yz 1853* This is a version of sbco2 1855 where is distinct from . It is a lemma on the way to proving sbco2 1855 which has no distinct variable constraints. (Contributed by Jim Kingdon, 19-Mar-2018.)

Theoremsbco2h 1854 A composition law for substitution. (Contributed by NM, 30-Jun-1994.) (Proof rewritten by Jim Kingdon, 19-Mar-2018.)

Theoremsbco2 1855 A composition law for substitution. (Contributed by NM, 30-Jun-1994.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremsbco2d 1856 A composition law for substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbco2vd 1857* Version of sbco2d 1856 with a distinct variable constraint between and . (Contributed by Jim Kingdon, 19-Feb-2018.)

Theoremsbco 1858 A composition law for substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbco3v 1859* Version of sbco3 1864 with a distinct variable constraint between and . (Contributed by Jim Kingdon, 19-Feb-2018.)

Theoremsbcocom 1860 Relationship between composition and commutativity for substitution. (Contributed by Jim Kingdon, 28-Feb-2018.)

Theoremsbcomv 1861* Version of sbcom 1865 with a distinct variable constraint between and . (Contributed by Jim Kingdon, 28-Feb-2018.)

Theoremsbcomxyyz 1862* Version of sbcom 1865 with distinct variable constraints between and , and and . (Contributed by Jim Kingdon, 21-Mar-2018.)

Theoremsbco3xzyz 1863* Version of sbco3 1864 with distinct variable constraints between and , and and . Lemma for proving sbco3 1864. (Contributed by Jim Kingdon, 22-Mar-2018.)

Theoremsbco3 1864 A composition law for substitution. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 22-Mar-2018.)

Theoremsbcom 1865 A commutativity law for substitution. (Contributed by NM, 27-May-1997.) (Proof rewritten by Jim Kingdon, 22-Mar-2018.)

Theoremnfsbt 1866* Closed form of nfsb 1838. (Contributed by Jim Kingdon, 9-May-2018.)

Theoremnfsbd 1867* Deduction version of nfsb 1838. (Contributed by NM, 15-Feb-2013.)

Theoremelsb3 1868* Substitution applied to an atomic membership wff. (Contributed by NM, 7-Nov-2006.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremelsb4 1869* Substitution applied to an atomic membership wff. (Contributed by Rodolfo Medina, 3-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremsb9v 1870* Like sb9 1871 but with a distinct variable constraint between and . (Contributed by Jim Kingdon, 28-Feb-2018.)

Theoremsb9 1871 Commutation of quantification and substitution variables. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 23-Mar-2018.)

Theoremsb9i 1872 Commutation of quantification and substitution variables. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 23-Mar-2018.)

Theoremsbnf2 1873* Two ways of expressing " is (effectively) not free in ." (Contributed by Gérard Lang, 14-Nov-2013.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremhbsbd 1874* Deduction version of hbsb 1839. (Contributed by NM, 15-Feb-2013.) (Proof rewritten by Jim Kingdon, 23-Mar-2018.)

Theorem2sb5 1875* Equivalence for double substitution. (Contributed by NM, 3-Feb-2005.)

Theorem2sb6 1876* Equivalence for double substitution. (Contributed by NM, 3-Feb-2005.)

Theoremsbcom2v 1877* Lemma for proving sbcom2 1879. It is the same as sbcom2 1879 but with additional distinct variable constraints on and , and on and . (Contributed by Jim Kingdon, 19-Feb-2018.)

Theoremsbcom2v2 1878* Lemma for proving sbcom2 1879. It is the same as sbcom2v 1877 but removes the distinct variable constraint on and . (Contributed by Jim Kingdon, 19-Feb-2018.)

Theoremsbcom2 1879* Commutativity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 27-May-1997.) (Proof modified to be intuitionistic by Jim Kingdon, 19-Feb-2018.)

Theoremsb6a 1880* Equivalence for substitution. (Contributed by NM, 5-Aug-1993.)

Theorem2sb5rf 1881* Reversed double substitution. (Contributed by NM, 3-Feb-2005.)

Theorem2sb6rf 1882* Reversed double substitution. (Contributed by NM, 3-Feb-2005.)

Theoremdfsb7 1883* An alternate definition of proper substitution df-sb 1662. By introducing a dummy variable in the definiens, we are able to eliminate any distinct variable restrictions among the variables , , and of the definiendum. No distinct variable conflicts arise because effectively insulates from . To achieve this, we use a chain of two substitutions in the form of sb5 1783, first for then for . Compare Definition 2.1'' of [Quine] p. 17. Theorem sb7f 1884 provides a version where and don't have to be distinct. (Contributed by NM, 28-Jan-2004.)

Theoremsb7f 1884* This version of dfsb7 1883 does not require that and be distinct. This permits it to be used as a definition for substitution in a formalization that omits the logically redundant axiom ax-17 1435 i.e. that doesn't have the concept of a variable not occurring in a wff. (df-sb 1662 is also suitable, but its mixing of free and bound variables is distasteful to some logicians.) (Contributed by NM, 26-Jul-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremsb7af 1885* An alternative definition of proper substitution df-sb 1662. Similar to dfsb7a 1886 but does not require that and be distinct. Similar to sb7f 1884 in that it involves a dummy variable , but expressed in terms of rather than . (Contributed by Jim Kingdon, 5-Feb-2018.)

Theoremdfsb7a 1886* An alternative definition of proper substitution df-sb 1662. Similar to dfsb7 1883 in that it involves a dummy variable , but expressed in terms of rather than . For a version which only requires rather than and being distinct, see sb7af 1885. (Contributed by Jim Kingdon, 5-Feb-2018.)

Theoremsb10f 1887* Hao Wang's identity axiom P6 in Irving Copi, Symbolic Logic (5th ed., 1979), p. 328. In traditional predicate calculus, this is a sole axiom for identity from which the usual ones can be derived. (Contributed by NM, 9-May-2005.)

Theoremsbid2v 1888* An identity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 5-Aug-1993.)

Theoremsbelx 1889* Elimination of substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbel2x 1890* Elimination of double substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbalyz 1891* Move universal quantifier in and out of substitution. Identical to sbal 1892 except that it has an additional distinct variable constraint on and . (Contributed by Jim Kingdon, 29-Dec-2017.)

Theoremsbal 1892* Move universal quantifier in and out of substitution. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 12-Feb-2018.)

Theoremsbal1yz 1893* Lemma for proving sbal1 1894. Same as sbal1 1894 but with an additional distinct variable constraint on and . (Contributed by Jim Kingdon, 23-Feb-2018.)

Theoremsbal1 1894* A theorem used in elimination of disjoint variable restriction on and by replacing it with a distinctor . (Contributed by NM, 5-Aug-1993.) (Proof rewitten by Jim Kingdon, 24-Feb-2018.)

Theoremsbexyz 1895* Move existential quantifier in and out of substitution. Identical to sbex 1896 except that it has an additional distinct variable constraint on and . (Contributed by Jim Kingdon, 29-Dec-2017.)

Theoremsbex 1896* Move existential quantifier in and out of substitution. (Contributed by NM, 27-Sep-2003.) (Proof rewritten by Jim Kingdon, 12-Feb-2018.)

Theoremsbalv 1897* Quantify with new variable inside substitution. (Contributed by NM, 18-Aug-1993.)

Theoremsbco4lem 1898* Lemma for sbco4 1899. It replaces the temporary variable with another temporary variable . (Contributed by Jim Kingdon, 26-Sep-2018.)

Theoremsbco4 1899* Two ways of exchanging two variables. Both sides of the biconditional exchange and , either via two temporary variables and , or a single temporary . (Contributed by Jim Kingdon, 25-Sep-2018.)

Theoremexsb 1900* An equivalent expression for existence. (Contributed by NM, 2-Feb-2005.)

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