| 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 8342 | . 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
| 2 | nfcv 2899 | . . . 4 ⊢ Ⅎ𝑥V | |
| 3 | nfv 1916 | . . . . 5 ⊢ Ⅎ𝑥 𝑔 = ∅ | |
| 4 | nfrdg.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 5 | nfv 1916 | . . . . . 6 ⊢ Ⅎ𝑥Lim dom 𝑔 | |
| 6 | nfcv 2899 | . . . . . 6 ⊢ Ⅎ𝑥∪ ran 𝑔 | |
| 7 | nfrdg.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐹 | |
| 8 | nfcv 2899 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑔‘∪ dom 𝑔) | |
| 9 | 7, 8 | nffv 6844 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔)) |
| 10 | 5, 6, 9 | nfif 4498 | . . . . 5 ⊢ Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))) |
| 11 | 3, 4, 10 | nfif 4498 | . . . 4 ⊢ Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))) |
| 12 | 2, 11 | nfmpt 5184 | . . 3 ⊢ Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) |
| 13 | 12 | nfrecs 8307 | . 2 ⊢ Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) |
| 14 | 1, 13 | nfcxfr 2897 | 1 ⊢ Ⅎ𝑥rec(𝐹, 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 Ⅎwnfc 2884 Vcvv 3430 ∅c0 4274 ifcif 4467 ∪ cuni 4851 ↦ cmpt 5167 dom cdm 5624 ran crn 5625 Lim wlim 6318 ‘cfv 6492 recscrecs 8303 reccrdg 8341 |
| 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 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-xp 5630 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-iota 6448 df-fv 6500 df-ov 7363 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 |
| This theorem is referenced by: rdgsucmptf 8360 rdgsucmptnf 8361 frsucmpt 8370 frsucmptn 8371 ttrclselem1 9637 ttrclselem2 9638 nfseq 13964 nfseqs 28293 rdgssun 37708 exrecfnlem 37709 finxpreclem6 37726 |
| Copyright terms: Public domain | W3C validator |