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

Theorem tfr1 8436
Description: Principle of Transfinite Recursion, part 1 of 3. Theorem 7.41(1) of [TakeutiZaring] p. 47. We start with an arbitrary class 𝐺, normally a function, and 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 NM, 17-Aug-1994.) (Revised by Mario Carneiro, 18-Jan-2015.)
Hypothesis
Ref Expression
tfr.1 𝐹 = recs(𝐺)
Assertion
Ref Expression
tfr1 𝐹 Fn On

Proof of Theorem tfr1
Dummy variables 𝑥 𝑓 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2735 . . . 4 {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
21tfrlem7 8422 . . 3 Fun recs(𝐺)
31tfrlem14 8430 . . 3 dom recs(𝐺) = On
4 df-fn 6566 . . 3 (recs(𝐺) Fn On ↔ (Fun recs(𝐺) ∧ dom recs(𝐺) = On))
52, 3, 4mpbir2an 711 . 2 recs(𝐺) Fn On
6 tfr.1 . . 3 𝐹 = recs(𝐺)
76fneq1i 6666 . 2 (𝐹 Fn On ↔ recs(𝐺) Fn On)
85, 7mpbir 231 1 𝐹 Fn On
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1537  {cab 2712  wral 3059  wrex 3068  dom cdm 5689  cres 5691  Oncon0 6386  Fun wfun 6557   Fn wfn 6558  cfv 6563  recscrecs 8409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410
This theorem is referenced by:  tfr2  8437  tfr3  8438  recsfnon  8442  rdgfnon  8457  dfac8alem  10067  dfac12lem1  10182  dfac12lem2  10183  zorn2lem1  10534  zorn2lem2  10535  zorn2lem4  10537  zorn2lem5  10538  zorn2lem6  10539  zorn2lem7  10540  ttukeylem3  10549  ttukeylem5  10551  ttukeylem6  10552  madeval  27906  newval  27909  madef  27910  dnnumch1  43033  dnnumch3lem  43035  dnnumch3  43036  aomclem6  43048
  Copyright terms: Public domain W3C validator