%   ORIGINAL: 'h4/thm/rich_list/IS_SUBLIST_REVERSE_'
% 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: !l1 l2. 'h4/const/rich_list/IS_SUBLIST' ('h4/const/list/REVERSE' l1) ('h4/const/list/REVERSE' l2) <=> 'h4/const/rich_list/IS_SUBLIST' l1 l2
%   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: !l1 l2. 'h4/const/rich_list/IS_SUBLIST' ('h4/const/list/REVERSE' l1) ('h4/const/list/REVERSE' l2) <=> 'h4/const/rich_list/IS_SUBLIST' l1 l2
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_3f52211,V_3f52207]: ![F, G]: (![X]: s(V_3f52207,happ(s(fun(V_3f52211,V_3f52207),F),s(V_3f52211,X))) = s(V_3f52207,happ(s(fun(V_3f52211,V_3f52207),G),s(V_3f52211,X))) => s(fun(V_3f52211,V_3f52207),F) = s(fun(V_3f52211,V_3f52207),G))).
fof('h4/thm/rich_list/IS_SUBLIST_REVERSE_', conjecture, ![A]: ![L1, L2]: s(bool,'h4/const/rich_list/IS_SUBLIST'(s('h4/type/list/list'(A),'h4/const/list/REVERSE'(s('h4/type/list/list'(A),L1))),s('h4/type/list/list'(A),'h4/const/list/REVERSE'(s('h4/type/list/list'(A),L2))))) = s(bool,'h4/const/rich_list/IS_SUBLIST'(s('h4/type/list/list'(A),L1),s('h4/type/list/list'(A),L2)))).
