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) );
consider y being set such that
A1: for a being object holds
( a in y iff ( a in L & S1[a] ) ) from XBOOLE_0:sch 1();
A2: (x. (1,L)) '==' (x. (1,L)) in y by A1;
y c= L by A1;
then reconsider y = y as non empty Subset of L by A2;
take y ; :: thesis: for a being object holds
( a in y 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) ) )

thus for a being object holds
( a in y 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) ) ) by A1; :: thesis: verum