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

Theorem nfsuc 4233
Description: Bound-variable hypothesis builder for successor. (Contributed by NM, 15-Sep-2003.)
Hypothesis
Ref Expression
nfsuc.1  |-  F/_ x A
Assertion
Ref Expression
nfsuc  |-  F/_ x  suc  A

Proof of Theorem nfsuc
StepHypRef Expression
1 df-suc 4196 . 2  |-  suc  A  =  ( A  u.  { A } )
2 nfsuc.1 . . 3  |-  F/_ x A
32nfsn 3500 . . 3  |-  F/_ x { A }
42, 3nfun 3156 . 2  |-  F/_ x
( A  u.  { A } )
51, 4nfcxfr 2225 1  |-  F/_ x  suc  A
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2215    u. cun 2997   {csn 3444   suc csuc 4190
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-un 3003  df-sn 3450  df-pr 3451  df-suc 4196
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator