let T, T1 be Tree; for t being Element of T holds tree T,{t},T1 = T with-replacement t,T1
let t be Element of T; tree T,{t},T1 = T with-replacement t,T1
let p be FinSequence of NAT ; TREES_2:def 1 ( ( 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 )
( not p in T with-replacement t,T1 or p in tree T,{t},T1 )
assume A8:
p in T with-replacement t,T1
; p in tree T,{t},T1
A9:
( 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 A8, A9, Def1, TREES_1:def 12; verum