| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rdgsucmptf | Structured version Visualization version GIF version | ||
| Description: The value of the recursive definition generator at a successor (special case where the characteristic function uses the map operation). (Contributed by NM, 22-Oct-2003.) (Revised by Mario Carneiro, 15-Oct-2016.) |
| Ref | Expression |
|---|---|
| rdgsucmptf.1 | ⊢ Ⅎ𝑥𝐴 |
| rdgsucmptf.2 | ⊢ Ⅎ𝑥𝐵 |
| rdgsucmptf.3 | ⊢ Ⅎ𝑥𝐷 |
| rdgsucmptf.4 | ⊢ 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
| rdgsucmptf.5 | ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| rdgsucmptf | ⊢ ((𝐵 ∈ On ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rdgsuc 8360 | . . 3 ⊢ (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵))) | |
| 2 | rdgsucmptf.4 | . . . 4 ⊢ 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴) | |
| 3 | 2 | fveq1i 6835 | . . 3 ⊢ (𝐹‘suc 𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) |
| 4 | 2 | fveq1i 6835 | . . . 4 ⊢ (𝐹‘𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵) |
| 5 | 4 | fveq2i 6837 | . . 3 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)) |
| 6 | 1, 3, 5 | 3eqtr4g 2800 | . 2 ⊢ (𝐵 ∈ On → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵))) |
| 7 | fvex 6847 | . . 3 ⊢ (𝐹‘𝐵) ∈ V | |
| 8 | nfmpt1 5178 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶) | |
| 9 | rdgsucmptf.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
| 10 | 8, 9 | nfrdg 8350 | . . . . . 6 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
| 11 | 2, 10 | nfcxfr 2900 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
| 12 | rdgsucmptf.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
| 13 | 11, 12 | nffv 6844 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝐵) |
| 14 | rdgsucmptf.3 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
| 15 | rdgsucmptf.5 | . . . 4 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) | |
| 16 | eqid 2740 | . . . 4 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶) | |
| 17 | 13, 14, 15, 16 | fvmptf 6964 | . . 3 ⊢ (((𝐹‘𝐵) ∈ V ∧ 𝐷 ∈ 𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 18 | 7, 17 | mpan 696 | . 2 ⊢ (𝐷 ∈ 𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 19 | 6, 18 | sylan9eq 2795 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Ⅎwnfc 2887 Vcvv 3432 ↦ cmpt 5160 Oncon0 6317 suc csuc 6319 ‘cfv 6492 reccrdg 8345 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 |
| This theorem is referenced by: rdgsucmpt2 8366 rdgsucmpt 8367 ttrclselem1 9644 ttrclselem2 9645 rdgssun 37747 exrecfnlem 37748 |
| Copyright terms: Public domain | W3C validator |