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

Theorem nfiota1 4889
Description: Bound-variable hypothesis builder for the  iota class. (Contributed by Andrew Salmon, 11-Jul-2011.) (Revised by Mario Carneiro, 15-Oct-2016.)
Assertion
Ref Expression
nfiota1  |-  F/_ x
( iota x ph )

Proof of Theorem nfiota1
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 dfiota2 4888 . 2  |-  ( iota
x ph )  =  U. { y  |  A. x ( ph  <->  x  =  y ) }
2 nfaba1 2224 . . 3  |-  F/_ x { y  |  A. x ( ph  <->  x  =  y ) }
32nfuni 3607 . 2  |-  F/_ x U. { y  |  A. x ( ph  <->  x  =  y ) }
41, 3nfcxfr 2216 1  |-  F/_ x
( iota x ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 103   A.wal 1282   {cab 2067   F/_wnfc 2206   U.cuni 3601   iotacio 4885
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 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rex 2354  df-sn 3404  df-uni 3602  df-iota 4887
This theorem is referenced by:  iota2df  4911  sniota  4914  nfriota1  5495  erovlem  6221
  Copyright terms: Public domain W3C validator