set X = { RelStr(# A,B #) where A is Subset of L, B is Relation of A,A : B c= the InternalRel of L } ;
( the carrier of (subrelstr ({} L)) = {} L & the InternalRel of (subrelstr ({} L)) c= the InternalRel of L )
by YELLOW_0:def 13, YELLOW_0:def 15;
then
subrelstr ({} L) in { RelStr(# A,B #) where A is Subset of L, B is Relation of A,A : B c= the InternalRel of L }
;
then reconsider X = { RelStr(# A,B #) where A is Subset of L, B is Relation of A,A : B c= the InternalRel of L } as non empty set ;
defpred S1[ set , set ] means ex R being RelStr st
( $2 = R & $1 is SubRelStr of R );
consider S being non empty strict RelStr such that
A1:
the carrier of S = X
and
A2:
for a, b being Element of S holds
( a <= b iff S1[a,b] )
from YELLOW_0:sch 1();
take
S
; :: thesis: ( ( for x being set holds
( x is Element of S iff x is strict SubRelStr of L ) ) & ( for a, b being Element of S holds
( a <= b iff ex R being RelStr st
( b = R & a is SubRelStr of R ) ) ) )
thus
for a, b being Element of S holds
( a <= b iff ex R being RelStr st
( b = R & a is SubRelStr of R ) )
by A2; :: thesis: verum