{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Proof\n\nWe compare [[truth tables|05RSK4Q657]]. Two formulas are [[logically equivalent|06GYGS41JK]] when they agree for each of the four assignments of truth values to $p$ and $q$.\n\n1. Let $p$ and $q$ be [[propositions|0ZGC7ZESYN]]. In classical logic, each of them is true or false, so there are four rows: TT, TF, FT and FF.\n2. We compute $\\neg (p \\lor q)$. By the definition of [[disjunction|0H5GKDTB01]], $p \\lor q$ is false only in the row FF. By the definition of [[negation|0XR7A7RSXB]], $\\neg (p \\lor q)$ is true only in the row FF.\n3. We compute $\\neg p \\land \\neg q$. By the definition of [[conjunction|0M28ASWG8T]], it is true only when $\\neg p$ and $\\neg q$ are both true. By the definition of negation, this happens only in the row FF.\n4. By steps 2 and 3, both formulas are true in the row FF and false in the other three rows. So $\\neg (p \\lor q) \\equiv \\neg p \\land \\neg q$.\n5. We compute $\\neg (p \\land q)$. By the definition of conjunction, $p \\land q$ is true only in the row TT. So $\\neg (p \\land q)$ is false only in the row TT.\n6. We compute $\\neg p \\lor \\neg q$. By the definition of disjunction, it is false only when $\\neg p$ and $\\neg q$ are both false. This happens only in the row TT.\n7. By steps 5 and 6, both formulas are false in the row TT and true in the other three rows. So $\\neg (p \\land q) \\equiv \\neg p \\lor \\neg q$.\n8. The full table shows both laws.\n\n| $p$ | $q$ | $\\neg (p \\lor q)$ | $\\neg p \\land \\neg q$ | $\\neg (p \\land q)$ | $\\neg p \\lor \\neg q$ |\n|---|---|---|---|---|---|\n| T | T | F | F | F | F |\n| T | F | F | F | T | T |\n| F | T | F | F | T | T |\n| F | F | T | T | T | T |\n\n## Idea\n\nEach side of a De Morgan law is singled out by one special row. For the first law that row is \"both false\", and for the second law it is \"both true\". Since the two sides pick out the same row, they agree everywhere.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "kind": "proof",
    "msc": [
      "03B05"
    ],
    "name": "Proof of De Morgan's laws by truth tables",
    "proves": "09PKJKA6J0",
    "sources": [
      {
        "url": "https://richardhammack.github.io/BookOfProof/"
      }
    ],
    "tag": "68VBVMFJSW",
    "uses": [
      "0ZGC7ZESYN",
      "0XR7A7RSXB",
      "0M28ASWG8T",
      "0H5GKDTB01",
      "06GYGS41JK",
      "05RSK4Q657"
    ]
  },
  "kind": "proof",
  "link": "https://math2.tamnd.com/node/68VBVMFJSW/",
  "links": [
    {
      "field": "proves",
      "target": "09PKJKA6J0"
    },
    {
      "field": "uses",
      "target": "0ZGC7ZESYN"
    },
    {
      "field": "uses",
      "target": "0XR7A7RSXB"
    },
    {
      "field": "uses",
      "target": "0M28ASWG8T"
    },
    {
      "field": "uses",
      "target": "0H5GKDTB01"
    },
    {
      "field": "uses",
      "target": "06GYGS41JK"
    },
    {
      "field": "uses",
      "target": "05RSK4Q657"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/68VBVMFJSW.md",
  "msc": [
    "03B05"
  ],
  "name": "Proof of De Morgan's laws by truth tables",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/68V/68VBVMFJSW.md",
  "status": null,
  "tag": "68VBVMFJSW",
  "uri": "m2://68VBVMFJSW",
  "url": "https://math2.tamnd.com/wiki/proof-of-de-morgans-laws-by-truth-tables/",
  "writing": {
    "tag": "68VBVMFJSW",
    "kind": "proof",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}