Our teacher gave us for practice to prove some properties of $V(\alpha)$ defined as $$V(0) = \emptyset,\; V(S(\alpha)) = \mathcal{P}(V(\alpha)),\; Lim(\alpha): V(\alpha) = \bigcup\{V(\beta)\; |\; \beta < \alpha\}$$ The properties are
1) $\alpha < \beta \Rightarrow V(\alpha) \subseteq V(\beta)$
2) $\alpha \in V(S(\alpha))$
3) $\alpha \notin V(\alpha)$
We should use transfinite induction to prove them. However, I've never seen a real application of transfinite induction ever. Although I know its definition I still can't figure out a way how to apply it. Can someone help me?
Since the $V(\alpha)$ hierarchy is defined by transfinite recursion on ordinals, many statements about the hierarchy lend themselves to proofs by transfinite induction on ordinals. For instance, to prove
$$\forall \alpha,\ \alpha \notin V(\alpha)$$
You need to show:
These three statements are straightforward, just apply the definition of the $V(\alpha)$ hierarchy (and the definitions of "successor" and "limit" ordinal).