{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nFor all natural numbers $a$, $b$ and $c$, $(a + b) + c = a + (b + c)$.\nHere $+$ is the [[addition of natural numbers|0W5DSDFQ4G]].\n\n## Remarks\n\nThe proof from the recursive definition of addition uses [[induction|0ASJVEFA9J]] on $c$.\nBecause of this law, we can write $a + b + c$ without parentheses.\nMultiplication of natural numbers is also associative.\n\n## Explanations\n\n### L1 human\n\nWhen you add three numbers, you can add the first two first or the last two first.\nFor example, $(2 + 3) + 4 = 5 + 4 = 9$ and $2 + (3 + 4) = 2 + 7 = 9$.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "statement",
    "msc": [
      "03F30"
    ],
    "name": "Associativity of addition",
    "role": "theorem",
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Associative_property"
      },
      {
        "locator": "Associativity",
        "url": "https://en.wikipedia.org/wiki/Addition"
      }
    ],
    "tag": "0C32J27WQC",
    "uses": [
      "0W5DSDFQ4G",
      "0ASJVEFA9J"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0C32J27WQC/",
  "links": [
    {
      "field": "uses",
      "target": "0W5DSDFQ4G"
    },
    {
      "field": "uses",
      "target": "0ASJVEFA9J"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0C32J27WQC.md",
  "msc": [
    "03F30"
  ],
  "name": "Associativity of addition",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0C3/0C32J27WQC.md",
  "status": null,
  "tag": "0C32J27WQC",
  "uri": "m2://0C32J27WQC",
  "url": "https://math2.tamnd.com/wiki/associativity-of-addition/",
  "writing": {
    "tag": "0C32J27WQC",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}