defpred S1[ object , object ] means ex n being Nat st
( $1 = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & $2 = (dl. 2) .--> F3(n) );
A1: for p, q1, q2 being object st S1[p,q1] & S1[p,q2] holds
q1 = q2
proof
let p, q1, q2 be object ; :: thesis: ( S1[p,q1] & S1[p,q2] implies q1 = q2 )
given n1 being Nat such that A2: p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n1,F2()) and
A3: q1 = (dl. 2) .--> F3(n1) ; :: thesis: ( not S1[p,q2] or q1 = q2 )
given n2 being Nat such that A4: p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n2,F2()) and
A5: q2 = (dl. 2) .--> F3(n2) ; :: thesis: q1 = q2
n1 = (((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n1,F2())) . (dl. 1) by FUNCT_4:135, AMI_3:10
.= n2 by A2, A4, FUNCT_4:135, AMI_3:10 ;
hence q1 = q2 by A3, A5; :: thesis: verum
end;
consider f being Function such that
A6: for p, q being object holds
( [p,q] in f iff ( p in FinPartSt SCM & S1[p,q] ) ) from FUNCT_1:sch 1(A1);
A7: rng f c= FinPartSt SCM
proof
let q be object ; :: according to TARSKI:def 3 :: thesis: ( not q in rng f or q in FinPartSt SCM )
assume q in rng f ; :: thesis: q in FinPartSt SCM
then consider p being object such that
A8: [p,q] in f by XTUPLE_0:def 13;
ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) by A6, A8;
hence q in FinPartSt SCM by MEMSTR_0:75; :: thesis: verum
end;
dom f c= FinPartSt SCM
proof
let e be object ; :: according to TARSKI:def 3 :: thesis: ( not e in dom f or e in FinPartSt SCM )
assume e in dom f ; :: thesis: e in FinPartSt SCM
then [e,(f . e)] in f by FUNCT_1:1;
hence e in FinPartSt SCM by A6; :: thesis: verum
end;
then reconsider f = f as PartFunc of (FinPartSt SCM),(FinPartSt SCM) by A7, RELSET_1:4;
take f ; :: thesis: for p, q being FinPartState of SCM holds
( [p,q] in f iff ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) )

let p, q be FinPartState of SCM; :: thesis: ( [p,q] in f iff ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) )

thus ( [p,q] in f implies ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) ) by A6; :: thesis: ( ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) implies [p,q] in f )

thus ( ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) implies [p,q] in f ) by A6, MEMSTR_0:75; :: thesis: verum