| 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 8378 | . 2 ⊢ rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) | |
| 2 | nfcv 2891 | . . . 4 ⊢ Ⅎ𝑥V | |
| 3 | nfv 1914 | . . . . 5 ⊢ Ⅎ𝑥 𝑔 = ∅ | |
| 4 | nfrdg.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 5 | nfv 1914 | . . . . . 6 ⊢ Ⅎ𝑥Lim dom 𝑔 | |
| 6 | nfcv 2891 | . . . . . 6 ⊢ Ⅎ𝑥∪ ran 𝑔 | |
| 7 | nfrdg.1 | . . . . . . 7 ⊢ Ⅎ𝑥𝐹 | |
| 8 | nfcv 2891 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑔‘∪ dom 𝑔) | |
| 9 | 7, 8 | nffv 6868 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔)) |
| 10 | 5, 6, 9 | nfif 4519 | . . . . 5 ⊢ Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))) |
| 11 | 3, 4, 10 | nfif 4519 | . . . 4 ⊢ Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))) |
| 12 | 2, 11 | nfmpt 5205 | . . 3 ⊢ Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))) |
| 13 | 12 | nfrecs 8343 | . 2 ⊢ Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))) |
| 14 | 1, 13 | nfcxfr 2889 | 1 ⊢ Ⅎ𝑥rec(𝐹, 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 Ⅎwnfc 2876 Vcvv 3447 ∅c0 4296 ifcif 4488 ∪ cuni 4871 ↦ cmpt 5188 dom cdm 5638 ran crn 5639 Lim wlim 6333 ‘cfv 6511 recscrecs 8339 reccrdg 8377 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-xp 5644 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-iota 6464 df-fv 6519 df-ov 7390 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 |
| This theorem is referenced by: rdgsucmptf 8396 rdgsucmptnf 8397 frsucmpt 8406 frsucmptn 8407 ttrclselem1 9678 ttrclselem2 9679 nfseq 13976 nfseqs 28181 rdgssun 37366 exrecfnlem 37367 finxpreclem6 37384 |
| Copyright terms: Public domain | W3C validator |