Home Intuitionistic Logic ExplorerTheorem List (p. 2 of 102) < 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 - 101-200   *Has distinct variable group(s)
TypeLabelDescription
Statement

Axiomax-ia3 101 'And' introduction. One of the axioms of propositional logic. (Contributed by Mario Carneiro, 31-Jan-2015.)

Theoremsimpl 102 Elimination of a conjunct. Theorem *3.26 (Simp) of [WhiteheadRussell] p. 112. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-Nov-2012.)

Theoremsimpr 103 Elimination of a conjunct. Theorem *3.27 (Simp) of [WhiteheadRussell] p. 112. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-Nov-2012.)

Theoremsimpli 104 Inference eliminating a conjunct. (Contributed by NM, 15-Jun-1994.)

Theoremsimpld 105 Deduction eliminating a conjunct. (Contributed by NM, 5-Aug-1993.)

Theoremsimpri 106 Inference eliminating a conjunct. (Contributed by NM, 15-Jun-1994.)

Theoremsimprd 107 Deduction eliminating a conjunct. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)

Theoremex 108 Exportation inference. (This theorem used to be labeled "exp" but was changed to "ex" so as not to conflict with the math token "exp", per the June 2006 Metamath spec change.) (Contributed by NM, 5-Aug-1993.) (Proof shortened by Eric Schmidt, 22-Dec-2006.)

Theoremexpcom 109 Exportation inference with commuted antecedents. (Contributed by NM, 25-May-2005.)

Definitiondf-bi 110 This is our first definition, which introduces and defines the biconditional connective . We define a wff of the form as an abbreviation for .

Unlike most traditional developments, we have chosen not to have a separate symbol such as "Df." to mean "is defined as." Instead, we will later use the biconditional connective for this purpose, as it allows us to use logic to manipulate definitions directly. For an example of such a definition, see df-3or 886. This greatly simplifies many proofs since it eliminates the need for a separate mechanism for introducing and eliminating definitions. Of course, we cannot use this mechanism to define the biconditional itself, since it hasn't been introduced yet. Instead, we use a more general form of definition, described as follows.

In its most general form, a definition is simply an assertion that introduces a new symbol (or a new combination of existing symbols, as in df-3an 887) that is eliminable and does not strengthen the existing language. The latter requirement means that the set of provable statements not containing the new symbol (or new combination) should remain exactly the same after the definition is introduced. Our definition of the biconditional may look unusual compared to most definitions, but it strictly satisfies these requirements.

The justification for our definition is that if we mechanically replace (the definiendum i.e. the thing being defined) with (the definiens i.e. the defining expression) in the definition, the definition becomes the previously proved theorem biijust 570. It is impossible to use df-bi 110 to prove any statement expressed in the original language that can't be proved from the original axioms, because if we simply replace each instance of df-bi 110 in the proof with the corresponding biijust 570 instance, we will end up with a proof from the original axioms.

Note that from Metamath's point of view, a definition is just another axiom - i.e. an assertion we claim to be true - but from our high level point of view, we are are not strengthening the language. To indicate this fact, we prefix definition labels with "df-" instead of "ax-". (This prefixing is an informal convention that means nothing to the Metamath proof verifier; it is just for human readability.)

df-bi 110 itself is a conjunction of two implications (to avoid using the biconditional in its own definition), but once we have the biconditional, we can prove dfbi2 368 which uses the biconditional instead.

Other definitions of the biconditional, such as dfbi3dc 1288, only hold for decidable propositions, not all propositions. (Contributed by NM, 5-Aug-1993.) (Revised by Jim Kingdon, 24-Nov-2017.)

Theorembi1 111 Property of the biconditional connective. (Contributed by NM, 11-May-1999.) (Revised by NM, 31-Jan-2015.)

Theorembi3 112 Property of the biconditional connective. (Contributed by NM, 11-May-1999.)

Theorembiimpi 113 Infer an implication from a logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theoremsylbi 114 A mixed syllogism inference from a biconditional and an implication. Useful for substituting an antecedent with a definition. (Contributed by NM, 5-Aug-1993.)

Theoremimp 115 Importation inference. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Eric Schmidt, 22-Dec-2006.)

Theoremimpcom 116 Importation inference with commuted antecedents. (Contributed by NM, 25-May-2005.)

Theoremimpbii 117 Infer an equivalence from an implication and its converse. (Contributed by NM, 5-Aug-1993.)

Theoremimpbidd 118 Deduce an equivalence from two implications. (Contributed by Rodolfo Medina, 12-Oct-2010.)

Theoremimpbid21d 119 Deduce an equivalence from two implications. (Contributed by Wolf Lammen, 12-May-2013.)

Theoremimpbid 120 Deduce an equivalence from two implications. (Contributed by NM, 5-Aug-1993.) (Revised by Wolf Lammen, 3-Nov-2012.)

Theorembi2 121 Property of the biconditional connective. (Contributed by NM, 11-May-1999.) (Proof shortened by Wolf Lammen, 11-Nov-2012.)

Theorembicom1 122 Commutative law for equivalence. (Contributed by Wolf Lammen, 10-Nov-2012.)

Theorembicomi 123 Inference from commutative law for logical equivalence. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 16-Sep-2013.)

Theorembiimpri 124 Infer a converse implication from a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 16-Sep-2013.)

Theoremsylbir 125 A mixed syllogism inference from a biconditional and an implication. (Contributed by NM, 5-Aug-1993.)

Theorempm3.2 126 Join antecedents with conjunction. Theorem *3.2 of [WhiteheadRussell] p. 111. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 12-Nov-2012.) (Proof shortened by Jia Ming, 17-Nov-2020.)

Theoremsylib 127 A mixed syllogism inference from an implication and a biconditional. (Contributed by NM, 5-Aug-1993.)

Theorembicom 128 Commutative law for equivalence. Theorem *4.21 of [WhiteheadRussell] p. 117. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 11-Nov-2012.)

Theorembicomd 129 Commute two sides of a biconditional in a deduction. (Contributed by NM, 5-Aug-1993.)

Theoremimpbid1 130 Infer an equivalence from two implications. (Contributed by NM, 6-Mar-2007.)

Theoremimpbid2 131 Infer an equivalence from two implications. (Contributed by NM, 6-Mar-2007.) (Proof shortened by Wolf Lammen, 27-Sep-2013.)

Theorembiimpd 132 Deduce an implication from a logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theoremmpbi 133 An inference from a biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.)

Theoremmpbir 134 An inference from a biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.)

Theoremmpbid 135 A deduction from a biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.)

Theoremmpbii 136 An inference from a nested biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 25-Oct-2012.)

Theoremsylibr 137 A mixed syllogism inference from an implication and a biconditional. Useful for substituting a consequent with a definition. (Contributed by NM, 5-Aug-1993.)

Theoremsylibd 138 A syllogism deduction. (Contributed by NM, 3-Aug-1994.)

Theoremsylbid 139 A syllogism deduction. (Contributed by NM, 3-Aug-1994.)

Theoremmpbidi 140 A deduction from a biconditional, related to modus ponens. (Contributed by NM, 9-Aug-1994.)

Theoremsyl5bi 141 A mixed syllogism inference from a nested implication and a biconditional. Useful for substituting an embedded antecedent with a definition. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5bir 142 A mixed syllogism inference from a nested implication and a biconditional. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5ib 143 A mixed syllogism inference. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5ibcom 144 A mixed syllogism inference. (Contributed by NM, 19-Jun-2007.)

Theoremsyl5ibr 145 A mixed syllogism inference. (Contributed by NM, 3-Apr-1994.) (Revised by NM, 22-Sep-2013.)

Theoremsyl5ibrcom 146 A mixed syllogism inference. (Contributed by NM, 20-Jun-2007.)

Theorembiimprd 147 Deduce a converse implication from a logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 22-Sep-2013.)

Theorembiimpcd 148 Deduce a commuted implication from a logical equivalence. (Contributed by NM, 3-May-1994.) (Proof shortened by Wolf Lammen, 22-Sep-2013.)

Theorembiimprcd 149 Deduce a converse commuted implication from a logical equivalence. (Contributed by NM, 3-May-1994.) (Proof shortened by Wolf Lammen, 20-Dec-2013.)

Theoremsyl6ib 150 A mixed syllogism inference from a nested implication and a biconditional. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6ibr 151 A mixed syllogism inference from a nested implication and a biconditional. Useful for substituting an embedded consequent with a definition. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6bi 152 A mixed syllogism inference. (Contributed by NM, 2-Jan-1994.)

Theoremsyl6bir 153 A mixed syllogism inference. (Contributed by NM, 18-May-1994.)

Theoremsyl7bi 154 A mixed syllogism inference from a doubly nested implication and a biconditional. (Contributed by NM, 5-Aug-1993.)

Theoremsyl8ib 155 A syllogism rule of inference. The second premise is used to replace the consequent of the first premise. (Contributed by NM, 1-Aug-1994.)

Theoremmpbird 156 A deduction from a biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.)

Theoremmpbiri 157 An inference from a nested biconditional, related to modus ponens. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 25-Oct-2012.)

Theoremsylibrd 158 A syllogism deduction. (Contributed by NM, 3-Aug-1994.)

Theoremsylbird 159 A syllogism deduction. (Contributed by NM, 3-Aug-1994.)

Theorembiid 160 Principle of identity for logical equivalence. Theorem *4.2 of [WhiteheadRussell] p. 117. (Contributed by NM, 5-Aug-1993.)

Theorembiidd 161 Principle of identity with antecedent. (Contributed by NM, 25-Nov-1995.)

Theorempm5.1im 162 Two propositions are equivalent if they are both true. Closed form of 2th 163. Equivalent to a bi1 111-like version of the xor-connective. This theorem stays true, no matter how you permute its operands. This is evident from its sharper version . (Contributed by Wolf Lammen, 12-May-2013.)

Theorem2th 163 Two truths are equivalent. (Contributed by NM, 18-Aug-1993.)

Theorem2thd 164 Two truths are equivalent (deduction rule). (Contributed by NM, 3-Jun-2012.) (Revised by NM, 29-Jan-2013.)

Theoremibi 165 Inference that converts a biconditional implied by one of its arguments, into an implication. (Contributed by NM, 17-Oct-2003.)

Theoremibir 166 Inference that converts a biconditional implied by one of its arguments, into an implication. (Contributed by NM, 22-Jul-2004.)

Theoremibd 167 Deduction that converts a biconditional implied by one of its arguments, into an implication. (Contributed by NM, 26-Jun-2004.)

Theorempm5.74 168 Distribution of implication over biconditional. Theorem *5.74 of [WhiteheadRussell] p. 126. (Contributed by NM, 1-Aug-1994.) (Proof shortened by Wolf Lammen, 11-Apr-2013.)

Theorempm5.74i 169 Distribution of implication over biconditional (inference rule). (Contributed by NM, 1-Aug-1994.)

Theorempm5.74ri 170 Distribution of implication over biconditional (reverse inference rule). (Contributed by NM, 1-Aug-1994.)

Theorempm5.74d 171 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 21-Mar-1996.)

Theorempm5.74rd 172 Distribution of implication over biconditional (deduction rule). (Contributed by NM, 19-Mar-1997.)

Theorembitri 173 An inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-Oct-2012.)

Theorembitr2i 174 An inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theorembitr3i 175 An inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theorembitr4i 176 An inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theorembitrd 177 Deduction form of bitri 173. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 14-Apr-2013.)

Theorembitr2d 178 Deduction form of bitr2i 174. (Contributed by NM, 9-Jun-2004.)

Theorembitr3d 179 Deduction form of bitr3i 175. (Contributed by NM, 5-Aug-1993.)

Theorembitr4d 180 Deduction form of bitr4i 176. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5bb 181 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5rbb 182 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5bbr 183 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl5rbbr 184 A syllogism inference from two biconditionals. (Contributed by NM, 25-Nov-1994.)

Theoremsyl6bb 185 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6rbb 186 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6bbr 187 A syllogism inference from two biconditionals. (Contributed by NM, 5-Aug-1993.)

Theoremsyl6rbbr 188 A syllogism inference from two biconditionals. (Contributed by NM, 25-Nov-1994.)

Theorem3imtr3i 189 A mixed syllogism inference, useful for removing a definition from both sides of an implication. (Contributed by NM, 10-Aug-1994.)

Theorem3imtr4i 190 A mixed syllogism inference, useful for applying a definition to both sides of an implication. (Contributed by NM, 5-Aug-1993.)

Theorem3imtr3d 191 More general version of 3imtr3i 189. Useful for converting conditional definitions in a formula. (Contributed by NM, 8-Apr-1996.)

Theorem3imtr4d 192 More general version of 3imtr4i 190. Useful for converting conditional definitions in a formula. (Contributed by NM, 26-Oct-1995.)

Theorem3imtr3g 193 More general version of 3imtr3i 189. Useful for converting definitions in a formula. (Contributed by NM, 20-May-1996.) (Proof shortened by Wolf Lammen, 20-Dec-2013.)

Theorem3imtr4g 194 More general version of 3imtr4i 190. Useful for converting definitions in a formula. (Contributed by NM, 20-May-1996.) (Proof shortened by Wolf Lammen, 20-Dec-2013.)

Theorem3bitri 195 A chained inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.)

Theorem3bitrri 196 A chained inference from transitive law for logical equivalence. (Contributed by NM, 4-Aug-2006.)

Theorem3bitr2i 197 A chained inference from transitive law for logical equivalence. (Contributed by NM, 4-Aug-2006.)

Theorem3bitr2ri 198 A chained inference from transitive law for logical equivalence. (Contributed by NM, 4-Aug-2006.)

Theorem3bitr3i 199 A chained inference from transitive law for logical equivalence. (Contributed by NM, 19-Aug-1993.)

Theorem3bitr3ri 200 A chained inference from transitive law for logical equivalence. (Contributed by NM, 5-Aug-1993.)

Page List
Jump to page: Contents  1 1-100101-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-10124
 Copyright terms: Public domain < Previous  Next >