![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > frsucmpt | 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). (Contributed by NM, 14-Sep-2003.) (Revised by Scott Fenton, 2-Nov-2011.) |
Ref | Expression |
---|---|
frsucmpt.1 | ⊢ Ⅎ𝑥𝐴 |
frsucmpt.2 | ⊢ Ⅎ𝑥𝐵 |
frsucmpt.3 | ⊢ Ⅎ𝑥𝐷 |
frsucmpt.4 | ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
frsucmpt.5 | ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
frsucmpt | ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frsuc 7577 | . . 3 ⊢ (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵))) | |
2 | frsucmpt.4 | . . . 4 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) | |
3 | 2 | fveq1i 6230 | . . 3 ⊢ (𝐹‘suc 𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) |
4 | 2 | fveq1i 6230 | . . . 4 ⊢ (𝐹‘𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵) |
5 | 4 | fveq2i 6232 | . . 3 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵)) |
6 | 1, 3, 5 | 3eqtr4g 2710 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵))) |
7 | fvex 6239 | . . 3 ⊢ (𝐹‘𝐵) ∈ V | |
8 | nfmpt1 4780 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶) | |
9 | frsucmpt.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
10 | 8, 9 | nfrdg 7555 | . . . . . . 7 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
11 | nfcv 2793 | . . . . . . 7 ⊢ Ⅎ𝑥ω | |
12 | 10, 11 | nfres 5430 | . . . . . 6 ⊢ Ⅎ𝑥(rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
13 | 2, 12 | nfcxfr 2791 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
14 | frsucmpt.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
15 | 13, 14 | nffv 6236 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝐵) |
16 | frsucmpt.3 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
17 | frsucmpt.5 | . . . 4 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) | |
18 | eqid 2651 | . . . 4 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶) | |
19 | 15, 16, 17, 18 | fvmptf 6340 | . . 3 ⊢ (((𝐹‘𝐵) ∈ V ∧ 𝐷 ∈ 𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
20 | 7, 19 | mpan 706 | . 2 ⊢ (𝐷 ∈ 𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
21 | 6, 20 | sylan9eq 2705 | 1 ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 ∈ wcel 2030 Ⅎwnfc 2780 Vcvv 3231 ↦ cmpt 4762 ↾ cres 5145 suc csuc 5763 ‘cfv 5926 ωcom 7107 reccrdg 7550 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-om 7108 df-wrecs 7452 df-recs 7513 df-rdg 7551 |
This theorem is referenced by: frsucmpt2 7580 dffi3 8378 axdclem 9379 trpredlem1 31851 trpredtr 31854 trpredmintr 31855 trpred0 31860 trpredrec 31862 |
Copyright terms: Public domain | W3C validator |