I am interested in proving the titular claim:
$R$ well-founded relation and $\forall y$, $\{x:xRy\}$ is finite implies $\forall y$, $\{x:xR^t y\}$ is finite (where $R^t$ is the transitive closure)
After drawing a couple of pictures/graphs it reminded me of Konig's Lemma: "every tree that contains infinitely many vertices, each having finite degree, has at least one infinite simple path."
Assuming I have no knowledge of graphs and trees, is there a proof of the claim using the definition of well-founded?
This previous question I asked is related/useful: Transitive Closure of a Well-Founded Relation is Well-Founded (without Axiom of Choice)