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 8172 | . . 3 ⊢ (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵))) | |
2 | frsucmpt.4 | . . . 4 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) | |
3 | 2 | fveq1i 6718 | . . 3 ⊢ (𝐹‘suc 𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) |
4 | 2 | fveq1i 6718 | . . . 4 ⊢ (𝐹‘𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵) |
5 | 4 | fveq2i 6720 | . . 3 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵)) |
6 | 1, 3, 5 | 3eqtr4g 2803 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵))) |
7 | fvex 6730 | . . 3 ⊢ (𝐹‘𝐵) ∈ V | |
8 | nfmpt1 5153 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶) | |
9 | frsucmpt.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
10 | 8, 9 | nfrdg 8150 | . . . . . . 7 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
11 | nfcv 2904 | . . . . . . 7 ⊢ Ⅎ𝑥ω | |
12 | 10, 11 | nfres 5853 | . . . . . 6 ⊢ Ⅎ𝑥(rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
13 | 2, 12 | nfcxfr 2902 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
14 | frsucmpt.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
15 | 13, 14 | nffv 6727 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝐵) |
16 | frsucmpt.3 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
17 | frsucmpt.5 | . . . 4 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) | |
18 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶) | |
19 | 15, 16, 17, 18 | fvmptf 6839 | . . 3 ⊢ (((𝐹‘𝐵) ∈ V ∧ 𝐷 ∈ 𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
20 | 7, 19 | mpan 690 | . 2 ⊢ (𝐷 ∈ 𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
21 | 6, 20 | sylan9eq 2798 | 1 ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 Ⅎwnfc 2884 Vcvv 3408 ↦ cmpt 5135 ↾ cres 5553 suc csuc 6215 ‘cfv 6380 ωcom 7644 reccrdg 8145 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pr 5322 ax-un 7523 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-om 7645 df-wrecs 8047 df-recs 8108 df-rdg 8146 |
This theorem is referenced by: frsucmpt2w 8175 frsucmpt2 8176 dffi3 9047 trpredlem1 9332 trpredtr 9335 trpredmintr 9336 trpred0 9337 trpredrec 9342 axdclem 10133 |
Copyright terms: Public domain | W3C validator |