| 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 8400 | . . . . 5 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7863 | . . . . 5 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | 3 | sseli 3933 | . . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ dom rec(𝐹, 𝐴)) |
| 5 | rdgsucg 8406 | . . 3 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝐵 ∈ ω → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
| 7 | peano2b 7875 | . . 3 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω) | |
| 8 | fvres 6900 | . . 3 ⊢ (suc 𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) | |
| 9 | 7, 8 | sylbi 220 | . 2 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘suc 𝐵) = (rec(𝐹, 𝐴)‘suc 𝐵)) |
| 10 | fvres 6900 | . . 3 ⊢ (𝐵 ∈ ω → ((rec(𝐹, 𝐴) ↾ ω)‘𝐵) = (rec(𝐹, 𝐴)‘𝐵)) | |
| 11 | 10 | fveq2d 6885 | . 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 2143 ⊆ wss 3905 dom cdm 5661 ↾ cres 5663 Lim wlim 6361 suc csuc 6362 ‘cfv 6536 ωcom 7858 reccrdg 8392 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 |
| This theorem is used by: frsucmpt 8421 frsucmptn 8422 seqomlem1 8433 seqomlem4 8436 onasuc 8509 onmsuc 8510 onesuc 8511 inf3lemc 9591 alephfplem2 10094 ackbij2lem2 10227 infpssrlem2 10292 fin23lem34 10334 fin23lem35 10335 itunisuc 10407 om2uzrdg 13997 uzrdgsuci 14001 om2noseqrdg 28506 noseqrdgsuc 28510 mh-inf3f1 37080 orbitcl 45694 |
| Copyright terms: Public domain | W3C validator |