- Raspian “Welcome to Raspberry Pi” after every reboot
- How to add a fan if no gpio pins available
- Raspberry Pi 3 GPIO pins always active
- Does using stonger soaps help me lose weight?
- Isomerism:Which of the following pairs of compunds are not position isomers?
- Why does cooked liver turn green after a while?
- Maltose Nomenclature
- pKa of 2-fluoropropanoic acid v. 3-fluoropropanoic acid
- Contacted by a recruitment agency regarding a role working for a company that a mate of mine has just left
- How can I deal with troublesome Professional Engineer?
- Being Hired as a Vendor or Contractor, how do you put it on your resume?
- I'm a few months into grad school but not keen on continuing. Should I address why I'm dropping-out when applying places?
- Proving given language using finite automata
- Find Hamiltonian cycle in polynomial time
- Is a Turing machine too strong of a model to model physical computation?
- Conference rebuttal: can I add results?
- Uni group project being used by companies for profit
- Few very basic queries about post doctoral studies
- Is there any maximum time for staying in a belt in BJJ?
- Plastic vs vacuum insulated water bottle for hiking and everyday use

# A bootstrap from the traditional version of Transfinite Recursion to the parametric one

I'm self-learning Transfinite Recursion Theorem and its variants from textbook Introduction to Set Theory by Hrbacek and Jech.

After the authors have presented proofs of theorems 4.9, 4.10, and 4.11, they conclude A parametric version of Theorem 4.11 is straightforward and we leave it to the reader.

I have tried to give it a shot, but I'm not sure if it's fine or not. Does my attempt look fine or contain flaws? I'm very pleased to receive suggestion!

Let $V$ be the class of all sets, $\operatorname{Ord}$ be the class of all ordinals, and $G:V\to V$ be a class function.

Theorem 4.9: Transfinite Recursion Theorem

There exists a class function $F$ such that $F(\alpha)=G(F\restriction \alpha)$ for all $\alpha\in\operatorname{Ord}$.

Theorem 4.10: Transfinite Recursion Theorem, Parametric Version

There exists a class function $F$ such that $F(z,\alpha)=G(z,F_z\restriction \alpha)$ for all $\alpha\in\operatorname{Ord}$ and $z\in V$ where $F_z\restriction \alp