| 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 8450 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7903 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | 3 | sseli 3909 | . . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ dom rec(𝐹, 𝐴)) |
| 5 | rdgsucg 8456 | . . 3 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝐵 ∈ ω → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 7 | peano2b 7915 | . . 3 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω) | |
| 8 | fvres 6924 | . . 3 ⊢ (suc 𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) | |
| 9 | 7, 8 | sylbi 220 | . 2 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) |
| 10 | fvres 6924 | . . 3 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝐵) = (rec(𝐹, 𝐴)‘𝐵)) | |
| 11 | 10 | fveq2d 6909 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵)) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 12 | 6, 9, 11 | 3eqtr4d 2808 | 1 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (𝐹‘((rec(𝐹, 𝐴) ↾ ω)‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 dom cdm 5655 ↾ cres 5657 Lim wlim 6378 suc csuc 6379 ‘cfv 6555 ωcom 7898 reccrdg 8442 |
| 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-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| 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 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-om 7899 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 |
| This theorem is used by: frsucmpt 8471 frsucmptn 8472 seqomlem1 8485 seqomlem4 8488 onasuc 8561 onmsuc 8562 onesuc 8563 inf3lemc 9651 alephfplem2 10208 ackbij2lem2 10341 infpssrlem2 10406 fin23lem34 10448 fin23lem35 10449 itunisuc 10521 om2uzrdg 14123 uzrdgsuci 14127 om2noseqrdg 28717 noseqrdgsuc 28721 mh-inf3f1 37506 orbitcl 46140 |
| Copyright terms: Public domain | W3C validator |