let X be Extension of SCI-arity ; :: thesis: for L being Polish-ext-set of X
for D being SCI-axioms b1 -extending Subset of L
for x, y being Equivalence_Class of D holds
( y = 'not' x iff ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) )

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for x, y being Equivalence_Class of D holds
( y = 'not' x iff ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) )

let D be SCI-axioms L -extending Subset of L; :: thesis: for x, y being Equivalence_Class of D holds
( y = 'not' x iff ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) )

let x, y be Equivalence_Class of D; :: thesis: ( y = 'not' x iff ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) )

set E = EqRel D;
thus ( y = 'not' x implies ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) ) :: thesis: ( ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) implies y = 'not' x )
proof
assume y = 'not' x ; :: thesis: ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) )

then consider t being Formula of L such that
A1: ( x = (EqRel D) -class t & y = (EqRel D) -class ('not' t) ) by Def101;
take t ; :: thesis: ( x = D -class t & y = D -class ('not' t) )
thus ( x = D -class t & y = D -class ('not' t) ) by A1; :: thesis: verum
end;
thus ( ex t being Formula of L st
( x = D -class t & y = D -class ('not' t) ) implies y = 'not' x ) by Def101; :: thesis: verum