Definition df-wrecs 8251

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 8265, wfr2 8266, and wfr3 8267. (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 8250	. 2 class wrecs(𝑅, 𝐴, 𝐹)
5		c2nd 7930	. . . 4 class 2nd
6	3, 5	ccom 5624	. . 3 class (𝐹 ∘ 2nd )
7	1, 2, 6	cfrecs 8219	. 2 class frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))
8	4, 7	wceq 1542	1 wff wrecs(𝑅, 𝐴, 𝐹) = frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))

This definition is referenced by:  wrecseq123  8252  nfwrecs  8253  csbwrecsg  8257  wfrrel  8259  wfrdmss  8260  wfrdmcl  8261  wfrfun  8262  wfrresex  8263  wfr2a  8264  wfr1  8265  dfrecs3  8301