let p be set ; 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; 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 ; ( p in Funcs (fs,E) implies ex f being Function of VAR,E st p = (f * decode) | fs )
set ElofE = the Element of E;
deffunc H1( object ) -> Element of E = the Element of E;
assume
p in Funcs (fs,E)
; 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:4;
deffunc H2( object ) -> set = g . $1;
defpred S1[ object ] means $1 in dom g;
A2:
now for q being object st q in omega holds
( ( S1[q] implies H2(q) in E ) & ( not S1[q] implies H1(q) in E ) )let q be
object ;
( q in omega implies ( ( S1[q] implies H2(q) in E ) & ( not S1[q] implies H1(q) in E ) ) )assume
q in omega
;
( ( S1[q] implies H2(q) in E ) & ( not S1[q] implies H1(q) in E ) )hence
( (
S1[
q] implies
H2(
q)
in E ) & ( not
S1[
q] implies
H1(
q)
in E ) )
;
verum end;
consider h being Function of omega,E such that
A3:
for q being object st q in omega holds
( ( S1[q] implies h . q = H2(q) ) & ( not S1[q] implies h . q = H1(q) ) )
from FUNCT_2:sch 5(A2);
decode " is Function of VAR,omega
by Lm1, FUNCT_2:def 1, RELSET_1:4;
then reconsider f = h * (decode ") as Function of VAR,E by FUNCT_2:13;
take
f
; p = (f * decode) | fs
A4:
dom h = omega
by FUNCT_2:def 1;
then A5:
dom g = (dom h) /\ fs
by A1, XBOOLE_1:28;
A6:
for p being object st p in dom g holds
h . p = g . p
by A1, A3;
h =
h * (id (dom decode))
by A4, Lm1, RELAT_1:51
.=
h * ((decode ") * decode)
by Lm1, FUNCT_1:39
.=
f * decode
by RELAT_1:36
;
hence
p = (f * decode) | fs
by A5, A6, FUNCT_1:46; verum