| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frsucmpt2 | Structured version Visualization version GIF version | ||
| Description: The successor value resulting from finite recursive definition generation (special case where the generation function is expressed in maps-to notation), using double-substitution instead of a bound variable condition. (Contributed by Mario Carneiro, 11-Sep-2015.) |
| Ref | Expression |
|---|---|
| frsucmpt2.1 | ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
| frsucmpt2.2 | ⊢ (𝑦 = 𝑥 → 𝐸 = 𝐶) |
| frsucmpt2.3 | ⊢ (𝑦 = (𝐹‘𝐵) → 𝐸 = 𝐷) |
| Ref | Expression |
|---|---|
| frsucmpt2 | ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2896 | . 2 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfcv 2896 | . 2 ⊢ Ⅎ𝑦𝐵 | |
| 3 | nfcv 2896 | . 2 ⊢ Ⅎ𝑦𝐷 | |
| 4 | frsucmpt2.1 | . . 3 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) | |
| 5 | frsucmpt2.2 | . . . . . 6 ⊢ (𝑦 = 𝑥 → 𝐸 = 𝐶) | |
| 6 | 5 | cbvmptv 5200 | . . . . 5 ⊢ (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) |
| 7 | rdgeq1 8340 | . . . . 5 ⊢ ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
| 9 | 8 | reseq1i 5932 | . . 3 ⊢ (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
| 10 | 4, 9 | eqtr4i 2760 | . 2 ⊢ 𝐹 = (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) |
| 11 | frsucmpt2.3 | . 2 ⊢ (𝑦 = (𝐹‘𝐵) → 𝐸 = 𝐷) | |
| 12 | 1, 2, 3, 10, 11 | frsucmpt 8367 | 1 ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ↦ cmpt 5177 ↾ cres 5624 suc csuc 6317 ‘cfv 6490 ωcom 7806 reccrdg 8338 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 |
| This theorem is referenced by: unblem2 9191 unblem3 9192 inf0 9528 trcl 9635 hsmexlem8 10332 wunex2 10647 wuncval2 10656 peano5nni 12146 peano2nn 12155 om2uzsuci 13869 noseqp1 28252 noseqind 28253 om2noseqsuc 28258 dfnns2 28330 neibastop2lem 36503 |
| Copyright terms: Public domain | W3C validator |