{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Proof\n\nThe axiom of choice can be proven from the well-ordering theorem as follows.\n\nTo make a choice function for a collection of non-empty sets, $E$, take the union of the sets in $E$ and call it $X$. There exists a well-ordering of $X$; let $R$ be such an ordering. The function that to each set $S$ of $E$ associates the smallest element of $S$, as ordered by (the restriction to $S$ of) $R$, is a choice function for the collection $E$.\n\nAn essential point of this proof is that it involves only a single arbitrary choice, that of $R$; applying the well-ordering theorem to each member $S$ of $E$ separately would not work, since the theorem only asserts the existence of a well-ordering, and choosing for each $S$ a well-ordering would require just as many choices as simply choosing an element from each $S$.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "kind": "proof",
    "msc": [
      "03E25"
    ],
    "name": "Proof of Well-ordering theorem",
    "proves": "0N109NG5ZX",
    "sources": [
      {
        "locator": "Well-ordering theorem, section Proof of axiom of choice",
        "mention": "wikipedia://en/33458#G238",
        "note": "adopted",
        "sections": [
          "Proof"
        ],
        "wikipedia": "en:33458@r1344684772"
      }
    ],
    "tag": "A1REKQ0Z47"
  },
  "kind": "proof",
  "link": "https://math2.tamnd.com/node/A1REKQ0Z47/",
  "links": [
    {
      "field": "proves",
      "target": "0N109NG5ZX"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/A1REKQ0Z47.md",
  "msc": [
    "03E25"
  ],
  "name": "Proof of Well-ordering theorem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/A1R/A1REKQ0Z47.md",
  "status": null,
  "tag": "A1REKQ0Z47",
  "uri": "m2://A1REKQ0Z47",
  "url": "https://math2.tamnd.com/wiki/proof-of-well-ordering-theorem/",
  "writing": {
    "tag": "A1REKQ0Z47",
    "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": "edge uses out",
        "note": "each node that the argument needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}