%   ORIGINAL: 'h4/thm/rich_list/MEM_FOLDR_'
% Assm: HL_TRUTH: T
% Assm: HL_FALSITY: ~F
% Assm: HL_BOOL_CASES: !t. (t <=> T) \/ (t <=> F)
% Assm: HL_EXT: !f g. (!x. f x = g x) ==> f = g
% Goal: !y l. 'h4/const/bool/IN' y ('h4/const/list/LIST_TO_SET' l) <=> 'h4/const/list/FOLDR' (\x 'l\''. y = x \/ 'l\'') F l
%   PROCESSED
% Assm ['HL_TRUTH']: T
% Assm ['HL_FALSITY']: ~F
% Assm ['HL_BOOL_CASES']: !t. (t <=> T) \/ (t <=> F)
% Assm ['HL_EXT']: !f g. (!x. happ f x = happ g x) ==> f = g
% Goal: !_1. (!y x 'l\''. happ (happ (happ _1 y) x) 'l\'' <=> y = x \/ 'l\'') ==> (!_0. (!y x. happ (happ _0 y) x = happ (happ _1 y) x) ==> (!y l. 'h4/const/bool/IN' y ('h4/const/list/LIST_TO_SET' l) <=> 'h4/const/list/FOLDR' (happ _0 y) F l))
fof('HL_TRUTH', axiom, p(s(bool,'T'))).
fof('HL_FALSITY', axiom, ~ (p(s(bool,'F')))).
fof('HL_BOOL_CASES', axiom, ![T]: (s(bool,T) = s(bool,'T') | s(bool,T) = s(bool,'F'))).
fof('HL_EXT', axiom, ![V_3f53111,V_3f53107]: ![F, G]: (![X]: s(V_3f53107,happ(s(fun(V_3f53111,V_3f53107),F),s(V_3f53111,X))) = s(V_3f53107,happ(s(fun(V_3f53111,V_3f53107),G),s(V_3f53111,X))) => s(fun(V_3f53111,V_3f53107),F) = s(fun(V_3f53111,V_3f53107),G))).
fof('h4/thm/rich_list/MEM_FOLDR_', conjecture, ![A]: ![V__1]: (![Y, X, V_27l_5c_27_27]: (p(s(bool,happ(s(fun(bool,bool),happ(s(fun(A,fun(bool,bool)),happ(s(fun(A,fun(A,fun(bool,bool))),V__1),s(A,Y))),s(A,X))),s(bool,V_27l_5c_27_27)))) <=> (s(A,Y) = s(A,X) | p(s(bool,V_27l_5c_27_27)))) => ![V__0]: (![Y, X]: s(fun(bool,bool),happ(s(fun(A,fun(bool,bool)),happ(s(fun(A,fun(A,fun(bool,bool))),V__0),s(A,Y))),s(A,X))) = s(fun(bool,bool),happ(s(fun(A,fun(bool,bool)),happ(s(fun(A,fun(A,fun(bool,bool))),V__1),s(A,Y))),s(A,X))) => ![Y, L]: s(bool,'h4/const/bool/IN'(s(A,Y),s(fun(A,bool),'h4/const/list/LIST_TO_SET'(s('h4/type/list/list'(A),L))))) = s(bool,'h4/const/list/FOLDR'(s(fun(A,fun(bool,bool)),happ(s(fun(A,fun(A,fun(bool,bool))),V__0),s(A,Y))),s(bool,'F'),s('h4/type/list/list'(A),L)))))).
