src/HOL/Tools/atp-inputs/par_combS_e.dfg

added lemmas about LIMSEQ and norm; simplified some proofs

%ID: $Id$
%Author: Jia Meng, NICTA
%partial-typed combinator reduction for S'

clause(
forall([A, B, C, F, G, U, V, X],
or( equal(hAPP(hAPP(hAPP(hAPP(c_COMBS__e,C,tc_fun(tc_fun(A,tc_fun(B,U)),tc_fun(tc_fun(V,A),tc_fun(tc_fun(V,B),tc_fun(V,U))))),F,tc_fun(tc_fun(V,A),tc_fun(tc_fun(V,B),tc_fun(V,U)))),G,tc_fun(tc_fun(V,B),tc_fun(V,U))),X,tc_fun(V,U)),hAPP(hAPP(C,hAPP(F,X,tc_fun(V,A)),tc_fun(A,tc_fun(B,U))),hAPP(G,X,tc_fun(V,B)),tc_fun(B,U))))),
a8 ).