let T, T1 be Tree; :: thesis: for t being Element of T holds tree T,{t},T1 = T with-replacement t,T1
let t be Element of T; :: thesis: tree T,{t},T1 = T with-replacement t,T1
let p be FinSequence of NAT ; :: according to TREES_2:def 1 :: thesis: ( ( not p in tree T,{t},T1 or p in T with-replacement t,T1 ) & ( not p in T with-replacement t,T1 or p in tree T,{t},T1 ) )
thus
( p in tree T,{t},T1 implies p in T with-replacement t,T1 )
:: thesis: ( not p in T with-replacement t,T1 or p in tree T,{t},T1 )
assume A5:
p in T with-replacement t,T1
; :: thesis: p in tree T,{t},T1
A6:
( p in T & not t is_a_proper_prefix_of p implies ( p in T & ( for s being FinSequence of NAT st s in {t} holds
not s is_a_proper_prefix_of p ) ) )
by TARSKI:def 1;
hence
p in tree T,{t},T1
by A5, A6, Def1, TREES_1:def 12; :: thesis: verum