%   ORIGINAL: h4/prelim/num2ordering__thm_c1
% 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/prelim/EQUAL__def: h4/prelim/EQUAL = h4/prelim/num2ordering (h4/arithmetic/NUMERAL (h4/arithmetic/BIT1 h4/arithmetic/ZERO))
% Goal: h4/prelim/num2ordering (h4/arithmetic/NUMERAL (h4/arithmetic/BIT1 h4/arithmetic/ZERO)) = h4/prelim/EQUAL
%   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_prelims_EQUALu_u_def]: h4/prelim/EQUAL = h4/prelim/num2ordering (h4/arithmetic/NUMERAL (h4/arithmetic/BIT1 h4/arithmetic/ZERO))
% Goal: h4/prelim/num2ordering (h4/arithmetic/NUMERAL (h4/arithmetic/BIT1 h4/arithmetic/ZERO)) = h4/prelim/EQUAL
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_Q188445,TV_Q188441]: ![V_f, V_g]: (![V_x]: s(TV_Q188441,happ(s(t_fun(TV_Q188445,TV_Q188441),V_f),s(TV_Q188445,V_x))) = s(TV_Q188441,happ(s(t_fun(TV_Q188445,TV_Q188441),V_g),s(TV_Q188445,V_x))) => s(t_fun(TV_Q188445,TV_Q188441),V_f) = s(t_fun(TV_Q188445,TV_Q188441),V_g))).
fof(ah4s_prelims_EQUALu_u_def, axiom, s(t_h4s_prelims_ordering,h4s_prelims_equal) = s(t_h4s_prelims_ordering,h4s_prelims_num2ordering(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero)))))))).
fof(ch4s_prelims_num2orderingu_u_thmu_c1, conjecture, s(t_h4s_prelims_ordering,h4s_prelims_num2ordering(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))) = s(t_h4s_prelims_ordering,h4s_prelims_equal)).
