| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frsuc | Structured version Visualization version GIF version | ||
| Description: The successor value resulting from finite recursive definition generation. (Contributed by NM, 15-Oct-1996.) (Revised by Mario Carneiro, 16-Nov-2014.) |
| Ref | Expression |
|---|---|
| frsuc | ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rdgdmlim 8350 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7815 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | 3 | sseli 3913 | . . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ dom rec(𝐹, 𝐴)) |
| 5 | rdgsucg 8356 | . . 3 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝐵 ∈ ω → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 7 | peano2b 7827 | . . 3 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω) | |
| 8 | fvres 6850 | . . 3 ⊢ (suc 𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) | |
| 9 | 7, 8 | sylbi 219 | . 2 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) |
| 10 | fvres 6850 | . . 3 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝐵) = (rec(𝐹, 𝐴)‘𝐵)) | |
| 11 | 10 | fveq2d 6835 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵)) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 12 | 6, 9, 11 | 3eqtr4d 2786 | 1 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 ⊆ wss 3885 dom cdm 5621 ↾ cres 5623 Lim wlim 6315 suc csuc 6316 ‘cfv 6489 ωcom 7810 reccrdg 8342 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7363 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 |
| This theorem is referenced by: frsucmpt 8371 frsucmptn 8372 seqomlem1 8383 seqomlem4 8386 onasuc 8457 onmsuc 8458 onesuc 8459 inf3lemc 9542 alephfplem2 10022 ackbij2lem2 10156 infpssrlem2 10221 fin23lem34 10263 fin23lem35 10264 itunisuc 10336 om2uzrdg 13913 uzrdgsuci 13917 om2noseqrdg 28318 noseqrdgsuc 28322 mh-inf3f1 36784 orbitcl 45416 |
| Copyright terms: Public domain | W3C validator |