MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-wrecs Structured version   Visualization version   GIF version

Definition df-wrecs 8335
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 8373, wfr2 8374, and wfr3 8375. (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
StepHypRef Expression
1 cA . . 3 class 𝐴
2 cR . . 3 class 𝑅
3 cF . . 3 class 𝐹
41, 2, 3cwrecs 8334 . 2 class wrecs(𝑅, 𝐴, 𝐹)
5 c2nd 8011 . . . 4 class 2nd
63, 5ccom 5692 . . 3 class (𝐹 ∘ 2nd )
71, 2, 6cfrecs 8303 . 2 class frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))
84, 7wceq 1536 1 wff wrecs(𝑅, 𝐴, 𝐹) = frecs(𝑅, 𝐴, (𝐹 ∘ 2nd ))
Colors of variables: wff setvar class
This definition is referenced by:  dfwrecsOLD  8336  wrecseq123  8337  nfwrecs  8339  csbwrecsg  8344  wfrrel  8367  wfrdmss  8368  wfrdmcl  8369  wfrfun  8370  wfrresex  8371  wfr2a  8372  wfr1  8373  dfrecs3  8410
  Copyright terms: Public domain W3C validator