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 8248 | . . . 4 ⊢ Lim dom rec(𝐹, 𝐴) | |
2 | limomss 7717 | . . . 4 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
4 | peano1 7735 | . . 3 ⊢ ∅ ∈ ω | |
5 | 3, 4 | sselii 3918 | . 2 ⊢ ∅ ∈ dom rec(𝐹, 𝐴) |
6 | eqid 2738 | . . 3 ⊢ (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) | |
7 | rdgvalg 8250 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦))) | |
8 | rdg.1 | . . 3 ⊢ 𝐴 ∈ V | |
9 | 6, 7, 8 | tz7.44-1 8237 | . 2 ⊢ (∅ ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘∅) = 𝐴) |
10 | 5, 9 | ax-mp 5 | 1 ⊢ (rec(𝐹, 𝐴)‘∅) = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2106 Vcvv 3432 ⊆ wss 3887 ∅c0 4256 ifcif 4459 ∪ cuni 4839 ↦ cmpt 5157 dom cdm 5589 ran crn 5590 Lim wlim 6267 ‘cfv 6433 ωcom 7712 reccrdg 8240 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 |
This theorem is referenced by: rdg0g 8258 seqomlem1 8281 seqomlem3 8283 om0 8347 oe0 8352 oev2 8353 r10 9526 aleph0 9822 ackbij2lem2 9996 ackbij2lem3 9997 satfv0 33320 satf00 33336 rdgprc 33770 finxp0 35562 finxp1o 35563 finxpreclem4 35565 finxpreclem6 35567 |
Copyright terms: Public domain | W3C validator |