 Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-irdg Structured version   GIF version

Definition df-irdg 5873
 Description: Define a recursive definition generator on On (the class of ordinal numbers) with characteristic function 𝐹 and initial value 𝐼. This rather amazing operation allows us to define, with compact direct definitions, functions that are usually defined in textbooks only with indirect self-referencing recursive definitions. A recursive definition requires advanced metalogic to justify - in particular, eliminating a recursive definition is very difficult and often not even shown in textbooks. On the other hand, the elimination of a direct definition is a matter of simple mechanical substitution. The price paid is the daunting complexity of our rec operation (especially when df-recs 5837 that it is built on is also eliminated). But once we get past this hurdle, definitions that would otherwise be recursive become relatively simple. In classical logic it would be easier to divide this definition into cases based on whether the domain of g is zero, a successor, or a limit ordinal. Cases do not (in general) work that way in intuitionistic logic, so instead we choose a definition which takes the union of all the results of the characteristic function for ordinals in the domain of g. This means that this definition has the expected properties for increasing and continuous ordinal functions, which include ordinal addition and multiplication. For finite recursion we also define df-frec 5893 and for suitable characteristic functions df-frec 5893 yields the same result as rec restricted to 𝜔, as seen at frecrdg 5903. Note: We introduce rec with the philosophical goal of being able to eliminate all definitions with direct mechanical substitution and to verify easily the soundness of definitions. Metamath itself has no built-in technical limitation that prevents multiple-part recursive definitions in the traditional textbook style. (Contributed by Jim Kingdon, 19-May-2019.)
Assertion
Ref Expression
df-irdg rec(𝐹, 𝐼) = recs((g V ↦ (𝐼 x dom g(𝐹‘(gx)))))
Distinct variable groups:   x,g,𝐹   x,𝐼,g

Detailed syntax breakdown of Definition df-irdg
StepHypRef Expression
1 cF . . 3 class 𝐹
2 cI . . 3 class 𝐼
31, 2crdg 5872 . 2 class rec(𝐹, 𝐼)
4 vg . . . 4 setvar g
5 cvv 2534 . . . 4 class V
6 vx . . . . . 6 setvar x
74cv 1227 . . . . . . 7 class g
87cdm 4270 . . . . . 6 class dom g
96cv 1227 . . . . . . . 8 class x
109, 7cfv 4827 . . . . . . 7 class (gx)
1110, 1cfv 4827 . . . . . 6 class (𝐹‘(gx))
126, 8, 11ciun 3630 . . . . 5 class x dom g(𝐹‘(gx))
132, 12cun 2891 . . . 4 class (𝐼 x dom g(𝐹‘(gx)))
144, 5, 13cmpt 3791 . . 3 class (g V ↦ (𝐼 x dom g(𝐹‘(gx))))
1514crecs 5836 . 2 class recs((g V ↦ (𝐼 x dom g(𝐹‘(gx)))))
163, 15wceq 1228 1 wff rec(𝐹, 𝐼) = recs((g V ↦ (𝐼 x dom g(𝐹‘(gx)))))
 Colors of variables: wff set class This definition is referenced by:  rdgeq1  5874  rdgeq2  5875  rdgfun  5876  rdgexggg  5879  rdgi0g  5881  rdgifnon  5882  rdgivallem  5883  rdg0  5890
 Copyright terms: Public domain W3C validator