Theorem wfrrel

Description: The well-ordered recursion generator generates a relation. Avoids the axiom of replacement. (Contributed by Scott Fenton, 8-Jun-2018) (Proof shortened by Scott Fenton, 17-Nov-2024)

	Ref	Expression
Hypothesis	wfrrel.1	$$⊢F=\mathrm{wrecs}\left(R,A,G\right)$$
Assertion	wfrrel	$$⊢\mathrm{Rel}F$$

Proof

Step	Hyp	Ref	Expression
1		wfrrel.1	$$⊢F=\mathrm{wrecs}\left(R,A,G\right)$$
2		df-wrecs	$$⊢\mathrm{wrecs}\left(R,A,G\right)=\mathrm{frecs}\left(R,A,G\circ 2^{nd}\right)$$
3	1 2	eqtri	$$⊢F=\mathrm{frecs}\left(R,A,G\circ 2^{nd}\right)$$
4	3	frrrel	$$⊢\mathrm{Rel}F$$