{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nFor every non-special tree $T$ and regressive mapping $f:T\\rightarrow T$ (that is, $f(t)\u003ct$, with respect to the order on $T$, for every $t\\in T$, $t\\neq 0$), there is a non-special subtree $S\\subseteq T$ on which $f$ is constant.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "F1JAH9ZZ16"
    ],
    "kind": "statement",
    "name": "Fodor's lemma for trees",
    "role": "lemma",
    "sources": [
      {
        "locator": "Fodor's lemma",
        "mention": "wikipedia://en/1679022#MV7V",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:1679022@r1350068977"
      }
    ],
    "tag": "H671WT55SK"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/H671WT55SK/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/H671WT55SK.md",
  "msc": null,
  "name": "Fodor's lemma for trees",
  "prov": null,
  "role": "lemma",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/H67/H671WT55SK.md",
  "status": null,
  "tag": "H671WT55SK",
  "uri": "m2://H671WT55SK",
  "url": "https://math2.tamnd.com/wiki/fodors-lemma-for-trees/",
  "writing": {
    "tag": "H671WT55SK",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}