| 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 8390 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7853 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | 3 | sseli 3934 | . . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ dom rec(𝐹, 𝐴)) |
| 5 | rdgsucg 8396 | . . 3 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝐵 ∈ ω → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 7 | peano2b 7865 | . . 3 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω) | |
| 8 | fvres 6888 | . . 3 ⊢ (suc 𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) | |
| 9 | 7, 8 | sylbi 219 | . 2 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) |
| 10 | fvres 6888 | . . 3 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝐵) = (rec(𝐹, 𝐴)‘𝐵)) | |
| 11 | 10 | fveq2d 6873 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵)) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 12 | 6, 9, 11 | 3eqtr4d 2809 | 1 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1562 ∈ wcel 2144 ⊆ wss 3906 dom cdm 5649 ↾ cres 5651 Lim wlim 6349 suc csuc 6350 ‘cfv 6523 ωcom 7848 reccrdg 8382 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-om 7849 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 |
| This theorem is referenced by: frsucmpt 8411 frsucmptn 8412 seqomlem1 8423 seqomlem4 8426 onasuc 8499 onmsuc 8500 onesuc 8501 inf3lemc 9583 alephfplem2 10063 ackbij2lem2 10197 infpssrlem2 10263 fin23lem34 10305 fin23lem35 10306 itunisuc 10378 om2uzrdg 13971 uzrdgsuci 13975 om2noseqrdg 28399 noseqrdgsuc 28403 mh-inf3f1 36906 orbitcl 45538 |
| Copyright terms: Public domain | W3C validator |