MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfrdg Structured version   Visualization version   GIF version

Theorem nfrdg 8406
Description: Bound-variable hypothesis builder for the recursive definition generator. (Contributed by NM, 14-Sep-2003.) (Revised by Mario Carneiro, 8-Sep-2013.)
Hypotheses
Ref Expression
nfrdg.1 Ⅎ𝑥𝐹
nfrdg.2 Ⅎ𝑥𝐴
Assertion
Ref Expression
nfrdg Ⅎ𝑥rec(𝐹, 𝐴)

Proof of Theorem nfrdg
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 df-rdg 8402 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
2 nfcv 2923 . . . 4 Ⅎ𝑥V
3 nfv 1947 . . . . 5 Ⅎ𝑥 𝑔 = ∅
4 nfrdg.2 . . . . 5 Ⅎ𝑥𝐴
5 nfv 1947 . . . . . 6 Ⅎ𝑥Lim dom 𝑔
6 nfcv 2923 . . . . . 6 Ⅎ𝑥∪ ran 𝑔
7 nfrdg.1 . . . . . . 7 Ⅎ𝑥𝐹
8 nfcv 2923 . . . . . . 7 Ⅎ𝑥(𝑔‘∪ dom 𝑔)
97, 8nffv 6887 . . . . . 6 Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔))
105, 6, 9nfif 4513 . . . . 5 Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))
113, 4, 10nfif 4513 . . . 4 Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))
122, 11nfmpt 5203 . . 3 Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))
1312nfrecs 8366 . 2 Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
141, 13nfcxfr 2921 1 Ⅎ𝑥rec(𝐹, 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Ⅎwnfc 2908  Vcvv 3451  ∅c0 4279  ifcif 4482  ∪ cuni 4867   ↦ cmpt 5186  dom cdm 5651  ran crn 5652  Lim wlim 6356  ‘cfv 6531  recscrecs 8362  reccrdg 8401
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
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 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-xp 5657  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-iota 6487  df-fv 6539  df-ov 7415  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402
This theorem is used by:  rdgsucmptf  8420  rdgsucmptnf  8421  frsucmpt  8430  frsucmptn  8431  ttrclselem1  9710  ttrclselem2  9711  nfseq  14134  nfseqs  28655  rdgssun  38269  exrecfnlem  38270  finxpreclem6  38287
  Copyright terms: Public domain W3C validator