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

Theorem tfr1 7192
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 2505 . . . 4 {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
21tfrlem7 7178 . . 3 Fun recs(𝐺)
31tfrlem14 7186 . . 3 dom recs(𝐺) = On
4 df-fn 5636 . . 3 (recs(𝐺) Fn On ↔ (Fun recs(𝐺) ∧ dom recs(𝐺) = On))
52, 3, 4mpbir2an 947 . 2 recs(𝐺) Fn On
6 tfr.1 . . 3 𝐹 = recs(𝐺)
76fneq1i 5725 . 2 (𝐹 Fn On ↔ recs(𝐺) Fn On)
85, 7mpbir 216 1 𝐹 Fn On
Colors of variables: wff setvar class
Syntax hints:  wa 378   = wceq 1468  {cab 2491  wral 2791  wrex 2792  dom cdm 4880  cres 4882  Oncon0 5474  Fun wfun 5627   Fn wfn 5628  cfv 5633  recscrecs 7166
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1698  ax-4 1711  ax-5 1789  ax-6 1836  ax-7 1883  ax-8 1939  ax-9 1946  ax-10 1965  ax-11 1970  ax-12 1983  ax-13 2137  ax-ext 2485  ax-rep 4548  ax-sep 4558  ax-nul 4567  ax-pow 4619  ax-pr 4680  ax-un 6659
This theorem depends on definitions:  df-bi 192  df-or 379  df-an 380  df-3or 1022  df-3an 1023  df-tru 1471  df-ex 1693  df-nf 1697  df-sb 1829  df-eu 2357  df-mo 2358  df-clab 2492  df-cleq 2498  df-clel 2501  df-nfc 2635  df-ne 2677  df-ral 2796  df-rex 2797  df-reu 2798  df-rab 2800  df-v 3068  df-sbc 3292  df-csb 3386  df-dif 3429  df-un 3431  df-in 3433  df-ss 3440  df-pss 3442  df-nul 3758  df-if 3909  df-sn 3996  df-pr 3998  df-tp 4000  df-op 4002  df-uni 4229  df-iun 4309  df-br 4435  df-opab 4494  df-mpt 4495  df-tr 4531  df-eprel 4791  df-id 4795  df-po 4801  df-so 4802  df-fr 4839  df-we 4841  df-xp 4886  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893  df-pred 5431  df-ord 5477  df-on 5478  df-suc 5480  df-iota 5597  df-fun 5635  df-fn 5636  df-f 5637  df-f1 5638  df-fo 5639  df-f1o 5640  df-fv 5641  df-wrecs 7105  df-recs 7167
This theorem is referenced by:  tfr2  7193  tfr3  7194  recsfnon  7198  rdgfnon  7213  dfac8alem  8545  dfac12lem1  8658  dfac12lem2  8659  zorn2lem1  9011  zorn2lem2  9012  zorn2lem4  9014  zorn2lem5  9015  zorn2lem6  9016  zorn2lem7  9017  ttukeylem3  9026  ttukeylem5  9028  ttukeylem6  9029  dnnumch1  36142  dnnumch3lem  36144  dnnumch3  36145  aomclem6  36157
  Copyright terms: Public domain W3C validator