let p be FinSequence of NAT ; for T, T1 being DecoratedTree st p in dom T holds
for q being FinSequence of NAT st q in dom (T with-replacement p,T1) & q in { (p ^ s) where s is Element of dom T1 : s = s } holds
ex r being Element of dom T1 st
( q = p ^ r & (T with-replacement p,T1) . q = T1 . r )
let T, T1 be DecoratedTree; ( p in dom T implies for q being FinSequence of NAT st q in dom (T with-replacement p,T1) & q in { (p ^ s) where s is Element of dom T1 : s = s } holds
ex r being Element of dom T1 st
( q = p ^ r & (T with-replacement p,T1) . q = T1 . r ) )
assume A1:
p in dom T
; for q being FinSequence of NAT st q in dom (T with-replacement p,T1) & q in { (p ^ s) where s is Element of dom T1 : s = s } holds
ex r being Element of dom T1 st
( q = p ^ r & (T with-replacement p,T1) . q = T1 . r )
let q be FinSequence of NAT ; ( q in dom (T with-replacement p,T1) & q in { (p ^ s) where s is Element of dom T1 : s = s } implies ex r being Element of dom T1 st
( q = p ^ r & (T with-replacement p,T1) . q = T1 . r ) )
assume that
A2:
q in dom (T with-replacement p,T1)
and
A3:
q in { (p ^ s) where s is Element of dom T1 : s = s }
; ex r being Element of dom T1 st
( q = p ^ r & (T with-replacement p,T1) . q = T1 . r )