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 G being basic GeneratorSystem over S,X,T
for s being Element of C -States the generators of G
for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
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 G being basic GeneratorSystem over S,X,T
for s being Element of C -States the generators of G
for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
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 G being basic GeneratorSystem over S,X,T
for s being Element of C -States the generators of G
for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
let C be bool-correct 4,1 integer image of T; :: thesis: for G being basic GeneratorSystem over S,X,T
for s being Element of C -States the generators of G
for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
let G be basic GeneratorSystem over S,X,T; :: thesis: for s being Element of C -States the generators of G
for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
let s be Element of C -States the generators of G; :: thesis: for t being Element of T, the bool-sort of S holds (\not t) value_at (C,s) = \not (t value_at (C,s))
let t be Element of T, the bool-sort of S; :: thesis: (\not t) value_at (C,s) = \not (t value_at (C,s))
s is ManySortedFunction of the generators of G, the Sorts of C by AOFA_A00:48;
then consider f being ManySortedFunction of T,C such that
A1: ( f is_homomorphism T,C & s = f || the generators of G ) by AOFA_A00:def 19;
A2: (\not t) value_at (C,s) = (f . the bool-sort of S) . (\not t) by A1, Th29;
set o = In (( the connectives of S . 2), the carrier' of S);
A3: ( the_arity_of (In (( the connectives of S . 2), the carrier' of S)) = <* the bool-sort of S*> & the_result_sort_of (In (( the connectives of S . 2), the carrier' of S)) = the bool-sort of S ) by Th12;
then Args ((In (( the connectives of S . 2), the carrier' of S)),T) = product <*( the Sorts of T . the bool-sort of S)*> by Th22;
then reconsider p = <*t*> as Element of Args ((In (( the connectives of S . 2), the carrier' of S)),T) by FINSEQ_3:123;
thus (\not t) value_at (C,s) = (Den ((In (( the connectives of S . 2), the carrier' of S)),C)) . (f # p) by A1, A2, A3
.= (Den ((In (( the connectives of S . 2), the carrier' of S)),C)) . <*((f . the bool-sort of S) . t)*> by A3, Th25
.= \not (t value_at (C,s)) by A1, Th29 ; :: thesis: verum