| 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 8356 | . . . 4 ⊢ Lim dom rec(𝐹, 𝐴) | |
| 2 | limomss 7822 | . . . 4 ⊢ (Lim dom rec(𝐹, 𝐴) → ω ⊆ dom rec(𝐹, 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ ω ⊆ dom rec(𝐹, 𝐴) |
| 4 | peano1 7840 | . . 3 ⊢ ∅ ∈ ω | |
| 5 | 3, 4 | sselii 3918 | . 2 ⊢ ∅ ∈ dom rec(𝐹, 𝐴) |
| 6 | eqid 2736 | . . 3 ⊢ (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) = (𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥))))) | |
| 7 | rdgvalg 8358 | . . 3 ⊢ (𝑦 ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘𝑦) = ((𝑥 ∈ V ↦ if(𝑥 = ∅, 𝐴, if(Lim dom 𝑥, ∪ ran 𝑥, (𝐹‘(𝑥‘∪ dom 𝑥)))))‘(rec(𝐹, 𝐴) ↾ 𝑦))) | |
| 8 | rdg.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 9 | 6, 7, 8 | tz7.44-1 8345 | . 2 ⊢ (∅ ∈ dom rec(𝐹, 𝐴) → (rec(𝐹, 𝐴)‘∅) = 𝐴) |
| 10 | 5, 9 | ax-mp 5 | 1 ⊢ (rec(𝐹, 𝐴)‘∅) = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 Vcvv 3429 ⊆ wss 3889 ∅c0 4273 ifcif 4466 ∪ cuni 4850 ↦ cmpt 5166 dom cdm 5631 ran crn 5632 Lim wlim 6324 ‘cfv 6498 ωcom 7817 reccrdg 8348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 |
| This theorem is referenced by: rdg0g 8366 seqomlem1 8389 seqomlem3 8391 om0 8452 oe0 8457 oev2 8458 r10 9692 aleph0 9988 ackbij2lem2 10161 ackbij2lem3 10162 precsexlem1 28199 precsexlem2 28200 constr0 33881 satfv0 35540 satf00 35556 rdgprc 35974 ttcid 36674 ttcmin 36678 finxp0 37707 finxp1o 37708 finxpreclem4 37710 finxpreclem6 37712 |
| Copyright terms: Public domain | W3C validator |