 t else f fi == InjCase(b ; t; f)
 t else f fi == InjCase(b ; t; f)is mentioned by
|  x,y:A, P:(A   Prop), i,j:  . Thm* P(if i=  j  x else y fi)   P(if i=  j  x else y fi) | [eq_int_cases_test] | 
|  f:(S   T), b:  , p,q:S. f(if b  p else q fi) = if b  f(p) else f(q) fi | [fun_thru_ite] | 
|  b:  , x,y:T. b   if b  x else y fi = x | [ite_rw_true] | 
|  b:  , x,y:T.  b   if b  x else y fi = y | [ite_rw_false] | 
|   q == if p  true  else q fi | [bor] | 
|   q == if p  q else false  fi | [band] | 
|   b == if b  false  else true  fi | [bnot] | 
|  1 else 0 fi | [b2i] | 
|  b == if b  True else False fi | [assert] | 
Try larger context:
 
StandardLIB
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html