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

Theorem nfsn 3583
Description: Bound-variable hypothesis builder for singletons. (Contributed by NM, 14-Nov-1995.)
Hypothesis
Ref Expression
nfsn.1  |-  F/_ x A
Assertion
Ref Expression
nfsn  |-  F/_ x { A }

Proof of Theorem nfsn
StepHypRef Expression
1 dfsn2 3541 . 2  |-  { A }  =  { A ,  A }
2 nfsn.1 . . 3  |-  F/_ x A
32, 2nfpr 3573 . 2  |-  F/_ x { A ,  A }
41, 3nfcxfr 2278 1  |-  F/_ x { A }
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2268   {csn 3527   {cpr 3528
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534
This theorem is referenced by:  nfop  3721  nfsuc  4330  sniota  5115  dfmpo  6120
  Copyright terms: Public domain W3C validator