| 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 8456 | . . . 4 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7909 | . . . 4 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | peano1 7927 | . . 3 ⊢ ∅ ∈ ω | |
| 5 | 3, 4 | sselii 3910 | . 2 ⊢ ∅ ∈ dom rec(𝐹, 𝐴) |
| 6 | eqid 2763 | . . 3 ⊢ (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) | |
| 7 | rdgvalg 8458 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦))) | |
| 8 | rdg.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 9 | 6, 7, 8 | tz7.44-1 8445 | . 2 ⊢ (∅ ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘∅) = 𝐴) |
| 10 | 5, 9 | ax-mp 5 | 1 ⊢ (rec(𝐹, 𝐴)‘∅) = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ∅c0 4281 ifcif 4485 ∪ cuni 4870 ↦ cmpt 5190 dom cdm 5656 ran crn 5657 Lim wlim 6384 ‘cfv 6561 ωcom 7904 reccrdg 8448 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pr 5396 ax-un 7778 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7449 df-om 7905 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 |
| This theorem is used by: rdg0g 8466 seqomlem1 8491 seqomlem3 8493 om0 8556 oe0 8561 oev2 8562 r10 9805 aleph0 10175 ackbij2lem2 10347 ackbij2lem3 10348 precsexlem1 28626 precsexlem2 28627 constr0 34452 satfv0 36303 satf00 36319 rdgprc 36747 ttcid 37471 ttcmin 37475 finxp0 38519 finxp1o 38520 finxpreclem4 38522 finxpreclem6 38524 |
| Copyright terms: Public domain | W3C validator |