![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rdgsucg | Structured version Visualization version GIF version |
Description: The value of the recursive definition generator at a successor. (Contributed by NM, 16-Nov-2014.) |
Ref | Expression |
---|---|
rdgsucg | ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rdgdmlim 8473 | . . 3 ⊢ Lim dom rec(𝐹, 𝐴) | |
2 | limsuc 7886 | . . 3 ⊢ (Lim dom rec(𝐹, 𝐴) → (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴))) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) ↔ suc 𝐵 ∈ dom rec(𝐹, 𝐴)) |
4 | eqid 2740 | . . 3 ⊢ (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) | |
5 | rdgvalg 8475 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦))) | |
6 | rdgseg 8478 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴) ↾ 𝑦) ∈ V) | |
7 | rdgfun 8472 | . . . 4 ⊢ Fun rec(𝐹, 𝐴) | |
8 | funfn 6608 | . . . 4 ⊢ (Fun rec(𝐹, 𝐴) ↔ rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴)) | |
9 | 7, 8 | mpbi 230 | . . 3 ⊢ rec(𝐹, 𝐴) Fn dom rec(𝐹, 𝐴) |
10 | limord 6455 | . . . 4 ⊢ (Lim dom rec(𝐹, 𝐴) → Ord dom rec(𝐹, 𝐴)) | |
11 | 1, 10 | ax-mp 5 | . . 3 ⊢ Ord dom rec(𝐹, 𝐴) |
12 | 4, 5, 6, 9, 11 | tz7.44-2 8463 | . 2 ⊢ (suc 𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
13 | 3, 12 | sylbi 217 | 1 ⊢ (𝐵 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘suc 𝐵) = (𝐹‘(rec(𝐹, 𝐴)‘𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∅c0 4352 ifcif 4548 ∪ cuni 4931 ↦ cmpt 5249 dom cdm 5700 ran crn 5701 Ord word 6394 Lim wlim 6396 suc csuc 6397 Fun wfun 6567 Fn wfn 6568 ‘cfv 6573 reccrdg 8465 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 |
This theorem is referenced by: rdgsuc 8480 rdgsucmptnf 8485 frsuc 8493 r1sucg 9838 |
Copyright terms: Public domain | W3C validator |