| 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 8403 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7866 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | 3 | sseli 3941 | . . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ dom rec(𝐹, 𝐴)) |
| 5 | rdgsucg 8409 | . . 3 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝐵 ∈ ω → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 7 | peano2b 7878 | . . 3 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω) | |
| 8 | fvres 6901 | . . 3 ⊢ (suc 𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) | |
| 9 | 7, 8 | sylbi 220 | . 2 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) |
| 10 | fvres 6901 | . . 3 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝐵) = (rec(𝐹, 𝐴)‘𝐵)) | |
| 11 | 10 | fveq2d 6886 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵)) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 12 | 6, 9, 11 | 3eqtr4d 2814 | 1 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 dom cdm 5662 ↾ cres 5664 Lim wlim 6362 suc csuc 6363 ‘cfv 6537 ωcom 7861 reccrdg 8395 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 |
| This theorem is referenced by: frsucmpt 8424 frsucmptn 8425 seqomlem1 8436 seqomlem4 8439 onasuc 8512 onmsuc 8513 onesuc 8514 inf3lemc 9594 alephfplem2 10088 ackbij2lem2 10221 infpssrlem2 10287 fin23lem34 10329 fin23lem35 10330 itunisuc 10402 om2uzrdg 13991 uzrdgsuci 13995 om2noseqrdg 28462 noseqrdgsuc 28466 mh-inf3f1 36940 orbitcl 45557 |
| Copyright terms: Public domain | W3C validator |