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 ;
( 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)
;
( 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)
;
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;
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
dom f c= FinPartSt SCM
then reconsider f = f as PartFunc of (FinPartSt SCM),(FinPartSt SCM) by A7, RELSET_1:4;
take
f
; 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; ( [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; ( 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; verum