ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfr1on GIF version

Theorem tfr1on 6376
Description: Recursion is defined on an ordinal if the characteristic function is defined up to a suitable point. (Contributed by Jim Kingdon, 12-Mar-2022.)
Hypotheses
Ref Expression
tfr1on.f 𝐹 = recs(𝐺)
tfr1on.g (𝜑 → Fun 𝐺)
tfr1on.x (𝜑 → Ord 𝑋)
tfr1on.ex ((𝜑𝑥𝑋𝑓 Fn 𝑥) → (𝐺𝑓) ∈ V)
tfr1on.u ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
tfr1on.yx (𝜑𝑌𝑋)
Assertion
Ref Expression
tfr1on (𝜑𝑌 ⊆ dom 𝐹)
Distinct variable groups:   𝑓,𝐺,𝑥   𝑓,𝑋,𝑥   𝑓,𝑌,𝑥   𝜑,𝑓,𝑥
Allowed substitution hints:   𝐹(𝑥,𝑓)

Proof of Theorem tfr1on
Dummy variables 𝑎 𝑏 𝑐 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfr1on.f . 2 𝐹 = recs(𝐺)
2 tfr1on.g . 2 (𝜑 → Fun 𝐺)
3 tfr1on.x . 2 (𝜑 → Ord 𝑋)
4 tfr1on.ex . 2 ((𝜑𝑥𝑋𝑓 Fn 𝑥) → (𝐺𝑓) ∈ V)
5 eqid 2189 . . 3 {𝑎 ∣ ∃𝑏𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐺‘(𝑎𝑐)))} = {𝑎 ∣ ∃𝑏𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐺‘(𝑎𝑐)))}
65tfr1onlem3 6364 . 2 {𝑎 ∣ ∃𝑏𝑋 (𝑎 Fn 𝑏 ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝐺‘(𝑎𝑐)))} = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
7 tfr1on.u . 2 ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
8 tfr1on.yx . 2 (𝜑𝑌𝑋)
91, 2, 3, 4, 6, 7, 8tfr1onlemres 6375 1 (𝜑𝑌 ⊆ dom 𝐹)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2160  {cab 2175  wral 2468  wrex 2469  Vcvv 2752  wss 3144   cuni 3824  Ord word 4380  suc csuc 4383  dom cdm 4644  cres 4646  Fun wfun 5229   Fn wfn 5230  cfv 5235  recscrecs 6330
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4311  df-iord 4384  df-on 4386  df-suc 4389  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-recs 6331
This theorem is referenced by:  tfri1dALT  6377
  Copyright terms: Public domain W3C validator