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) );
let f1, f2 be PartFunc of (FinPartSt SCM),(FinPartSt SCM); :: thesis: ( ( for p, q being FinPartState of SCM holds
( [p,q] in f1 iff ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) ) ) & ( for p, q being FinPartState of SCM holds
( [p,q] in f2 iff ex n being Nat st
( p = ((dl. 0),(dl. 1),(dl. 2)) --> (F1(),n,F2()) & q = (dl. 2) .--> F3(n) ) ) ) implies f1 = f2 )

assume that
A1: for p, q being FinPartState of SCM holds
( [p,q] in f1 iff S1[p,q] ) and
A2: for p, q being FinPartState of SCM holds
( [p,q] in f2 iff S1[p,q] ) ; :: thesis: f1 = f2
A3: for p, q being Element of FinPartSt SCM holds
( [p,q] in f2 iff S1[p,q] )
proof
let p, q be Element of FinPartSt SCM; :: thesis: ( [p,q] in f2 iff S1[p,q] )
thus ( [p,q] in f2 implies S1[p,q] ) :: thesis: ( S1[p,q] implies [p,q] in f2 )
proof
assume A4: [p,q] in f2 ; :: thesis: S1[p,q]
reconsider p = p, q = q as FinPartState of SCM by MEMSTR_0:76;
S1[p,q] by A2, A4;
hence S1[p,q] ; :: thesis: verum
end;
thus ( S1[p,q] implies [p,q] in f2 ) by A2; :: thesis: verum
end;
A5: for p, q being Element of FinPartSt SCM holds
( [p,q] in f1 iff S1[p,q] )
proof
let p, q be Element of FinPartSt SCM; :: thesis: ( [p,q] in f1 iff S1[p,q] )
thus ( [p,q] in f1 implies S1[p,q] ) :: thesis: ( S1[p,q] implies [p,q] in f1 )
proof
assume A6: [p,q] in f1 ; :: thesis: S1[p,q]
reconsider p = p, q = q as FinPartState of SCM by MEMSTR_0:76;
S1[p,q] by A1, A6;
hence S1[p,q] ; :: thesis: verum
end;
thus ( S1[p,q] implies [p,q] in f1 ) by A1; :: thesis: verum
end;
thus f1 = f2 from RELSET_1:sch 4(A5, A3); :: thesis: verum