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

Theorem nfrecs 5922
Description: Bound-variable hypothesis builder for recs. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypothesis
Ref Expression
nfrecs.f  |-  F/_ x F
Assertion
Ref Expression
nfrecs  |-  F/_ xrecs ( F )

Proof of Theorem nfrecs
Dummy variables  a  b  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-recs 5920 . 2  |- recs ( F )  =  U. {
a  |  E. b  e.  On  ( a  Fn  b  /\  A. c  e.  b  ( a `  c )  =  ( F `  ( a  |`  c ) ) ) }
2 nfcv 2178 . . . . 5  |-  F/_ x On
3 nfv 1421 . . . . . 6  |-  F/ x  a  Fn  b
4 nfcv 2178 . . . . . . 7  |-  F/_ x
b
5 nfrecs.f . . . . . . . . 9  |-  F/_ x F
6 nfcv 2178 . . . . . . . . 9  |-  F/_ x
( a  |`  c
)
75, 6nffv 5185 . . . . . . . 8  |-  F/_ x
( F `  (
a  |`  c ) )
87nfeq2 2189 . . . . . . 7  |-  F/ x
( a `  c
)  =  ( F `
 ( a  |`  c ) )
94, 8nfralxy 2360 . . . . . 6  |-  F/ x A. c  e.  b 
( a `  c
)  =  ( F `
 ( a  |`  c ) )
103, 9nfan 1457 . . . . 5  |-  F/ x
( a  Fn  b  /\  A. c  e.  b  ( a `  c
)  =  ( F `
 ( a  |`  c ) ) )
112, 10nfrexxy 2361 . . . 4  |-  F/ x E. b  e.  On  ( a  Fn  b  /\  A. c  e.  b  ( a `  c
)  =  ( F `
 ( a  |`  c ) ) )
1211nfab 2182 . . 3  |-  F/_ x { a  |  E. b  e.  On  (
a  Fn  b  /\  A. c  e.  b  ( a `  c )  =  ( F `  ( a  |`  c
) ) ) }
1312nfuni 3586 . 2  |-  F/_ x U. { a  |  E. b  e.  On  (
a  Fn  b  /\  A. c  e.  b  ( a `  c )  =  ( F `  ( a  |`  c
) ) ) }
141, 13nfcxfr 2175 1  |-  F/_ xrecs ( F )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    = wceq 1243   {cab 2026   F/_wnfc 2165   A.wral 2306   E.wrex 2307   U.cuni 3580   Oncon0 4100    |` cres 4347    Fn wfn 4897   ` cfv 4902  recscrecs 5919
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-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910  df-recs 5920
This theorem is referenced by:  nffrec  5982
  Copyright terms: Public domain W3C validator