let p be set ; :: thesis: for fs being finite Subset of omega
for E being non empty set st p in Funcs fs,E holds
ex f being Function of VAR ,E st p = (f * decode ) | fs
let fs be finite Subset of omega ; :: thesis: for E being non empty set st p in Funcs fs,E holds
ex f being Function of VAR ,E st p = (f * decode ) | fs
let E be non empty set ; :: thesis: ( p in Funcs fs,E implies ex f being Function of VAR ,E st p = (f * decode ) | fs )
assume
p in Funcs fs,E
; :: thesis: ex f being Function of VAR ,E st p = (f * decode ) | fs
then A1:
ex e being Function st
( e = p & dom e = fs & rng e c= E )
by FUNCT_2:def 2;
then reconsider g = p as Function of fs,E by FUNCT_2:def 1, RELSET_1:11;
consider ElofE being Element of E;
defpred S1[ set ] means $1 in dom g;
deffunc H1( set ) -> set = g . $1;
deffunc H2( set ) -> Element of E = ElofE;
A2:
now let q be
set ;
:: thesis: ( q in omega implies ( ( S1[q] implies H1(q) in E ) & ( not S1[q] implies H2(q) in E ) ) )assume
q in omega
;
:: thesis: ( ( S1[q] implies H1(q) in E ) & ( not S1[q] implies H2(q) in E ) )hence
( (
S1[
q] implies
H1(
q)
in E ) & ( not
S1[
q] implies
H2(
q)
in E ) )
;
:: thesis: verum end;
consider h being Function of omega ,E such that
A3:
for q being set st q in omega holds
( ( S1[q] implies h . q = H1(q) ) & ( not S1[q] implies h . q = H2(q) ) )
from FUNCT_2:sch 5(A2);
decode " is Function of VAR ,omega
by Lm1, FUNCT_2:def 1, RELSET_1:11;
then reconsider f = h * (decode " ) as Function of VAR ,E by FUNCT_2:19;
take
f
; :: thesis: p = (f * decode ) | fs
A4:
dom h = omega
by FUNCT_2:def 1;
then A5: h =
h * (id (dom decode ))
by Lm1, RELAT_1:77
.=
h * ((decode " ) * decode )
by Lm1, FUNCT_1:61
.=
f * decode
by RELAT_1:55
;
g = h | fs
hence
p = (f * decode ) | fs
by A5; :: thesis: verum