%   ORIGINAL: 'h4/thm/pred_set/CROSS_INSERT_RIGHT_'
% 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: !P Q x. 'h4/const/pred_set/CROSS' P ('h4/const/pred_set/INSERT' x Q) = 'h4/const/pred_set/UNION' ('h4/const/pred_set/CROSS' P ('h4/const/pred_set/INSERT' x 'h4/const/pred_set/EMPTY')) ('h4/const/pred_set/CROSS' P Q)
%   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: !P Q x. 'h4/const/pred_set/CROSS' P ('h4/const/pred_set/INSERT' x Q) = 'h4/const/pred_set/UNION' ('h4/const/pred_set/CROSS' P ('h4/const/pred_set/INSERT' x 'h4/const/pred_set/EMPTY')) ('h4/const/pred_set/CROSS' P Q)
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_3f21171,V_3f21167]: ![F, G]: (![X]: s(V_3f21167,happ(s(fun(V_3f21171,V_3f21167),F),s(V_3f21171,X))) = s(V_3f21167,happ(s(fun(V_3f21171,V_3f21167),G),s(V_3f21171,X))) => s(fun(V_3f21171,V_3f21167),F) = s(fun(V_3f21171,V_3f21167),G))).
fof('h4/thm/pred_set/CROSS_INSERT_RIGHT_', conjecture, ![A,B]: ![P, Q, X]: s(fun('h4/type/pair/prod'(A,B),bool),'h4/const/pred_set/CROSS'(s(fun(A,bool),P),s(fun(B,bool),'h4/const/pred_set/INSERT'(s(B,X),s(fun(B,bool),Q))))) = s(fun('h4/type/pair/prod'(A,B),bool),'h4/const/pred_set/UNION'(s(fun('h4/type/pair/prod'(A,B),bool),'h4/const/pred_set/CROSS'(s(fun(A,bool),P),s(fun(B,bool),'h4/const/pred_set/INSERT'(s(B,X),s(fun(B,bool),'h4/const/pred_set/EMPTY'))))),s(fun('h4/type/pair/prod'(A,B),bool),'h4/const/pred_set/CROSS'(s(fun(A,bool),P),s(fun(B,bool),Q)))))).
