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

Theorem nfrdg 8453
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 8449 . 2 rec(𝐹, 𝐴) = recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
2 nfcv 2926 . . . 4 Ⅎ𝑥V
3 nfv 1949 . . . . 5 Ⅎ𝑥 𝑔 = ∅
4 nfrdg.2 . . . . 5 Ⅎ𝑥𝐴
5 nfv 1949 . . . . . 6 Ⅎ𝑥Lim dom 𝑔
6 nfcv 2926 . . . . . 6 Ⅎ𝑥∪ ran 𝑔
7 nfrdg.1 . . . . . . 7 Ⅎ𝑥𝐹
8 nfcv 2926 . . . . . . 7 Ⅎ𝑥(𝑔‘∪ dom 𝑔)
97, 8nffv 6921 . . . . . 6 Ⅎ𝑥(𝐹‘(𝑔‘∪ dom 𝑔))
105, 6, 9nfif 4516 . . . . 5 Ⅎ𝑥if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))
113, 4, 10nfif 4516 . . . 4 Ⅎ𝑥if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))
122, 11nfmpt 5207 . . 3 Ⅎ𝑥(𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔)))))
1312nfrecs 8413 . 2 Ⅎ𝑥recs((𝑔 ∈ V ↦ if(𝑔 = ∅, 𝐴, if(Lim dom 𝑔, ∪ ran 𝑔, (𝐹‘(𝑔‘∪ dom 𝑔))))))
141, 13nfcxfr 2924 1 Ⅎ𝑥rec(𝐹, 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Ⅎwnfc 2911  Vcvv 3454  ∅c0 4281  ifcif 4485  ∪ cuni 4870   ↦ cmpt 5190  dom cdm 5656  ran crn 5657  Lim wlim 6384  ‘cfv 6561  recscrecs 8409  reccrdg 8448
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-xp 5662  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-iota 6515  df-fv 6569  df-ov 7449  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449
This theorem is used by:  rdgsucmptf  8467  rdgsucmptnf  8468  frsucmpt  8477  frsucmptn  8478  ttrclselem1  9756  ttrclselem2  9757  nfseq  14184  nfseqs  28706  rdgssun  38506  exrecfnlem  38507  finxpreclem6  38524
  Copyright terms: Public domain W3C validator