| 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 8423 | . . 3 ⊢ (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵))) | |
| 2 | frsucmpt.4 | . . . 4 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) | |
| 3 | 2 | fveq1i 6883 | . . 3 ⊢ (𝐹‘suc 𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) |
| 4 | 2 | fveq1i 6883 | . . . 4 ⊢ (𝐹‘𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵) |
| 5 | 4 | fveq2i 6885 | . . 3 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵)) |
| 6 | 1, 3, 5 | 3eqtr4g 2829 | . 2 ⊢ (𝐵 ∈ ω → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵))) |
| 7 | fvex 6895 | . . 3 ⊢ (𝐹‘𝐵) ∈ V | |
| 8 | nfmpt1 5214 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶) | |
| 9 | frsucmpt.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
| 10 | 8, 9 | nfrdg 8400 | . . . . . . 7 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
| 11 | nfcv 2931 | . . . . . . 7 ⊢ Ⅎ𝑥ω | |
| 12 | 10, 11 | nfres 5981 | . . . . . 6 ⊢ Ⅎ𝑥(rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) |
| 13 | 2, 12 | nfcxfr 2929 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
| 14 | frsucmpt.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
| 15 | 13, 14 | nffv 6892 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝐵) |
| 16 | frsucmpt.3 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
| 17 | frsucmpt.5 | . . . 4 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) | |
| 18 | eqid 2769 | . . . 4 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶) | |
| 19 | 15, 16, 17, 18 | fvmptf 7012 | . . 3 ⊢ (((𝐹‘𝐵) ∈ V ∧ 𝐷 ∈ 𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 20 | 7, 19 | mpan 702 | . 2 ⊢ (𝐷 ∈ 𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 21 | 6, 20 | sylan9eq 2824 | 1 ⊢ ((𝐵 ∈ ω ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Ⅎwnfc 2916 Vcvv 3463 ↦ cmpt 5196 ↾ cres 5664 suc csuc 6363 ‘cfv 6537 ωcom 7861 reccrdg 8395 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 |
| This theorem is referenced by: frsucmpt2 8426 dffi3 9390 axdclem 10502 |
| Copyright terms: Public domain | W3C validator |