Home | Intuitionistic Logic ExplorerTheorem List (p. 2 of 20)
| < Previous Next > |

Browser slow? Try the
Unicode version. |

Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents

Type | Label | Description |
---|---|---|

Statement | ||

Theorem | simpl 101 | Elimination of a conjunct. Theorem *3.26 (Simp) of [WhiteheadRussell] p. 112. (The proof was shortened by Wolf Lammen, 13-Nov-2012.) |

Theorem | simpr 102 | Elimination of a conjunct. Theorem *3.27 (Simp) of [WhiteheadRussell] p. 112. (The proof was shortened by Wolf Lammen, 13-Nov-2012.) |

Theorem | simpli 103 | Inference eliminating a conjunct. |

Theorem | simpld 104 | Deduction eliminating a conjunct. |

Theorem | simpri 105 | Inference eliminating a conjunct. |

Theorem | simprd 106 | Deduction eliminating a conjunct. (The proof was shortened by Wolf Lammen, 3-Oct-2013.) |

Theorem | ex 107 | 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.) (The proof was shortened by Eric Schmidt, 22-Dec-2006.) |

Theorem | expcom 108 | Exportation inference with commuted antecedents. |

Definition | df-bi 109 |
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 (df-or 789 is its first use), as it allows us to use logic to manipulate definitions directly. 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 905) 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 bijust 549. It is impossible to use df-bi 109 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 109 in the proof with the corresponding bijust 549 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.) See dfbi1 778, dfbi2 366, and dfbi3 825 for theorems suggesting typical textbook definitions of , showing that our definition has the properties we expect. Theorem dfbi 367 shows this definition rewritten in an abbreviated form after conjunction is introduced, for easier understanding. |

Theorem | bi1 110 | Property of the biconditional connective. |

Theorem | bi3 111 | Property of the biconditional connective. |

Theorem | biimpi 112 | Infer an implication from a logical equivalence. |

Theorem | sylbi 113 | A mixed syllogism inference from a biconditional and an implication. Useful for substituting an antecedent with a definition. |

Theorem | imp 114 | Importation inference. (The proof was shortened by Eric Schmidt, 22-Dec-2006.) |

Theorem | impcom 115 | Importation inference with commuted antecedents. |

Theorem | impbii 116 | Infer an equivalence from an implication and its converse. |

Theorem | impbidd 117 | Deduce an equivalence from two implications. (Contributed by Rodolfo Medina, 12-Oct-2010.) |

Theorem | impbid21d 118 | Deduce an equivalence from two implications. (Contributed by Wolf Lammen, 12-May-2013.) |

Theorem | impbid 119 | Deduce an equivalence from two implications. (Dependency on df-an removed by Wolf Lammen, 3-Nov-2012.) |

Theorem | bi2 120 | Property of the biconditional connective. (The proof was shortened by Wolf Lammen, 11-Nov-2012.) |

Theorem | bicom1 121 | Commutative law for equivalence. (Contributed by Wolf Lammen, 10-Nov-2012.) |

Theorem | bicomi 122 | Inference from commutative law for logical equivalence. |

Theorem | biimpri 123 | Infer a converse implication from a logical equivalence. (The proof was shortened by Wolf Lammen, 16-Sep-2013.) |

Theorem | sylbir 124 | A mixed syllogism inference from a biconditional and an implication. |

Theorem | pm3.2 125 | Join antecedents with conjunction. Theorem *3.2 of [WhiteheadRussell] p. 111. (The proof was shortened by Wolf Lammen, 12-Nov-2012.) |

Theorem | sylib 126 | A mixed syllogism inference from an implication and a biconditional. |

Theorem | bicom 127 | Commutative law for equivalence. Theorem *4.21 of [WhiteheadRussell] p. 117. |

Theorem | bicomd 128 | Commute two sides of a biconditional in a deduction. |

Theorem | impbid1 129 | Infer an equivalence from two implications. |

Theorem | impbid2 130 | Infer an equivalence from two implications. (The proof was shortened by Wolf Lammen, 27-Sep-2013.) |

Theorem | biimpd 131 | Deduce an implication from a logical equivalence. |

Theorem | mpbi 132 | An inference from a biconditional, related to modus ponens. |

Theorem | mpbir 133 | An inference from a biconditional, related to modus ponens. |

Theorem | mpbid 134 | A deduction from a biconditional, related to modus ponens. |

Theorem | mpbii 135 | An inference from a nested biconditional, related to modus ponens. (The proof was shortened by Wolf Lammen, 25-Oct-2012.) |

Theorem | sylibr 136 | A mixed syllogism inference from an implication and a biconditional. Useful for substituting a consequent with a definition. |

Theorem | sylibd 137 | A syllogism deduction. |

Theorem | sylbid 138 | A syllogism deduction. |

Theorem | mpbidi 139 | A deduction from a biconditional, related to modus ponens. |

Theorem | syl5bi 140 | A mixed syllogism inference from a nested implication and a biconditional. Useful for substituting an embedded antecedent with a definition. |

Theorem | syl5bir 141 | A mixed syllogism inference from a nested implication and a biconditional. |

Theorem | syl5ib 142 | A mixed syllogism inference. |

Theorem | syl5ibcom 143 | A mixed syllogism inference. |

Theorem | syl5ibr 144 | A mixed syllogism inference. |

Theorem | syl5ibrcom 145 | A mixed syllogism inference. |

Theorem | biimprd 146 | Deduce a converse implication from a logical equivalence. (The proof was shortened by Wolf Lammen, 22-Sep-2013.) |

Theorem | biimpcd 147 | Deduce a commuted implication from a logical equivalence. (The proof was shortened by Wolf Lammen, 22-Sep-2013.) |

Theorem | biimprcd 148 | Deduce a converse commuted implication from a logical equivalence. (The proof was shortened by Wolf Lammen, 20-Dec-2013.) |

Theorem | syl6ib 149 | A mixed syllogism inference from a nested implication and a biconditional. |

Theorem | syl6ibr 150 | A mixed syllogism inference from a nested implication and a biconditional. Useful for substituting an embedded consequent with a definition. |

Theorem | syl6bi 151 | A mixed syllogism inference. |

Theorem | syl6bir 152 | A mixed syllogism inference. |

Theorem | syl7bi 153 | A mixed syllogism inference from a doubly nested implication and a biconditional. |

Theorem | syl8ib 154 | A syllogism rule of inference. The second premise is used to replace the consequent of the first premise. |

Theorem | mpbird 155 | A deduction from a biconditional, related to modus ponens. |

Theorem | mpbiri 156 | An inference from a nested biconditional, related to modus ponens. (The proof was shortened by Wolf Lammen, 25-Oct-2012.) |

Theorem | sylibrd 157 | A syllogism deduction. |

Theorem | sylbird 158 | A syllogism deduction. |

Theorem | biid 159 | Principle of identity for logical equivalence. Theorem *4.2 of [WhiteheadRussell] p. 117. |

Theorem | biidd 160 | Principle of identity with antecedent. |

Theorem | pm5.1im 161 | Two propositions are equivalent if they are both true. Closed form of 2th 162. Equivalent to a bi1 110-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.) |

Theorem | 2th 162 | Two truths are equivalent. |

Theorem | 2thd 163 | Two truths are equivalent (deduction rule). |

Theorem | ibi 164 | Inference that converts a biconditional implied by one of its arguments, into an implication. |

Theorem | ibir 165 | Inference that converts a biconditional implied by one of its arguments, into an implication. |

Theorem | ibd 166 | Deduction that converts a biconditional implied by one of its arguments, into an implication. |

Theorem | pm5.74 167 | Distribution of implication over biconditional. Theorem *5.74 of [WhiteheadRussell] p. 126. (The proof was shortened by Wolf Lammen, 11-Apr-2013.) |

Theorem | pm5.74i 168 | Distribution of implication over biconditional (inference rule). |

Theorem | pm5.74ri 169 | Distribution of implication over biconditional (reverse inference rule). |

Theorem | pm5.74d 170 | Distribution of implication over biconditional (deduction rule). |

Theorem | pm5.74rd 171 | Distribution of implication over biconditional (deduction rule). |

Theorem | bitri 172 | An inference from transitive law for logical equivalence. (The proof was shortened by Wolf Lammen, 13-Oct-2012.) |

Theorem | bitr2i 173 | An inference from transitive law for logical equivalence. |

Theorem | bitr3i 174 | An inference from transitive law for logical equivalence. |

Theorem | bitr4i 175 | An inference from transitive law for logical equivalence. |

Theorem | bitrd 176 | Deduction form of bitri 172. (The proof was shortened by Wolf Lammen, 14-Apr-2013.) |

Theorem | bitr2d 177 | Deduction form of bitr2i 173. |

Theorem | bitr3d 178 | Deduction form of bitr3i 174. |

Theorem | bitr4d 179 | Deduction form of bitr4i 175. |

Theorem | syl5bb 180 | A syllogism inference from two biconditionals. |

Theorem | syl5rbb 181 | A syllogism inference from two biconditionals. |

Theorem | syl5bbr 182 | A syllogism inference from two biconditionals. |

Theorem | syl5rbbr 183 | A syllogism inference from two biconditionals. |

Theorem | syl6bb 184 | A syllogism inference from two biconditionals. |

Theorem | syl6rbb 185 | A syllogism inference from two biconditionals. |

Theorem | syl6bbr 186 | A syllogism inference from two biconditionals. |

Theorem | syl6rbbr 187 | A syllogism inference from two biconditionals. |

Theorem | 3imtr3i 188 | A mixed syllogism inference, useful for removing a definition from both sides of an implication. |

Theorem | 3imtr4i 189 | A mixed syllogism inference, useful for applying a definition to both sides of an implication. |

Theorem | 3imtr3d 190 | More general version of 3imtr3i 188. Useful for converting conditional definitions in a formula. |

Theorem | 3imtr4d 191 | More general version of 3imtr4i 189. Useful for converting conditional definitions in a formula. |

Theorem | 3imtr3g 192 | More general version of 3imtr3i 188. Useful for converting definitions in a formula. (The proof was shortened by Wolf Lammen, 20-Dec-2013.) |

Theorem | 3imtr4g 193 | More general version of 3imtr4i 189. Useful for converting definitions in a formula. (The proof was shortened by Wolf Lammen, 20-Dec-2013.) |

Theorem | 3bitri 194 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitrri 195 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitr2i 196 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitr2ri 197 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitr3i 198 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitr3ri 199 | A chained inference from transitive law for logical equivalence. |

Theorem | 3bitr4i 200 | A chained inference from transitive law for logical equivalence. This inference is frequently used to apply a definition to both sides of a logical equivalence. |

< Previous Next > |

Copyright terms: Public domain | < Previous Next > |