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
for p being FinPartState of S holds p is Program of F
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
for p being FinPartState of S holds p is Program of F
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
for p being FinPartState of S holds p is Program of F
let F be PartFunc of (FinPartSt S),(FinPartSt S); :: thesis: ( F = {} implies for p being FinPartState of S holds p is Program of F )
assume A1: F = {} ; :: thesis: for p being FinPartState of S holds p is Program of F
let p be FinPartState of S; :: thesis: p is Program of F
thus F is computable by A1, Th71; :: according to AMI_1:def 31 :: thesis: p computes F
thus p computes F by A1, Th68; :: thesis: verum