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

Theorem nfsn 3693
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 3647 . 2  |-  { A }  =  { A ,  A }
2 nfsn.1 . . 3  |-  F/_ x A
32, 2nfpr 3683 . 2  |-  F/_ x { A ,  A }
41, 3nfcxfr 2345 1  |-  F/_ x { A }
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2335   {csn 3633   {cpr 3634
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640
This theorem is referenced by:  nfop  3835  nfsuc  4455  sniota  5262  dfmpo  6309
  Copyright terms: Public domain W3C validator