set W = Polish-WFF-set (L,E);
set R = Polish-recursion-domain (E,(Polish-WFF-set (L,E)));
let f, g be Function of (Polish-recursion-domain (E,(Polish-WFF-set (L,E)))),(Polish-WFF-set (L,E)); ( ( for t being Element of L
for p being FinSequence of Polish-WFF-set (L,E) st len p = E . t holds
( ( t in dom s implies f . (t,p) = s . t ) & ( not t in dom s implies f . (t,p) = t ^ (FlattenSeq p) ) ) ) & ( for t being Element of L
for p being FinSequence of Polish-WFF-set (L,E) st len p = E . t holds
( ( t in dom s implies g . (t,p) = s . t ) & ( not t in dom s implies g . (t,p) = t ^ (FlattenSeq p) ) ) ) implies f = g )
assume that
A1:
for t being Element of L
for p being FinSequence of Polish-WFF-set (L,E) st len p = E . t holds
( ( t in dom s implies f . (t,p) = s . t ) & ( not t in dom s implies f . (t,p) = t ^ (FlattenSeq p) ) )
and
A2:
for t being Element of L
for p being FinSequence of Polish-WFF-set (L,E) st len p = E . t holds
( ( t in dom s implies g . (t,p) = s . t ) & ( not t in dom s implies g . (t,p) = t ^ (FlattenSeq p) ) )
; f = g
A3: dom f =
Polish-recursion-domain (E,(Polish-WFF-set (L,E)))
by FUNCT_2:def 1
.=
dom g
by FUNCT_2:def 1
;
for a being object st a in dom f holds
f . a = g . a
hence
f = g
by A3, FUNCT_1:2; verum