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

Theorem nfiota1 5295
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 5294 . 2  |-  ( iota
x ph )  =  U. { y  |  A. x ( ph  <->  x  =  y ) }
2 nfaba1 2381 . . 3  |-  F/_ x { y  |  A. x ( ph  <->  x  =  y ) }
32nfuni 3904 . 2  |-  F/_ x U. { y  |  A. x ( ph  <->  x  =  y ) }
41, 3nfcxfr 2372 1  |-  F/_ x
( iota x ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 105   A.wal 1396   {cab 2217   F/_wnfc 2362   U.cuni 3898   iotacio 5291
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-sn 3679  df-uni 3899  df-iota 5293
This theorem is referenced by:  iota2df  5319  sniota  5324  nfriota1  5989  erovlem  6839
  Copyright terms: Public domain W3C validator