Home Intuitionistic Logic ExplorerTheorem List (p. 13 of 105) < 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 - 1201-1300   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theorem3impdi 1201 Importation inference (undistribute conjunction). (Contributed by NM, 14-Aug-1995.)

Theorem3impdir 1202 Importation inference (undistribute conjunction). (Contributed by NM, 20-Aug-1995.)

Theorem3anidm12 1203 Inference from idempotent law for conjunction. (Contributed by NM, 7-Mar-2008.)

Theorem3anidm13 1204 Inference from idempotent law for conjunction. (Contributed by NM, 7-Mar-2008.)

Theorem3anidm23 1205 Inference from idempotent law for conjunction. (Contributed by NM, 1-Feb-2007.)

Theorem3ori 1206 Infer implication from triple disjunction. (Contributed by NM, 26-Sep-2006.)

Theorem3jao 1207 Disjunction of 3 antecedents. (Contributed by NM, 8-Apr-1994.)

Theorem3jaob 1208 Disjunction of 3 antecedents. (Contributed by NM, 13-Sep-2011.)

Theorem3jaoi 1209 Disjunction of 3 antecedents (inference). (Contributed by NM, 12-Sep-1995.)

Theorem3jaod 1210 Disjunction of 3 antecedents (deduction). (Contributed by NM, 14-Oct-2005.)

Theorem3jaoian 1211 Disjunction of 3 antecedents (inference). (Contributed by NM, 14-Oct-2005.)

Theorem3jaodan 1212 Disjunction of 3 antecedents (deduction). (Contributed by NM, 14-Oct-2005.)

Theoremmpjao3dan 1213 Eliminate a 3-way disjunction in a deduction. (Contributed by Thierry Arnoux, 13-Apr-2018.)

Theorem3jaao 1214 Inference conjoining and disjoining the antecedents of three implications. (Contributed by Jeff Hankins, 15-Aug-2009.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theorem3ianorr 1215 Triple disjunction implies negated triple conjunction. (Contributed by Jim Kingdon, 23-Dec-2018.)

Theoremsyl3an9b 1216 Nested syllogism inference conjoining 3 dissimilar antecedents. (Contributed by NM, 1-May-1995.)

Theorem3orbi123d 1217 Deduction joining 3 equivalences to form equivalence of disjunctions. (Contributed by NM, 20-Apr-1994.)

Theorem3anbi123d 1218 Deduction joining 3 equivalences to form equivalence of conjunctions. (Contributed by NM, 22-Apr-1994.)

Theorem3anbi12d 1219 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)

Theorem3anbi13d 1220 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)

Theorem3anbi23d 1221 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)

Theorem3anbi1d 1222 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)

Theorem3anbi2d 1223 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)

Theorem3anbi3d 1224 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)

Theorem3anim123d 1225 Deduction joining 3 implications to form implication of conjunctions. (Contributed by NM, 24-Feb-2005.)

Theorem3orim123d 1226 Deduction joining 3 implications to form implication of disjunctions. (Contributed by NM, 4-Apr-1997.)

Theoreman6 1227 Rearrangement of 6 conjuncts. (Contributed by NM, 13-Mar-1995.)

Theorem3an6 1228 Analog of an4 528 for triple conjunction. (Contributed by Scott Fenton, 16-Mar-2011.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theorem3or6 1229 Analog of or4 698 for triple conjunction. (Contributed by Scott Fenton, 16-Mar-2011.)

Theoremmp3an1 1230 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)

Theoremmp3an2 1231 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)

Theoremmp3an3 1232 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)

Theoremmp3an12 1233 An inference based on modus ponens. (Contributed by NM, 13-Jul-2005.)

Theoremmp3an13 1234 An inference based on modus ponens. (Contributed by NM, 14-Jul-2005.)

Theoremmp3an23 1235 An inference based on modus ponens. (Contributed by NM, 14-Jul-2005.)

Theoremmp3an1i 1236 An inference based on modus ponens. (Contributed by NM, 5-Jul-2005.)

Theoremmp3anl1 1237 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)

Theoremmp3anl2 1238 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)

Theoremmp3anl3 1239 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)

Theoremmp3anr1 1240 An inference based on modus ponens. (Contributed by NM, 4-Nov-2006.)

Theoremmp3anr2 1241 An inference based on modus ponens. (Contributed by NM, 24-Nov-2006.)

Theoremmp3anr3 1242 An inference based on modus ponens. (Contributed by NM, 19-Oct-2007.)

Theoremmp3an 1243 An inference based on modus ponens. (Contributed by NM, 14-May-1999.)

Theoremmpd3an3 1244 An inference based on modus ponens. (Contributed by NM, 8-Nov-2007.)

Theoremmpd3an23 1245 An inference based on modus ponens. (Contributed by NM, 4-Dec-2006.)

Theoremmp3and 1246 A deduction based on modus ponens. (Contributed by Mario Carneiro, 24-Dec-2016.)

Theoremmp3an12i 1247 mp3an 1243 with antecedents in standard conjunction form and with one hypothesis an implication. (Contributed by Alan Sare, 28-Aug-2016.)

Theoremmp3an2i 1248 mp3an 1243 with antecedents in standard conjunction form and with two hypotheses which are implications. (Contributed by Alan Sare, 28-Aug-2016.)

Theoremmp3an3an 1249 mp3an 1243 with antecedents in standard conjunction form and with two hypotheses which are implications. (Contributed by Alan Sare, 28-Aug-2016.)

Theoremmp3an2ani 1250 An elimination deduction. (Contributed by Alan Sare, 17-Oct-2017.)

Theorembiimp3a 1251 Infer implication from a logical equivalence. Similar to biimpa 284. (Contributed by NM, 4-Sep-2005.)

Theorembiimp3ar 1252 Infer implication from a logical equivalence. Similar to biimpar 285. (Contributed by NM, 2-Jan-2009.)

Theorem3anandis 1253 Inference that undistributes a triple conjunction in the antecedent. (Contributed by NM, 18-Apr-2007.)

Theorem3anandirs 1254 Inference that undistributes a triple conjunction in the antecedent. (Contributed by NM, 25-Jul-2006.) (Revised by NM, 18-Apr-2007.)

Theoremecased 1255 Deduction form of disjunctive syllogism. (Contributed by Jim Kingdon, 9-Dec-2017.)

Theoremecase23d 1256 Variation of ecased 1255 with three disjuncts instead of two. (Contributed by NM, 22-Apr-1994.) (Revised by Jim Kingdon, 9-Dec-2017.)

1.2.13  True and false constants

1.2.13.1  Universal quantifier for use by df-tru

Even though it isn't ordinarily part of propositional calculus, the universal quantifier is introduced here so that the soundness of definition df-tru 1262 can be checked by the same algorithm that is used for predicate calculus. Its first real use is in axiom ax-5 1352 in the predicate calculus section below. For those who want propositional calculus to be self-contained i.e. to use wff variables only, the alternate definition dftru2 1267 may be adopted and this subsection moved down to the start of the subsection with wex 1397 below. However, the use of dftru2 1267 as a definition requires a more elaborate definition checking algorithm that we prefer to avoid.

Syntaxwal 1257 Extend wff definition to include the universal quantifier ('for all'). is read " (phi) is true for all ." Typically, in its final application would be replaced with a wff containing a (free) occurrence of the variable , for example . In a universe with a finite number of objects, "for all" is equivalent to a big conjunction (AND) with one wff for each possible case of . When the universe is infinite (as with set theory), such a propositional-calculus equivalent is not possible because an infinitely long formula has no meaning, but conceptually the idea is the same.

1.2.13.2  Equality predicate for use by df-tru

Even though it isn't ordinarily part of propositional calculus, the equality predicate is introduced here so that the soundness of definition df-tru 1262 can be checked by the same algorithm as is used for predicate calculus. Its first real use is in axiom ax-8 1411 in the predicate calculus section below. For those who want propositional calculus to be self-contained i.e. to use wff variables only, the alternate definition dftru2 1267 may be adopted and this subsection moved down to just above weq 1408 below. However, the use of dftru2 1267 as a definition requires a more elaborate definition checking algorithm that we prefer to avoid.

Syntaxcv 1258 This syntax construction states that a variable , which has been declared to be a setvar variable by \$f statement vx, is also a class expression. This can be justified informally as follows. We know that the class builder is a class by cab 2042. Since (when is distinct from ) we have by cvjust 2051, we can argue that the syntax " " can be viewed as an abbreviation for " ". See the discussion under the definition of class in [Jech] p. 4 showing that "Every set can be considered to be a class."

While it is tempting and perhaps occasionally useful to view cv 1258 as a "type conversion" from a setvar variable to a class variable, keep in mind that cv 1258 is intrinsically no different from any other class-building syntax such as cab 2042, cun 2942, or c0 3251.

For a general discussion of the theory of classes and the role of cv 1258, see http://us.metamath.org/mpeuni/mmset.html#class.

(The description above applies to set theory, not predicate calculus. The purpose of introducing here, and not in set theory where it belongs, is to allow us to express i.e. "prove" the weq 1408 of predicate calculus from the wceq 1259 of set theory, so that we don't overload the connective with two syntax definitions. This is done to prevent ambiguity that would complicate some Metamath parsers.)

Syntaxwceq 1259 Extend wff definition to include class equality.

For a general discussion of the theory of classes, see http://us.metamath.org/mpeuni/mmset.html#class.

(The purpose of introducing here, and not in set theory where it belongs, is to allow us to express i.e. "prove" the weq 1408 of predicate calculus in terms of the wceq 1259 of set theory, so that we don't "overload" the connective with two syntax definitions. This is done to prevent ambiguity that would complicate some Metamath parsers. For example, some parsers - although not the Metamath program - stumble on the fact that the in could be the of either weq 1408 or wceq 1259, although mathematically it makes no difference. The class variables and are introduced temporarily for the purpose of this definition but otherwise not used in predicate calculus. See df-cleq 2049 for more information on the set theory usage of wceq 1259.)

1.2.13.3  Define the true and false constants

Syntaxwtru 1260 is a wff.

Theoremtrujust 1261 Soundness justification theorem for df-tru 1262. (Contributed by Mario Carneiro, 17-Nov-2013.) (Revised by NM, 11-Jul-2019.)

Definitiondf-tru 1262 Definition of the truth value "true", or "verum", denoted by . This is a tautology, as proved by tru 1263. In this definition, an instance of id 19 is used as the definiens, although any tautology, such as an axiom, can be used in its place. This particular id 19 instance was chosen so this definition can be checked by the same algorithm that is used for predicate calculus. This definition should be referenced directly only by tru 1263, and other proofs should depend on tru 1263 (directly or indirectly) instead of this definition, since there are many alternative ways to define . (Contributed by Anthony Hart, 13-Oct-2010.) (Revised by NM, 11-Jul-2019.) (New usage is discouraged.)

Theoremtru 1263 The truth value is provable. (Contributed by Anthony Hart, 13-Oct-2010.)

Syntaxwfal 1264 is a wff.

Definitiondf-fal 1265 Definition of the truth value "false", or "falsum", denoted by . See also df-tru 1262. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfal 1266 The truth value is refutable. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Mel L. O'Cat, 11-Mar-2012.)

Theoremdftru2 1267 An alternate definition of "true". (Contributed by Anthony Hart, 13-Oct-2010.) (Revised by BJ, 12-Jul-2019.) (New usage is discouraged.)

Theoremtrud 1268 Eliminate as an antecedent. A proposition implied by is true. (Contributed by Mario Carneiro, 13-Mar-2014.)

Theoremtbtru 1269 A proposition is equivalent to itself being equivalent to . (Contributed by Anthony Hart, 14-Aug-2011.)

Theoremnbfal 1270 The negation of a proposition is equivalent to itself being equivalent to . (Contributed by Anthony Hart, 14-Aug-2011.)

Theorembitru 1271 A theorem is equivalent to truth. (Contributed by Mario Carneiro, 9-May-2015.)

Theorembifal 1272 A contradiction is equivalent to falsehood. (Contributed by Mario Carneiro, 9-May-2015.)

Theoremfalim 1273 The truth value implies anything. Also called the principle of explosion, or "ex falso quodlibet". (Contributed by FL, 20-Mar-2011.) (Proof shortened by Anthony Hart, 1-Aug-2011.)

Theoremfalimd 1274 The truth value implies anything. (Contributed by Mario Carneiro, 9-Feb-2017.)

Theorema1tru 1275 Anything implies . (Contributed by FL, 20-Mar-2011.) (Proof shortened by Anthony Hart, 1-Aug-2011.)

Theoremtruan 1276 True can be removed from a conjunction. (Contributed by FL, 20-Mar-2011.) (Proof shortened by Wolf Lammen, 21-Jul-2019.)

TheoremtruanOLD 1277 Obsolete proof of truan 1276 as of 21-Jul-2019. (Contributed by FL, 20-Mar-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Theoremdfnot 1278 Given falsum, we can define the negation of a wff as the statement that a contradiction follows from assuming . (Contributed by Mario Carneiro, 9-Feb-2017.) (Proof shortened by Wolf Lammen, 21-Jul-2019.)

Theoreminegd 1279 Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.)

Theorempm2.21fal 1280 If a wff and its negation are provable, then falsum is provable. (Contributed by Mario Carneiro, 9-Feb-2017.)

Theorempclem6 1281 Negation inferred from embedded conjunct. (Contributed by NM, 20-Aug-1993.) (Proof rewritten by Jim Kingdon, 4-May-2018.)

1.2.14  Logical 'xor'

Syntaxwxo 1282 Extend wff definition to include exclusive disjunction ('xor').

Definitiondf-xor 1283 Define exclusive disjunction (logical 'xor'). Return true if either the left or right, but not both, are true. Contrast with (wa 101), (wo 639), and (wi 4) . (Contributed by FL, 22-Nov-2010.) (Modified by Jim Kingdon, 1-Mar-2018.)

Theoremxoranor 1284 One way of defining exclusive or. Equivalent to df-xor 1283. (Contributed by Jim Kingdon and Mario Carneiro, 1-Mar-2018.)

Theoremexcxor 1285 This tautology shows that xor is really exclusive. (Contributed by FL, 22-Nov-2010.) (Proof rewritten by Jim Kingdon, 5-May-2018.)

Theoremxoror 1286 XOR implies OR. (Contributed by BJ, 19-Apr-2019.)

Theoremxorbi2d 1287 Deduction joining an equivalence and a left operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)

Theoremxorbi1d 1288 Deduction joining an equivalence and a right operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)

Theoremxorbi12d 1289 Deduction joining two equivalences to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)

Theoremxorbi12i 1290 Equality property for XOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorbin 1291 A consequence of exclusive or. In classical logic the converse also holds. (Contributed by Jim Kingdon, 8-Mar-2018.)

Theorempm5.18im 1292 One direction of pm5.18dc 788, which holds for all propositions, not just decidable propositions. (Contributed by Jim Kingdon, 10-Mar-2018.)

Theoremxornbi 1293 A consequence of exclusive or. For decidable propositions this is an equivalence, as seen at xornbidc 1298. (Contributed by Jim Kingdon, 10-Mar-2018.)

Theoremxor3dc 1294 Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 12-Apr-2018.)
DECID DECID

Theoremxorcom 1295 is commutative. (Contributed by David A. Wheeler, 6-Oct-2018.)

Theorempm5.15dc 1296 A decidable proposition is equivalent to a decidable proposition or its negation. Based on theorem *5.15 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.)
DECID DECID

Theoremxor2dc 1297 Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 17-Apr-2018.)
DECID DECID

Theoremxornbidc 1298 Exclusive or is equivalent to negated biconditional for decidable propositions. (Contributed by Jim Kingdon, 27-Apr-2018.)
DECID DECID

Theoremxordc 1299 Two ways to express "exclusive or" between decidable propositions. Theorem *5.22 of [WhiteheadRussell] p. 124, but for decidable propositions. (Contributed by Jim Kingdon, 5-May-2018.)
DECID DECID

Theoremxordc1 1300 Exclusive or implies the left proposition is decidable. (Contributed by Jim Kingdon, 12-Mar-2018.)
DECID

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