let L be non empty 1-sorted ; :: thesis: for N, M being net of L st NetStr(# the carrier of N,the InternalRel of N,the mapping of N #) = NetStr(# the carrier of M,the InternalRel of M,the mapping of M #) holds
M is subnet of N
let N, M be net of L; :: thesis: ( NetStr(# the carrier of N,the InternalRel of N,the mapping of N #) = NetStr(# the carrier of M,the InternalRel of M,the mapping of M #) implies M is subnet of N )
assume A1:
NetStr(# the carrier of N,the InternalRel of N,the mapping of N #) = NetStr(# the carrier of M,the InternalRel of M,the mapping of M #)
; :: thesis: M is subnet of N
A2:
N is subnet of N
by YELLOW_6:23;
ex f being Function of M,N st
( the mapping of M = the mapping of N * f & ( for m being Element of N ex n being Element of M st
for p being Element of M st n <= p holds
m <= f . p ) )
hence
M is subnet of N
by YELLOW_6:def 12; :: thesis: verum