let T be non empty RelStr ; for N being net of T
for M being non empty full SubNetStr of N st ( for i being Element of N ex j being Element of N st
( j >= i & j in the carrier of M ) ) holds
( M is subnet of N & incl M,N is Embedding of M,N )
let N be net of T; for M being non empty full SubNetStr of N st ( for i being Element of N ex j being Element of N st
( j >= i & j in the carrier of M ) ) holds
( M is subnet of N & incl M,N is Embedding of M,N )
let M be non empty full SubNetStr of N; ( ( for i being Element of N ex j being Element of N st
( j >= i & j in the carrier of M ) ) implies ( M is subnet of N & incl M,N is Embedding of M,N ) )
assume A1:
for i being Element of N ex j being Element of N st
( j >= i & j in the carrier of M )
; ( M is subnet of N & incl M,N is Embedding of M,N )
A2:
the mapping of M = the mapping of N | the carrier of M
by YELLOW_6:def 8;
A3:
M is full SubRelStr of N
by YELLOW_6:def 9;
then A4:
the carrier of M c= the carrier of N
by YELLOW_0:def 13;
M is directed
then reconsider K = M as net of T by A3;
A10:
now set f =
incl K,
N;
A11:
incl K,
N = id the
carrier of
K
by A4, YELLOW_9:def 1;
hence
the
mapping of
K = the
mapping of
N * (incl K,N)
by A2, RELAT_1:94;
for m being Element of N ex n being Element of K st
for p being Element of K st n <= p holds
m <= (incl K,N) . plet m be
Element of
N;
ex n being Element of K st
for p being Element of K st n <= p holds
m <= (incl K,N) . pconsider j being
Element of
N such that A12:
j >= m
and A13:
j in the
carrier of
K
by A1;
reconsider n =
j as
Element of
K by A13;
take n =
n;
for p being Element of K st n <= p holds
m <= (incl K,N) . plet p be
Element of
K;
( n <= p implies m <= (incl K,N) . p )reconsider q =
p as
Element of
N by A3, YELLOW_0:59;
assume
n <= p
;
m <= (incl K,N) . pthen A14:
j <= q
by YELLOW_6:20;
(incl K,N) . p = q
by A11, FUNCT_1:35;
hence
m <= (incl K,N) . p
by A12, A14, YELLOW_0:def 2;
verum end;
hence
M is subnet of N
by YELLOW_6:def 12; incl M,N is Embedding of M,N
hence
incl M,N is Embedding of M,N
by A10, Def3; verum