%   ORIGINAL: h4/while/LEAST__EXISTS__IMP
% 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
% Assm: h4/bool/TRUTH: T
% Assm: h4/bool/FORALL__SIMP: !t. (!x. t) <=> t
% Assm: h4/bool/IMP__CLAUSES_c3: !t. t ==> t <=> T
% Assm: h4/while/LEAST__EXISTS: !p. (?n. p n) <=> p (h4/while/LEAST p) /\ (!n. h4/prim__rec/_3C n (h4/while/LEAST p) ==> ~p n)
% Goal: !p. (?n. p n) ==> p (h4/while/LEAST p) /\ (!n. h4/prim__rec/_3C n (h4/while/LEAST p) ==> ~p n)
%   PROCESSED
% Assm [HLu_TRUTH]: T
% Assm [HLu_FALSITY]: ~F
% Assm [HLu_BOOLu_CASES]: !t. (t <=> T) \/ (t <=> F)
% Assm [HLu_EXT]: !f g. (!x. happ f x = happ g x) ==> f = g
% Assm [h4s_bools_TRUTH]: T
% Assm [h4s_bools_FORALLu_u_SIMP]: !t. (!x. t) <=> t
% Assm [h4s_bools_IMPu_u_CLAUSESu_c3]: !t. t ==> t <=> T
% Assm [h4s_whiles_LEASTu_u_EXISTS]: !p. (?n. happ p n) <=> happ p (h4/while/LEAST p) /\ (!n. h4/prim__rec/_3C n (h4/while/LEAST p) ==> ~happ p n)
% Goal: !p. (?n. happ p n) ==> happ p (h4/while/LEAST p) /\ (!n. h4/prim__rec/_3C n (h4/while/LEAST p) ==> ~happ p n)
fof(aHLu_TRUTH, axiom, p(s(t_bool,t))).
fof(aHLu_FALSITY, axiom, ~ (p(s(t_bool,f)))).
fof(aHLu_BOOLu_CASES, axiom, ![V_t]: (s(t_bool,V_t) = s(t_bool,t) | s(t_bool,V_t) = s(t_bool,f))).
fof(aHLu_EXT, axiom, ![TV_Q236563,TV_Q236559]: ![V_f, V_g]: (![V_x]: s(TV_Q236559,happ(s(t_fun(TV_Q236563,TV_Q236559),V_f),s(TV_Q236563,V_x))) = s(TV_Q236559,happ(s(t_fun(TV_Q236563,TV_Q236559),V_g),s(TV_Q236563,V_x))) => s(t_fun(TV_Q236563,TV_Q236559),V_f) = s(t_fun(TV_Q236563,TV_Q236559),V_g))).
fof(ah4s_bools_TRUTH, axiom, p(s(t_bool,t))).
fof(ah4s_bools_FORALLu_u_SIMP, axiom, ![TV_u_27a]: ![V_t]: (![V_x]: p(s(t_bool,V_t)) <=> p(s(t_bool,V_t)))).
fof(ah4s_bools_IMPu_u_CLAUSESu_c3, axiom, ![V_t]: ((p(s(t_bool,V_t)) => p(s(t_bool,V_t))) <=> p(s(t_bool,t)))).
fof(ah4s_whiles_LEASTu_u_EXISTS, axiom, ![V_p]: (?[V_n]: p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,V_n)))) <=> (p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),V_p)))))) & ![V_n]: (p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,V_n),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),V_p)))))) => ~ (p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,V_n))))))))).
fof(ch4s_whiles_LEASTu_u_EXISTSu_u_IMP, conjecture, ![V_p]: (?[V_n]: p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,V_n)))) => (p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),V_p)))))) & ![V_n]: (p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,V_n),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),V_p)))))) => ~ (p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),V_p),s(t_h4s_nums_num,V_n))))))))).
