| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tfr1 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| tfr.1 | ⊢ 𝐹 = recs(𝐺) |
| Ref | Expression |
|---|---|
| tfr1 | ⊢ 𝐹 Fn On |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} | |
| 2 | 1 | tfrlem7 8429 | . . 3 ⊢ Fun recs(𝐺) |
| 3 | 1 | tfrlem14 8437 | . . 3 ⊢ dom recs(𝐺) = On |
| 4 | df-fn 6569 | . . 3 ⊢ (recs(𝐺) Fn On ↔ (Fun recs(𝐺) ∧ dom recs(𝐺) = On)) | |
| 5 | 2, 3, 4 | mpbir2an 724 | . 2 ⊢ recs(𝐺) Fn On |
| 6 | tfr.1 | . . 3 ⊢ 𝐹 = recs(𝐺) | |
| 7 | 6 | fneq1i 6666 | . 2 ⊢ (𝐹 Fn On ↔ recs(𝐺) Fn On) |
| 8 | 5, 7 | mpbir 234 | 1 ⊢ 𝐹 Fn On |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 {cab 2741 ∀wral 3080 ∃wrex 3090 dom cdm 5658 ↾ cres 5660 Oncon0 6388 Fun wfun 6560 Fn wfn 6561 ‘cfv 6566 recscrecs 8416 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 |
| This theorem is used by: tfr2 8444 tfr3 8445 recsfnon 8449 rdgfnon 8464 dfac8alem 10147 dfac12lem1 10261 dfac12lem2 10262 zorn2lem1 10613 zorn2lem2 10614 zorn2lem4 10616 zorn2lem5 10617 zorn2lem6 10618 zorn2lem7 10619 ttukeylem3 10628 ttukeylem5 10630 ttukeylem6 10631 madeval 28275 newval 28278 madef 28279 fnlfvk30 36068 fnlfvk3n0 36069 onvf1odlem3 36074 onvf1odlem4 36075 onvf1od 36076 dnnumch1 44317 dnnumch3lem 44319 dnnumch3 44320 aomclem6 44327 |
| Copyright terms: Public domain | W3C validator |