| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfrdg | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for the recursive definition generator. (Contributed by NM, 14-Sep-2003.) (Revised by Mario Carneiro, 8-Sep-2013.) |
| Ref | Expression |
|---|---|
| nfrdg.1 | ⊢ Ⅎ𝑥𝐹 |
| nfrdg.2 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| nfrdg | ⊢ Ⅎ𝑥rec(𝐹, 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rdg 8406 | . 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
| 2 | nfcv 2928 | . . . 4 ⊢ Ⅎ𝑥V | |
| 3 | nfv 1947 | . . . . 5 ⊢ Ⅎ𝑥 𝑔 = ∅ | |
| 4 | nfrdg.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 5 | nfv 1947 | . . . . . 6 ⊢ Ⅎ𝑥Lim dom 𝑔 | |
| 6 | nfcv 2928 | . . . . . 6 ⊢ Ⅎ𝑥∪ ran 𝑔 | |
| 7 | nfrdg.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐹 | |
| 8 | nfcv 2928 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑔‘∪ dom 𝑔) | |
| 9 | 7, 8 | nffv 6898 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔)) |
| 10 | 5, 6, 9 | nfif 4523 | . . . . 5 ⊢ Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))) |
| 11 | 3, 4, 10 | nfif 4523 | . . . 4 ⊢ Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))) |
| 12 | 2, 11 | nfmpt 5214 | . . 3 ⊢ Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) |
| 13 | 12 | nfrecs 8370 | . 2 ⊢ Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) |
| 14 | 1, 13 | nfcxfr 2926 | 1 ⊢ Ⅎ𝑥rec(𝐹, 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Ⅎwnfc 2913 Vcvv 3458 ∅c0 4289 ifcif 4492 ∪ cuni 4877 ↦ cmpt 5197 dom cdm 5666 ran crn 5667 Lim wlim 6368 ‘cfv 6543 recscrecs 8366 reccrdg 8405 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-xp 5672 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-iota 6499 df-fv 6551 df-ov 7426 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 |
| This theorem is used by: rdgsucmptf 8424 rdgsucmptnf 8425 frsucmpt 8434 frsucmptn 8435 ttrclselem1 9704 ttrclselem2 9705 nfseq 14067 nfseqs 28517 rdgssun 38065 exrecfnlem 38066 finxpreclem6 38083 |
| Copyright terms: Public domain | W3C validator |