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	⊢ 𝐹 = wrecs ( 𝑅 , 𝐴 , 𝐺 )
Assertion	wfrrel	⊢ Rel 𝐹

Proof

Step	Hyp	Ref	Expression
1		wfrrel.1	⊢ 𝐹 = wrecs ( 𝑅 , 𝐴 , 𝐺 )
2		df-wrecs	⊢ wrecs ( 𝑅 , 𝐴 , 𝐺 ) = frecs ( 𝑅 , 𝐴 , ( 𝐺 ∘ 2nd ) )
3	1 2	eqtri	⊢ 𝐹 = frecs ( 𝑅 , 𝐴 , ( 𝐺 ∘ 2nd ) )
4	3	frrrel	⊢ Rel 𝐹