defpred S1[ object ] means ex t, u, v, w being Formula of L st
( $1 = t '==' t or $1 = (t '==' u) '->' (('not' t) '==' ('not' u)) or $1 = ((t '==' u) '&' (v '==' w)) '->' ((t '&' v) '==' (u '&' w)) or $1 = ((t '==' u) '&' (v '==' w)) '->' ((t 'or' v) '==' (u 'or' w)) or $1 = ((t '==' u) '&' (v '==' w)) '->' ((t '->' v) '==' (u '->' w)) or $1 = ((t '==' u) '&' (v '==' w)) '->' ((t '<->' v) '==' (u '<->' w)) or $1 = ((t '==' u) '&' (v '==' w)) '->' ((t '==' v) '==' (u '==' w)) or $1 = (t '==' u) '->' (t '->' u) );
let y1, y2 be non empty Subset of L; :: thesis: ( ( for a being object holds
( a in y1 iff ex t, u, v, w being Formula of L st
( a = t '==' t or a = (t '==' u) '->' (('not' t) '==' ('not' u)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '&' v) '==' (u '&' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t 'or' v) '==' (u 'or' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '->' v) '==' (u '->' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '<->' v) '==' (u '<->' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '==' v) '==' (u '==' w)) or a = (t '==' u) '->' (t '->' u) ) ) ) & ( for a being object holds
( a in y2 iff ex t, u, v, w being Formula of L st
( a = t '==' t or a = (t '==' u) '->' (('not' t) '==' ('not' u)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '&' v) '==' (u '&' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t 'or' v) '==' (u 'or' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '->' v) '==' (u '->' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '<->' v) '==' (u '<->' w)) or a = ((t '==' u) '&' (v '==' w)) '->' ((t '==' v) '==' (u '==' w)) or a = (t '==' u) '->' (t '->' u) ) ) ) implies y1 = y2 )

assume that
A1: for a being object holds
( a in y1 iff S1[a] ) and
A2: for a being object holds
( a in y2 iff S1[a] ) ; :: thesis: y1 = y2
thus y1 = y2 from XBOOLE_0:sch 2(A1, A2); :: thesis: verum