let IL be non empty set ; :: thesis: for N being with_non-empty_elements set
for S being non empty stored-program halting IC-Ins-separated definite realistic AMI-Struct of IL,N
for F being PartFunc of (FinPartSt S),(FinPartSt S) st F = {} .--> {} holds
F is computable
let N be with_non-empty_elements set ; :: thesis: for S being non empty stored-program halting IC-Ins-separated definite realistic AMI-Struct of IL,N
for F being PartFunc of (FinPartSt S),(FinPartSt S) st F = {} .--> {} holds
F is computable
let S be non empty stored-program halting IC-Ins-separated definite realistic AMI-Struct of IL,N; :: thesis: for F being PartFunc of (FinPartSt S),(FinPartSt S) st F = {} .--> {} holds
F is computable
let F be PartFunc of (FinPartSt S),(FinPartSt S); :: thesis: ( F = {} .--> {} implies F is computable )
consider p being pre-program of S;
assume A1: F = {} .--> {} ; :: thesis: F is computable
take p ; :: according to AMI_1:def 30 :: thesis: p computes F
thus p computes F by A1, Th70; :: thesis: verum