| 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 8417 | . . 3 ⊢ (𝐵 ∈ On → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵))) | |
| 2 | rdgsucmptf.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 2822 | . 2 ⊢ (𝐵 ∈ On → (𝐹‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵))) |
| 7 | fvex 6895 | . . 3 ⊢ (𝐹‘𝐵) ∈ V | |
| 8 | nfmpt1 5208 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶) | |
| 9 | rdgsucmptf.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐴 | |
| 10 | 8, 9 | nfrdg 8407 | . . . . . 6 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴) |
| 11 | 2, 10 | nfcxfr 2922 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
| 12 | rdgsucmptf.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
| 13 | 11, 12 | nffv 6892 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝐵) |
| 14 | rdgsucmptf.3 | . . . 4 ⊢ Ⅎ𝑥𝐷 | |
| 15 | rdgsucmptf.5 | . . . 4 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷) | |
| 16 | eqid 2762 | . . . 4 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶) | |
| 17 | 13, 14, 15, 16 | fvmptf 7012 | . . 3 ⊢ (((𝐹‘𝐵) ∈ V ∧ 𝐷 ∈ 𝑉) → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 18 | 7, 17 | mpan 703 | . 2 ⊢ (𝐷 ∈ 𝑉 → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = 𝐷) |
| 19 | 6, 18 | sylan9eq 2817 | 1 ⊢ ((𝐵 ∈ On ∧ 𝐷 ∈ 𝑉) → (𝐹‘suc 𝐵) = 𝐷) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 Ⅎwnfc 2909 Vcvv 3453 ↦ cmpt 5190 Oncon0 6361 suc csuc 6363 ‘cfv 6537 reccrdg 8402 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7420 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 |
| This theorem is used by: rdgsucmpt2 8423 rdgsucmpt 8424 ttrclselem1 9708 ttrclselem2 9709 rdgssun 38140 exrecfnlem 38141 |
| Copyright terms: Public domain | W3C validator |