let S, T be non empty antisymmetric upper-bounded RelStr ; :: thesis: Top [:S,T:] = [(Top S),(Top T)]
A1:
ex_inf_of {} ,[:S,T:]
by YELLOW_0:43;
A2:
{} is_>=_than [(Top S),(Top T)]
by YELLOW_0:6;
for a being Element of [:S,T:] st {} is_>=_than a holds
a <= [(Top S),(Top T)]
hence
Top [:S,T:] = [(Top S),(Top T)]
by A1, A2, YELLOW_0:def 10; :: thesis: verum