let S be non empty non void bool-correct 4,1 integer BoolSignature ; :: thesis: for X being non-empty ManySortedSet of the carrier of S
for T being b₁,S -terms all_vars_including inheriting_operations free_in_itself vf-free integer VarMSAlgebra over S
for C being bool-correct 4,1 integer image of T
for I being integer SortSymbol of S
for t1, t2 being Element of T,I
for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let X be non-empty ManySortedSet of the carrier of S; :: thesis: for T being X,S -terms all_vars_including inheriting_operations free_in_itself vf-free integer VarMSAlgebra over S
for C being bool-correct 4,1 integer image of T
for I being integer SortSymbol of S
for t1, t2 being Element of T,I
for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let T be X,S -terms all_vars_including inheriting_operations free_in_itself vf-free integer VarMSAlgebra over S; :: thesis: for C being bool-correct 4,1 integer image of T
for I being integer SortSymbol of S
for t1, t2 being Element of T,I
for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let C be bool-correct 4,1 integer image of T; :: thesis: for I being integer SortSymbol of S
for t1, t2 being Element of T,I
for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let I be integer SortSymbol of S; :: thesis: for t1, t2 being Element of T,I
for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let t1, t2 be Element of T,I; :: thesis: for u being ManySortedFunction of FreeGen T, the Sorts of C holds (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
let u be ManySortedFunction of FreeGen T, the Sorts of C; :: thesis: (leq (t1,t2)) value_at (C,u) = leq ((t1 value_at (C,u)),(t2 value_at (C,u)))
consider f being ManySortedFunction of T,C such that
A1: ( f is_homomorphism T,C & u = f || (FreeGen T) ) by MSAFREE4:46;
FreeGen T is_transformable_to the Sorts of C by MSAFREE4:21;
then A2: doms u = FreeGen T by MSSUBFAM:17;
then consider f1 being ManySortedFunction of T,C, Q1 being GeneratorSet of T such that
A3: ( f1 is_homomorphism T,C & Q1 = doms u & u = f1 || Q1 & t1 value_at (C,u) = (f1 . I) . t1 ) by A1, AOFA_A00:def 21;
consider f2 being ManySortedFunction of T,C, Q2 being GeneratorSet of T such that
A4: ( f2 is_homomorphism T,C & Q2 = doms u & u = f2 || Q2 & t2 value_at (C,u) = (f2 . I) . t2 ) by A1, A2, AOFA_A00:def 21;
consider f being ManySortedFunction of T,C, Q being GeneratorSet of T such that
A5: ( f is_homomorphism T,C & Q = doms u & u = f || Q & (leq (t1,t2)) value_at (C,u) = (f . the bool-sort of S) . (leq (t1,t2)) ) by A1, A2, AOFA_A00:def 21;
A6: ( f = f1 & f = f2 ) by A3, A4, A5, EXTENS_1:19;
set o = In (( the connectives of S . 10), the carrier' of S);
A7: ( the_arity_of (In (( the connectives of S . 10), the carrier' of S)) = <*I,I*> & the_result_sort_of (In (( the connectives of S . 10), the carrier' of S)) = the bool-sort of S ) by Th20;
then Args ((In (( the connectives of S . 10), the carrier' of S)),T) = product <*( the Sorts of T . I),( the Sorts of T . I)*> by Th23;
then reconsider p = <*t1,t2*> as Element of Args ((In (( the connectives of S . 10), the carrier' of S)),T) by FINSEQ_3:124;
thus (leq (t1,t2)) value_at (C,u) = (Den ((In (( the connectives of S . 10), the carrier' of S)),C)) . (f # p) by A5, A7
.= leq ((t1 value_at (C,u)),(t2 value_at (C,u))) by A3, A4, A6, A7, Th26 ; :: thesis: verum