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 2907 | . 2 ⊢ Ⅎ𝑦𝐴 | |
2 | nfcv 2907 | . 2 ⊢ Ⅎ𝑦𝐵 | |
3 | nfcv 2907 | . 2 ⊢ Ⅎ𝑦𝐷 | |
4 | frsucmpt2.1 | . . 3 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) | |
5 | frsucmpt2.2 | . . . . . 6 ⊢ (𝑦 = 𝑥 → 𝐸 = 𝐶) | |
6 | 5 | cbvmptv 5187 | . . . . 5 ⊢ (𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) |
7 | rdgeq1 8242 | . . . . 5 ⊢ ((𝑦 ∈ V ↦ 𝐸) = (𝑥 ∈ V ↦ 𝐶) → rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)) | |
8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ rec((𝑦 ∈ V ↦ 𝐸), 𝐴) = rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
9 | 8 | reseq1i 5887 | . . 3 ⊢ (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
10 | 4, 9 | eqtr4i 2769 | . 2 ⊢ 𝐹 = (rec((𝑦 ∈ V ↦ 𝐸), 𝐴) ↾ ω) |
11 | frsucmpt2.3 | . 2 ⊢ (𝑦 = (𝐹‘𝐵) → 𝐸 = 𝐷) | |
12 | 1, 2, 3, 10, 11 | frsucmpt 8269 | 1 ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ↦ cmpt 5157 ↾ cres 5591 suc csuc 6268 ‘cfv 6433 ωcom 7712 reccrdg 8240 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 |
This theorem is referenced by: unblem2 9067 unblem3 9068 inf0 9379 trcl 9486 hsmexlem8 10180 wunex2 10494 wuncval2 10503 peano5nni 11976 peano2nn 11985 om2uzsuci 13668 neibastop2lem 34549 |
Copyright terms: Public domain | W3C validator |