let T1, T be Tree; 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; for p being FinSequence of NAT st p in P holds
T1 = (tree T,P,T1) | p
let p be FinSequence of NAT ; ( p in P implies T1 = (tree T,P,T1) | p )
assume A1:
p in P
; T1 = (tree T,P,T1) | p
ex q, r being FinSequence of NAT st
( q in P & r in T1 & p = q ^ r )
then A7:
p in tree T,P,T1
by Def1;
let x be FinSequence of NAT ; TREES_2:def 1 ( ( 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 )
( not x in (tree T,P,T1) | p or x in T1 )
thus
( x in (tree T,P,T1) | p implies x in T1 )
verum