| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tfri2 | GIF version | ||
| Description: Principle of Transfinite Recursion, part 2 of 3. Theorem 7.41(2) of [TakeutiZaring] p. 47, with an additional condition on the recursion rule 𝐺 ( as described at tfri1 6609). Here we show that the function 𝐹 has the property that for any function 𝐺 satisfying that condition, the "next" value of 𝐹 is 𝐺 recursively applied to all "previous" values of 𝐹. (Contributed by Jim Kingdon, 4-May-2019.) |
| Ref | Expression |
|---|---|
| tfri1.1 | ⊢ 𝐹 = recs(𝐺) |
| tfri1.2 | ⊢ (Fun 𝐺 ∧ (𝐺‘𝑥) ∈ V) |
| Ref | Expression |
|---|---|
| tfri2 | ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tfri1.1 | . . . . 5 ⊢ 𝐹 = recs(𝐺) | |
| 2 | tfri1.2 | . . . . 5 ⊢ (Fun 𝐺 ∧ (𝐺‘𝑥) ∈ V) | |
| 3 | 1, 2 | tfri1 6609 | . . . 4 ⊢ 𝐹 Fn On |
| 4 | fndm 5460 | . . . 4 ⊢ (𝐹 Fn On → dom 𝐹 = On) | |
| 5 | 3, 4 | ax-mp 5 | . . 3 ⊢ dom 𝐹 = On |
| 6 | 5 | eleq2i 2301 | . 2 ⊢ (𝐴 ∈ dom 𝐹 ↔ 𝐴 ∈ On) |
| 7 | 1 | tfr2a 6565 | . 2 ⊢ (𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
| 8 | 6, 7 | sylbir 135 | 1 ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 Vcvv 2815 Oncon0 4489 dom cdm 4754 ↾ cres 4756 Fun wfun 5351 Fn wfn 5352 ‘cfv 5357 recscrecs 6548 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-recs 6549 |
| This theorem is referenced by: tfri3 6611 |
| Copyright terms: Public domain | W3C validator |