Definition df-wrecs 8237

Description: Define the well-ordered recursive function generator. This function takes the usual expressions from recursion theorems and forms a unified definition. Specifically, given a function 𝐹, a relation 𝑅, and a base set 𝐴, this definition generates a function 𝐺 = wrecs(𝑅, 𝐴, 𝐹) that has property that, at any point 𝑥 ∈ 𝐴, (𝐺‘𝑥) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑥))). See wfr1 8251, wfr2 8252, and wfr3 8253. (Contributed by Scott Fenton, 7-Jun-2018.) (Revised by BJ, 27-Oct-2024.)

Assertion

Ref	Expression
df-wrecs	⊢ wrecs(𝑅, 𝐴, 𝐹) = frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))

Detailed syntax breakdown of Definition df-wrecs

Step	Hyp	Ref	Expression
1		cA	. . 3 class 𝐴
2		cR	. . 3 class 𝑅
3		cF	. . 3 class 𝐹
4	1, 2, 3	cwrecs 8236	. 2 class wrecs(𝑅, 𝐴, 𝐹)
5		c2nd 7915	. . . 4 class 2nd
6	3, 5	ccom 5618	. . 3 class (𝐹 ∘ 2nd )
7	1, 2, 6	cfrecs 8205	. 2 class frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))
8	4, 7	wceq 1541	1 wff wrecs(𝑅, 𝐴, 𝐹) = frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))

This definition is referenced by:  wrecseq123  8238  nfwrecs  8239  csbwrecsg  8243  wfrrel  8245  wfrdmss  8246  wfrdmcl  8247  wfrfun  8248  wfrresex  8249  wfr2a  8250  wfr1  8251  dfrecs3  8287