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

Theorem nffrec 5982
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 5978 . 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 2178 . . . . 5  |-  F/_ x _V
3 nfcv 2178 . . . . . . . 8  |-  F/_ x om
4 nfv 1421 . . . . . . . . 9  |-  F/ x dom  g  =  suc  m
5 nffrec.1 . . . . . . . . . . 11  |-  F/_ x F
6 nfcv 2178 . . . . . . . . . . 11  |-  F/_ x
( g `  m
)
75, 6nffv 5185 . . . . . . . . . 10  |-  F/_ x
( F `  (
g `  m )
)
87nfcri 2172 . . . . . . . . 9  |-  F/ x  y  e.  ( F `  ( g `  m
) )
94, 8nfan 1457 . . . . . . . 8  |-  F/ x
( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )
103, 9nfrexya 2363 . . . . . . 7  |-  F/ x E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  ( g `
 m ) ) )
11 nfv 1421 . . . . . . . 8  |-  F/ x dom  g  =  (/)
12 nffrec.2 . . . . . . . . 9  |-  F/_ x A
1312nfcri 2172 . . . . . . . 8  |-  F/ x  y  e.  A
1411, 13nfan 1457 . . . . . . 7  |-  F/ x
( dom  g  =  (/) 
/\  y  e.  A
)
1510, 14nfor 1466 . . . . . 6  |-  F/ x
( E. m  e. 
om  ( dom  g  =  suc  m  /\  y  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) )
1615nfab 2182 . . . . 5  |-  F/_ x { y  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  y  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  y  e.  A ) ) }
172, 16nfmpt 3849 . . . 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 5922 . . 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 4614 . 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 2175 1  |-  F/_ xfrec ( F ,  A )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    \/ wo 629    = wceq 1243    e. wcel 1393   {cab 2026   F/_wnfc 2165   E.wrex 2307   _Vcvv 2557   (/)c0 3224    |-> cmpt 3818   suc csuc 4102   omcom 4313   dom cdm 4345    |` cres 4347   ` cfv 4902  recscrecs 5919  freccfrec 5977
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-un 2922  df-in 2924  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-xp 4351  df-res 4357  df-iota 4867  df-fv 4910  df-recs 5920  df-frec 5978
This theorem is referenced by:  nfiseq  9218
  Copyright terms: Public domain W3C validator