src/HOL/Tools/atp-inputs/u_combBC_e.tptp

added lemmas about LIMSEQ and norm; simplified some proofs

%ID: $Id$
%Author: Jia Meng, NICTA
%untyped combinator reduction for B', C'

%B' c f g x -->  c (f (g x))
input_clause(a6,axiom,
[++equal(hAPP(hAPP(hAPP(hAPP(c_COMBB__e,C),F),G),X),hAPP(C,hAPP(F,hAPP(G,X))))]).

%C' c f g x --> c (f x) g
input_clause(a7,axiom,
[++equal(hAPP(hAPP(hAPP(hAPP(c_COMBC__e,C),F),G),X),hAPP(hAPP(C,hAPP(F,X)),G))]).