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

Theorem nfrdg 8426
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 8422 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
2 nfcv 2922 . . . 4 Ⅎ𝑥V
3 nfv 1946 . . . . 5 Ⅎ𝑥 𝑔 = ∅
4 nfrdg.2 . . . . 5 Ⅎ𝑥𝐴
5 nfv 1946 . . . . . 6 Ⅎ𝑥Lim dom 𝑔
6 nfcv 2922 . . . . . 6 Ⅎ𝑥∪ ran 𝑔
7 nfrdg.1 . . . . . . 7 Ⅎ𝑥𝐹
8 nfcv 2922 . . . . . . 7 Ⅎ𝑥(𝑔‘∪ dom 𝑔)
97, 8nffv 6896 . . . . . 6 Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔))
105, 6, 9nfif 4512 . . . . 5 Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))
113, 4, 10nfif 4512 . . . 4 Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))
122, 11nfmpt 5202 . . 3 Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))
1312nfrecs 8386 . 2 Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
141, 13nfcxfr 2920 1 Ⅎ𝑥rec(𝐹, 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  Ⅎwnfc 2907  Vcvv 3450  ∅c0 4278  ifcif 4481  ∪ cuni 4866   ↦ cmpt 5185  dom cdm 5650  ran crn 5651  Lim wlim 6363  ‘cfv 6539  recscrecs 8382  reccrdg 8421
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-xp 5656  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-iota 6494  df-fv 6547  df-ov 7424  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422
This theorem is used by:  rdgsucmptf  8440  rdgsucmptnf  8441  frsucmpt  8450  frsucmptn  8451  ttrclselem1  9730  ttrclselem2  9731  nfseq  14158  nfseqs  28679  rdgssun  38395  exrecfnlem  38396  finxpreclem6  38413
  Copyright terms: Public domain W3C validator