
theorem ::3.1 Proposition (2)=>(3)
  for L being complete LATTICE, N being net of L, x being Element of L
st N in NetUniv L holds (x=lim_inf N & for M being subnet of N st M in NetUniv
  L holds x >= inf M) implies x=lim_inf N & for p being greater_or_equal_to_id
  Function of N,N holds x >= inf (N * p) by Th10;
