ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nffrec Unicode version

Theorem nffrec 6605
Description: Bound-variable hypothesis builder for the finite recursive definition generator. (Contributed by Jim Kingdon, 30-May-2020.)
Hypotheses
Ref Expression
nffrec.1  |-  F/_ x F
nffrec.2  |-  F/_ x A
Assertion
Ref Expression
nffrec  |-  F/_ xfrec ( F ,  A )

Proof of Theorem nffrec
Dummy variables  g  m  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-frec 6600 . 2  |- frec ( F ,  A )  =  (recs ( ( g  e.  _V  |->  { y  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } ) )  |`  om )
2 nfcv 2375 . . . . 5  |-  F/_ x _V
3 nfcv 2375 . . . . . . . 8  |-  F/_ x om
4 nfv 1577 . . . . . . . . 9  |-  F/ x dom  g  =  suc  m
5 nffrec.1 . . . . . . . . . . 11  |-  F/_ x F
6 nfcv 2375 . . . . . . . . . . 11  |-  F/_ x
( g `  m
)
75, 6nffv 5658 . . . . . . . . . 10  |-  F/_ x
( F `  (
g `  m )
)
87nfcri 2369 . . . . . . . . 9  |-  F/ x  y  e.  ( F `  ( g `  m
) )
94, 8nfan 1614 . . . . . . . 8  |-  F/ x
( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )
103, 9nfrexya 2574 . . . . . . 7  |-  F/ x E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  ( g `
 m ) ) )
11 nfv 1577 . . . . . . . 8  |-  F/ x dom  g  =  (/)
12 nffrec.2 . . . . . . . . 9  |-  F/_ x A
1312nfcri 2369 . . . . . . . 8  |-  F/ x  y  e.  A
1411, 13nfan 1614 . . . . . . 7  |-  F/ x
( dom  g  =  (/) 
/\  y  e.  A
)
1510, 14nfor 1623 . . . . . 6  |-  F/ x
( E. m  e. 
om  ( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) )
1615nfab 2380 . . . . 5  |-  F/_ x { y  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) }
172, 16nfmpt 4186 . . . 4  |-  F/_ x
( g  e.  _V  |->  { y  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } )
1817nfrecs 6516 . . 3  |-  F/_ xrecs ( ( g  e. 
_V  |->  { y  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } ) )
1918, 3nfres 5021 . 2  |-  F/_ x
(recs ( ( g  e.  _V  |->  { y  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) } ) )  |`  om )
201, 19nfcxfr 2372 1  |-  F/_ xfrec ( F ,  A )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    \/ wo 716    = wceq 1398    e. wcel 2202   {cab 2217   F/_wnfc 2362   E.wrex 2512   _Vcvv 2803   (/)c0 3496    |-> cmpt 4155   suc csuc 4468   omcom 4694   dom cdm 4731    |` cres 4733   ` cfv 5333  recscrecs 6513  freccfrec 6599
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-un 3205  df-in 3207  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-xp 4737  df-res 4743  df-iota 5293  df-fv 5341  df-recs 6514  df-frec 6600
This theorem is referenced by:  nfseq  10782
  Copyright terms: Public domain W3C validator