let T1, T be Tree; :: thesis: for P being AntiChain_of_Prefixes of T
for p being FinSequence of NAT st p in P holds
T1 = (tree T,P,T1) | p

let P be AntiChain_of_Prefixes of T; :: thesis: for p being FinSequence of NAT st p in P holds
T1 = (tree T,P,T1) | p

let p be FinSequence of NAT ; :: thesis: ( p in P implies T1 = (tree T,P,T1) | p )
assume A1: p in P ; :: thesis: T1 = (tree T,P,T1) | p
ex q, r being FinSequence of NAT st
( q in P & r in T1 & p = q ^ r )
proof
consider q being FinSequence of NAT such that
A3: q = p ;
consider r being FinSequence of NAT such that
A4: r = <*> NAT ;
A5: r in T1 by A4, TREES_1:47;
p = q ^ r by A3, A4, FINSEQ_1:47;
hence ex q, r being FinSequence of NAT st
( q in P & r in T1 & p = q ^ r ) by A1, A3, A5; :: thesis: verum
end;
then A7: p in tree T,P,T1 by Def1;
let x be FinSequence of NAT ; :: according to TREES_2:def 1 :: thesis: ( ( not x in T1 or x in (tree T,P,T1) | p ) & ( not x in (tree T,P,T1) | p or x in T1 ) )
thus ( x in T1 implies x in (tree T,P,T1) | p ) :: thesis: ( not x in (tree T,P,T1) | p or x in T1 )
proof
assume x in T1 ; :: thesis: x in (tree T,P,T1) | p
then p ^ x in tree T,P,T1 by A1, Def1;
hence x in (tree T,P,T1) | p by A7, TREES_1:def 9; :: thesis: verum
end;
thus ( x in (tree T,P,T1) | p implies x in T1 ) :: thesis: verum
proof
assume x in (tree T,P,T1) | p ; :: thesis: x in T1
then A11: p ^ x in tree T,P,T1 by A7, TREES_1:def 9;
A12: now end;
now
given s, r being FinSequence of NAT such that A19: s in P and
A20: r in T1 and
A21: p ^ x = s ^ r ; :: thesis: x in T1
hence x in T1 by A20, A21, FINSEQ_1:46; :: thesis: verum
end;
hence x in T1 by A1, A11, A12, Def1; :: thesis: verum
end;