let N be with_zero set ; :: thesis: for A being non empty with_non-empty_values IC-Ins-separated with_non_trivial_ObjectKinds AMI-Struct over N
for I being Instruction of A holds Out_\_Inp I c= Output I

let A be non empty with_non-empty_values IC-Ins-separated with_non_trivial_ObjectKinds AMI-Struct over N; :: thesis: for I being Instruction of A holds Out_\_Inp I c= Output I
let I be Instruction of A; :: thesis: Out_\_Inp I c= Output I
for o being Object of A st o in Out_\_Inp I holds
o in Output I
proof
let o be Object of A; :: thesis: ( o in Out_\_Inp I implies o in Output I )
set s = the State of A;
set a = the Element of Values o;
consider w being object such that
A1: w in Values o and
A2: w <> the Element of Values o by SUBSET_1:48;
reconsider w = w as Element of Values o by A1;
set t = the State of A +* (o,w);
A3: dom ( the State of A +* (o,w)) = the carrier of A by PARTFUN1:def 2;
A4: dom the State of A = the carrier of A by PARTFUN1:def 2;
assume A5: ( o in Out_\_Inp I & not o in Output I ) ; :: thesis: contradiction
then A6: (Exec (I,(( the State of A +* (o,w)) +* (o, the Element of Values o)))) . o = (( the State of A +* (o,w)) +* (o, the Element of Values o)) . o by Def3
.= the Element of Values o by A3, FUNCT_7:31 ;
(Exec (I,( the State of A +* (o,w)))) . o = ( the State of A +* (o,w)) . o by A5, Def3
.= w by A4, FUNCT_7:31 ;
hence contradiction by A5, A2, A6, Def4; :: thesis: verum
end;
hence Out_\_Inp I c= Output I by SUBSET_1:2; :: thesis: verum