let S be non empty TopSpace; for T being non empty TopSpace-like reflexive TopRelStr
for x, y being Element of holds
( x <= y iff for i being Element of holds [(x . i),(y . i)] in the InternalRel of T )
let T be non empty TopSpace-like reflexive TopRelStr ; for x, y being Element of holds
( x <= y iff for i being Element of holds [(x . i),(y . i)] in the InternalRel of T )
let x, y be Element of ; ( x <= y iff for i being Element of holds [(x . i),(y . i)] in the InternalRel of T )
A1:
ContMaps S,T is full SubRelStr of T |^ the carrier of S
by Def3;
then reconsider x' = x, y' = y as Element of by YELLOW_0:59;
reconsider xa = x', ya = y' as Function of S,T by Th19;
assume A3:
for i being Element of holds [(x . i),(y . i)] in the InternalRel of T
; x <= y
then
xa <= ya
by YELLOW_2:def 1;
then
x' <= y'
by WAYBEL10:12;
hence
x <= y
by A1, YELLOW_0:61; verum