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

Theorem nfiota1 5179
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 5178 . 2  |-  ( iota
x ph )  =  U. { y  |  A. x ( ph  <->  x  =  y ) }
2 nfaba1 2325 . . 3  |-  F/_ x { y  |  A. x ( ph  <->  x  =  y ) }
32nfuni 3815 . 2  |-  F/_ x U. { y  |  A. x ( ph  <->  x  =  y ) }
41, 3nfcxfr 2316 1  |-  F/_ x
( iota x ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 105   A.wal 1351   {cab 2163   F/_wnfc 2306   U.cuni 3809   iotacio 5175
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-sn 3598  df-uni 3810  df-iota 5177
This theorem is referenced by:  iota2df  5201  sniota  5206  nfriota1  5835  erovlem  6624
  Copyright terms: Public domain W3C validator