| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rdg0 | Structured version Visualization version GIF version | ||
| Description: The initial value of the recursive definition generator. (Contributed by NM, 23-Apr-1995.) (Revised by Mario Carneiro, 14-Nov-2014.) |
| Ref | Expression |
|---|---|
| rdg.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| rdg0 | ⊢ (rec(𝐹, 𝐴)‘∅) = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rdgdmlim 8383 | . . . 4 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7847 | . . . 4 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | peano1 7865 | . . 3 ⊢ ∅ ∈ ω | |
| 5 | 3, 4 | sselii 3933 | . 2 ⊢ ∅ ∈ dom rec(𝐹, 𝐴) |
| 6 | eqid 2761 | . . 3 ⊢ (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) | |
| 7 | rdgvalg 8385 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦))) | |
| 8 | rdg.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 9 | 6, 7, 8 | tz7.44-1 8372 | . 2 ⊢ (∅ ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘∅) = 𝐴) |
| 10 | 5, 9 | ax-mp 5 | 1 ⊢ (rec(𝐹, 𝐴)‘∅) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∈ wcel 2141 Vcvv 3453 ⊆ wss 3904 ∅c0 4285 ifcif 4479 ∪ cuni 4864 ↦ cmpt 5180 dom cdm 5645 ran crn 5646 Lim wlim 6343 ‘cfv 6517 ωcom 7842 reccrdg 8375 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-om 7843 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 |
| This theorem is referenced by: rdg0g 8393 seqomlem1 8416 seqomlem3 8418 om0 8481 oe0 8486 oev2 8487 r10 9723 aleph0 10019 ackbij2lem2 10192 ackbij2lem3 10193 precsexlem1 28277 precsexlem2 28278 constr0 33995 satfv0 35672 satf00 35688 rdgprc 36106 ttcid 36816 ttcmin 36820 finxp0 37849 finxp1o 37850 finxpreclem4 37852 finxpreclem6 37854 |
| Copyright terms: Public domain | W3C validator |