# Strictly Well-Founded Relation is Well-Founded

## Theorem

Let $\struct {S, \RR}$ be a relational structure.

Let $\RR$ be a strictly well-founded relation on $S$.

Then $\RR$ is a well-founded relation on $S$.

## Proof

We have that $\RR$ is a strictly well-founded relation on $S$.

By definition:

$\forall T: \paren {T \subseteq S \land T \ne \O} \implies \exists y \in T: \forall z \in T: \neg \paren {z \mathrel \RR y}$

It immediately follows that:

$\forall T: \paren {T \subseteq S \land T \ne \O} \implies \exists y \in T: \forall z \in \paren {T \setminus \set y}: \neg \paren {z \mathrel \RR y}$

which is the definition of a well-founded relation on $S$.

$\blacksquare$