Home Metamath Proof ExplorerTheorem List (p. 14 of 309) < Previous  Next > Browser slow? Try the Unicode version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-21328) Hilbert Space Explorer (21329-22851) Users' Mathboxes (22852-30843)

Theorem List for Metamath Proof Explorer - 1301-1400   *Has distinct variable group(s)
TypeLabelDescription
Statement

Definitiondf-xor 1301 Define exclusive disjunction (logical 'xor'). Return true if either the left or right, but not both, are true. After we define the constant true (df-tru 1315) and the constant false (df-fal 1316), we will be able to prove these truth table values: (truxortru 1354), (truxorfal 1355), (falxortru 1356), and (falxorfal 1357). Contrast with (df-an 362), (df-or 361), (wi 6), and (df-nan 1293) . (Contributed by FL, 22-Nov-2010.)

Theoremxnor 1302 Two ways to write XNOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorcom 1303 is commutative. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorass 1304 is associative. (Contributed by FL, 22-Nov-2010.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)

Theoremexcxor 1305 This tautology shows that xor is really exclusive. (Contributed by FL, 22-Nov-2010.)

Theoremxor2 1306 Two ways to express "exclusive or." (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorneg1 1307 is negated under negation of one argument. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorneg2 1308 is negated under negation of one argument. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremxorneg 1309 is unchanged under negation of both arguments. (Contributed by Mario Carneiro, 4-Sep-2016.)

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

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

1.3.11  True and false constants

Syntaxwtru 1312 is a wff.

Syntaxwfal 1313 is a wff.

Theoremtrujust 1314 Soundness justification theorem for df-tru 1315. (Contributed by Mario Carneiro, 17-Nov-2013.)

Definitiondf-tru 1315 Definition of , a tautology. is a constant true. In this definition biid 229 is used as an antecedent, however, any true wff, such as an axiom, can be used in its place. (Contributed by Anthony Hart, 13-Oct-2010.)

Definitiondf-fal 1316 Definition of , a contradiction. is a constant false. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremtru 1317 is provable. (Contributed by Anthony Hart, 13-Oct-2010.)

Theoremtru2OLD 1318 Obsolete proof of tru 1317 as of 5-Apr-2016. is provable. (Contributed by Anthony Hart, 13-Oct-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

Theoremfal 1319 is not provable. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Mel L. O'Cat, 11-Mar-2012.)

Theoremtrud 1320 Eliminate as an antecedent. (Contributed by Mario Carneiro, 13-Mar-2014.)

Theoremtbtru 1321 If something is true, it outputs . (Contributed by Anthony Hart, 14-Aug-2011.)

Theoremnbfal 1322 If something is not true, it outputs . (Contributed by Anthony Hart, 14-Aug-2011.)

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

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

Theoremfalim 1325 implies anything. (Contributed by FL, 20-Mar-2011.) (Proof shortened by Anthony Hart, 1-Aug-2011.)

Theoremfalimd 1326 implies anything. (Contributed by Mario Carneiro, 9-Feb-2017.)

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

Theoremdfnot 1328 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.)

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

Theoremefald 1330 Deduction based on reductio ad absurdum. (Contributed by Mario Carneiro, 9-Feb-2017.)

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

1.3.12  Truth tables

Some sources define operations on true/false values using truth tables. These tables show the results of their operations for all possible combinations of true () and false (). Here we show that our definitions and axioms produce equivalent results for (conjunction aka logical 'and') df-an 362, (disjunction aka logical inclusive 'or') df-or 361, (implies) wi 6, (not) wn 5, (logical equivalence) df-bi 179, (nand aka Sheffer stroke) df-nan 1293, and (exclusive or) df-xor 1301.

Theoremtruantru 1332 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremtruanfal 1333 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfalantru 1334 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfalanfal 1335 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremtruortru 1336 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtruorfal 1337 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfalortru 1338 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfalorfal 1339 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtruimtru 1340 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremtruimfal 1341 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremfalimtru 1342 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremfalimfal 1343 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremnottru 1344 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)

Theoremnotfal 1345 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtrubitru 1346 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtrubifal 1347 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremfalbitru 1348 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremfalbifal 1349 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtrunantru 1350 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtrunanfal 1351 A identity. (Contributed by Anthony Hart, 23-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremfalnantru 1352 A identity. (Contributed by Anthony Hart, 23-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremfalnanfal 1353 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)

Theoremtruxortru 1354 A identity. (Contributed by David A. Wheeler, 8-May-2015.)

Theoremtruxorfal 1355 A identity. (Contributed by David A. Wheeler, 8-May-2015.)

Theoremfalxortru 1356 A identity. (Contributed by David A. Wheeler, 9-May-2015.)

Theoremfalxorfal 1357 A identity. (Contributed by David A. Wheeler, 9-May-2015.)

1.3.13  Auxiliary theorems for Alan Sare's virtual deduction tool, part 1

Theoremee22 1358 Virtual deduction rule e22 27133 without virtual deduction connectives. Special theorem needed for Alan Sare's virtual deduction translation tool. (Contributed by Alan Sare, 2-May-2011.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremee12an 1359 e12an 27190 without virtual deduction connectives. Special theorem needed for Alan Sare's virtual deduction translation tool. (Contributed by Alan Sare, 28-Oct-2011.) TODO: this is frequently used; come up with better label.

Theoremee23 1360 e23 27220 without virtual deductions. (Contributed by Alan Sare, 17-Jul-2011.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremexbir 1361 Exportation implication also converting head from biconditional to conditional. This proof is exbirVD 27319 automatically translated and minimized. (Contributed by Alan Sare, 31-Dec-2011.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theorem3impexp 1362 impexp 435 with a 3-conjunct antecedent. (Contributed by Alan Sare, 31-Dec-2011.)

Theorem3impexpbicom 1363 3impexp 1362 with biconditional consequent of antecedent that is commuted in consequent. Derived automatically from 3impexpVD 27322. (Contributed by Alan Sare, 31-Dec-2011.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theorem3impexpbicomi 1364 Deduction form of 3impexpbicom 1363. Derived automatically from 3impexpbicomiVD 27324. (Contributed by Alan Sare, 31-Dec-2011.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremancomsimp 1365 Closed form of ancoms 441. Derived automatically from ancomsimpVD 27331. (Contributed by Alan Sare, 31-Dec-2011.)

Theoremexp3acom3r 1366 Export and commute antecedents. (Contributed by Alan Sare, 18-Mar-2012.)

Theoremexp3acom23g 1367 Implication form of exp3acom23 1368. (Contributed by Alan Sare, 22-Jul-2012.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremexp3acom23 1368 The exportation deduction exp3a 427 with commutation of the conjoined wwfs. (Contributed by Alan Sare, 22-Jul-2012.)

Theoremsimplbi2comg 1369 Implication form of simplbi2com 1370. (Contributed by Alan Sare, 22-Jul-2012.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremsimplbi2com 1370 A deduction eliminating a conjunct, similar to simplbi2 611. (Contributed by Alan Sare, 22-Jul-2012.) (Proof shortened by Wolf Lammen, 10-Nov-2012.)

Theoremee21 1371 e21 27195 without virtual deductions. (Contributed by Alan Sare, 18-Mar-2012.) (New usage is discouraged.) TODO: decide if this is worth keeping.

Theoremee10 1372 e10 27157 without virtual deductions. (Contributed by Alan Sare, 25-Jul-2011.) TODO: this is frequently used; come up with better label.

Theoremee02 1373 e02 27160 without virtual deductions. (Contributed by Alan Sare, 22-Jul-2012.) (New usage is discouraged.) TODO: decide if this is worth keeping.

1.3.14  Half-adders and full adders in propositional calculus

Propositional calculus deals with truth values, which can be interpreted as bits. Using this, we can define the half-adder in pure propositional calculus, and show its basic properties.

Syntaxwhad 1374 Define the half adder (triple XOR). (Contributed by Mario Carneiro, 4-Sep-2016.)

Syntaxwcad 1375 Define the half adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Definitiondf-had 1376 Define the half adder (triple XOR). (Contributed by Mario Carneiro, 4-Sep-2016.)

Definitiondf-cad 1377 Define the half adder carry, which is true when at least two arguments are true. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadbi123d 1378 Equality theorem for half adder. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadbi123d 1379 Equality theorem for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadbi123i 1380 Equality theorem for half adder. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadbi123i 1381 Equality theorem for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadass 1382 Associative law for triple XOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadbi 1383 The half adder is the same as the triple biconditional. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadcoma 1384 Commutative law for triple XOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadcomb 1385 Commutative law for triple XOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadrot 1386 Rotation law for triple XOR. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcador 1387 Write the adder carry in disjunctive normal form. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadan 1388 Write the adder carry in conjunctive normal form. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhadnot 1389 The half adder distributes over negation. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadnot 1390 The adder carry distributes over negation. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadcoma 1391 Commutative law for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadcomb 1392 Commutative law for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcadrot 1393 Rotation law for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcad1 1394 If one parameter is true, the adder carry is true exactly when at least one of the other parameters is true. (Contributed by Mario Carneiro, 8-Sep-2016.)

Theoremcad11 1395 If two parameters are true, the adder carry is true. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremcad0 1396 If one parameter is false, the adder carry is true exactly when both of the other two parameters are true. (Contributed by Mario Carneiro, 8-Sep-2016.)

Theoremcadtru 1397 Rotation law for adder carry. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhad1 1398 If the first parameter is true, the half adder is equivalent to the equality of the other two inputs. (Contributed by Mario Carneiro, 4-Sep-2016.)

Theoremhad0 1399 If the first parameter is false, the half adder is equivalent to the XOR of the other two inputs. (Contributed by Mario Carneiro, 4-Sep-2016.)