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

Theorem tfri1 6574
Description: Principle of Transfinite Recursion, part 1 of 3. Theorem 7.41(1) of [TakeutiZaring] p. 47, with an additional condition.

The condition is that 𝐺 is defined "everywhere", which is stated here as (𝐺𝑥) ∈ V. Alternately, 𝑥 ∈ On∀𝑓(𝑓 Fn 𝑥𝑓 ∈ dom 𝐺) would suffice.

Given a function 𝐺 satisfying that condition, we define a class 𝐴 of all "acceptable" functions. The final function we're interested in is the union 𝐹 = recs(𝐺) of them. 𝐹 is then said to be defined by transfinite recursion. The purpose of the 3 parts of this theorem is to demonstrate properties of 𝐹. In this first part we show that 𝐹 is a function whose domain is all ordinal numbers. (Contributed by Jim Kingdon, 4-May-2019.) (Revised by Mario Carneiro, 24-May-2019.)

Hypotheses
Ref Expression
tfri1.1 𝐹 = recs(𝐺)
tfri1.2 (Fun 𝐺 ∧ (𝐺𝑥) ∈ V)
Assertion
Ref Expression
tfri1 𝐹 Fn On
Distinct variable group:   𝑥,𝐺
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem tfri1
StepHypRef Expression
1 tfri1.1 . . 3 𝐹 = recs(𝐺)
2 tfri1.2 . . . . 5 (Fun 𝐺 ∧ (𝐺𝑥) ∈ V)
32ax-gen 1498 . . . 4 𝑥(Fun 𝐺 ∧ (𝐺𝑥) ∈ V)
43a1i 9 . . 3 (⊤ → ∀𝑥(Fun 𝐺 ∧ (𝐺𝑥) ∈ V))
51, 4tfri1d 6544 . 2 (⊤ → 𝐹 Fn On)
65mptru 1407 1 𝐹 Fn On
Colors of variables: wff set class
Syntax hints:  wa 104  wal 1396   = wceq 1398  wtru 1399  wcel 2202  Vcvv 2803  Oncon0 4466  Fun wfun 5327   Fn wfn 5328  cfv 5333  recscrecs 6513
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-recs 6514
This theorem is referenced by:  tfri2  6575  tfri3  6576
  Copyright terms: Public domain W3C validator