src/HOL/Fun.ML
changeset 1465 5d7a7e439cec
parent 1264 3eb91524b938
child 1561 9ba6d69f7763
     1.1 --- a/src/HOL/Fun.ML	Tue Jan 30 15:19:20 1996 +0100
     1.2 +++ b/src/HOL/Fun.ML	Tue Jan 30 15:24:36 1996 +0100
     1.3 @@ -1,6 +1,6 @@
     1.4 -(*  Title: 	HOL/Fun
     1.5 +(*  Title:      HOL/Fun
     1.6      ID:         $Id$
     1.7 -    Author: 	Tobias Nipkow, Cambridge University Computer Laboratory
     1.8 +    Author:     Tobias Nipkow, Cambridge University Computer Laboratory
     1.9      Copyright   1993  University of Cambridge
    1.10  
    1.11  Lemmas about functions.
    1.12 @@ -166,7 +166,7 @@
    1.13      "[| inj(f);  A<=range(f) |] ==> inj_onto (Inv f) A";
    1.14  by (cut_facts_tac prems 1);
    1.15  by (fast_tac (HOL_cs addIs [inj_ontoI] 
    1.16 -		     addEs [Inv_injective,injD,subsetD]) 1);
    1.17 +                     addEs [Inv_injective,injD,subsetD]) 1);
    1.18  qed "inj_onto_Inv";
    1.19  
    1.20  
    1.21 @@ -174,12 +174,12 @@
    1.22  
    1.23  val set_cs = HOL_cs 
    1.24      addSIs [ballI, PowI, subsetI, InterI, INT_I, INT1_I, CollectI, 
    1.25 -	    ComplI, IntI, DiffI, UnCI, insertCI] 
    1.26 +            ComplI, IntI, DiffI, UnCI, insertCI] 
    1.27      addIs  [bexI, UnionI, UN_I, UN1_I, imageI, rangeI] 
    1.28      addSEs [bexE, make_elim PowD, UnionE, UN_E, UN1_E, DiffE,
    1.29 -	    CollectE, ComplE, IntE, UnE, insertE, imageE, rangeE, emptyE] 
    1.30 +            CollectE, ComplE, IntE, UnE, insertE, imageE, rangeE, emptyE] 
    1.31      addEs  [ballE, InterD, InterE, INT_D, INT_E, make_elim INT1_D,
    1.32 -	    subsetD, subsetCE];
    1.33 +            subsetD, subsetCE];
    1.34  
    1.35  fun cfast_tac prems = cut_facts_tac prems THEN' fast_tac set_cs;
    1.36