:: AMI_3 semantic presentation
definition
func SCM -> strict AMI-Struct of
{INT } equals :: AMI_3:def 1
AMI-Struct(#
NAT ,0,
SCM-Instr-Loc ,
(Segm 9),
SCM-Instr ,
SCM-OK ,
SCM-Exec #);
coherence
AMI-Struct(# NAT ,0,SCM-Instr-Loc ,(Segm 9),SCM-Instr ,SCM-OK ,SCM-Exec #) is strict AMI-Struct of {INT }
;
end;
:: deftheorem Def1 defines SCM AMI_3:def 1 :
theorem Th1: :: AMI_3:1
theorem Th2: :: AMI_3:2
:: deftheorem Def2 defines Data-Location AMI_3:def 2 :
definition
let a be
Data-Location ;
let b be
Data-Location ;
func c1 := c2 -> Instruction of
SCM equals :: AMI_3:def 3
[1,<*a,b*>];
correctness
coherence
[1,<*a,b*>] is Instruction of SCM ;
func AddTo c1,
c2 -> Instruction of
SCM equals :: AMI_3:def 4
[2,<*a,b*>];
correctness
coherence
[2,<*a,b*>] is Instruction of SCM ;
func SubFrom c1,
c2 -> Instruction of
SCM equals :: AMI_3:def 5
[3,<*a,b*>];
correctness
coherence
[3,<*a,b*>] is Instruction of SCM ;
func MultBy c1,
c2 -> Instruction of
SCM equals :: AMI_3:def 6
[4,<*a,b*>];
correctness
coherence
[4,<*a,b*>] is Instruction of SCM ;
func Divide c1,
c2 -> Instruction of
SCM equals :: AMI_3:def 7
[5,<*a,b*>];
correctness
coherence
[5,<*a,b*>] is Instruction of SCM ;
end;
:: deftheorem Def3 defines := AMI_3:def 3 :
:: deftheorem Def4 defines AddTo AMI_3:def 4 :
:: deftheorem Def5 defines SubFrom AMI_3:def 5 :
:: deftheorem Def6 defines MultBy AMI_3:def 6 :
:: deftheorem Def7 defines Divide AMI_3:def 7 :
definition
let loc be
Instruction-Location of
SCM ;
func goto c1 -> Instruction of
SCM equals :: AMI_3:def 8
[6,<*loc*>];
correctness
coherence
[6,<*loc*>] is Instruction of SCM ;
by AMI_2:3;
let a be
Data-Location ;
func c2 =0_goto c1 -> Instruction of
SCM equals :: AMI_3:def 9
[7,<*loc,a*>];
correctness
coherence
[7,<*loc,a*>] is Instruction of SCM ;
func c2 >0_goto c1 -> Instruction of
SCM equals :: AMI_3:def 10
[8,<*loc,a*>];
correctness
coherence
[8,<*loc,a*>] is Instruction of SCM ;
end;
:: deftheorem Def8 defines goto AMI_3:def 8 :
:: deftheorem Def9 defines =0_goto AMI_3:def 9 :
:: deftheorem Def10 defines >0_goto AMI_3:def 10 :
theorem Th3: :: AMI_3:3
canceled;
theorem Th4: :: AMI_3:4
theorem Th5: :: AMI_3:5
:: deftheorem Def11 defines Next AMI_3:def 11 :
theorem Th6: :: AMI_3:6
theorem Th7: :: AMI_3:7
theorem Th8: :: AMI_3:8
theorem Th9: :: AMI_3:9
theorem Th10: :: AMI_3:10
theorem Th11: :: AMI_3:11
theorem Th12: :: AMI_3:12
theorem Th13: :: AMI_3:13
theorem Th14: :: AMI_3:14
theorem Th15: :: AMI_3:15
Lemma72:
for I being Instruction of SCM st ex s being State of SCM st (Exec I,s) . (IC SCM ) = Next (IC s) holds
not I is halting
Lemma75:
for I being Instruction of SCM st I = [0,{} ] holds
I is halting
Lemma76:
for a, b being Data-Location holds not a := b is halting
Lemma77:
for a, b being Data-Location holds not AddTo a,b is halting
Lemma78:
for a, b being Data-Location holds not SubFrom a,b is halting
Lemma79:
for a, b being Data-Location holds not MultBy a,b is halting
Lemma80:
for a, b being Data-Location holds not Divide a,b is halting
Lemma81:
for loc being Instruction-Location of SCM holds not goto loc is halting
Lemma90:
for a being Data-Location
for loc being Instruction-Location of SCM holds not a =0_goto loc is halting
Lemma100:
for a being Data-Location
for loc being Instruction-Location of SCM holds not a >0_goto loc is halting
Lemma101:
for I being set holds
( I is Instruction of SCM iff ( I = [0,{} ] or ex a, b being Data-Location st I = a := b or ex a, b being Data-Location st I = AddTo a,b or ex a, b being Data-Location st I = SubFrom a,b or ex a, b being Data-Location st I = MultBy a,b or ex a, b being Data-Location st I = Divide a,b or ex loc being Instruction-Location of SCM st I = goto loc or ex a being Data-Location ex loc being Instruction-Location of SCM st I = a =0_goto loc or ex a being Data-Location ex loc being Instruction-Location of SCM st I = a >0_goto loc ) )
Lemma103:
for I being Instruction of SCM st I is halting holds
I = halt SCM
Lemma105:
halt SCM = [0,{} ]
theorem Th16: :: AMI_3:16
canceled;
theorem Th17: :: AMI_3:17
canceled;
theorem Th18: :: AMI_3:18
theorem Th19: :: AMI_3:19
Lemma118:
for f, g being Function
for A, B being set st f | A = g | A & f | B = g | B holds
f | (A \/ B) = g | (A \/ B)
by RELAT_1:185;
Lemma120:
for f being Function
for x being set st x in dom f holds
f | {x} = {[x,(f . x)]}
by GRFUNC_1:89;
Lemma121:
for f being Function
for X being set st X misses dom f holds
f | X = {}
by RELAT_1:95;
theorem Th20: :: AMI_3:20
canceled;
theorem Th21: :: AMI_3:21
canceled;
theorem Th22: :: AMI_3:22
canceled;
theorem Th23: :: AMI_3:23
canceled;
theorem Th24: :: AMI_3:24
theorem Th25: :: AMI_3:25
theorem Th26: :: AMI_3:26
theorem Th27: :: AMI_3:27
theorem Th28: :: AMI_3:28
canceled;
theorem Th29: :: AMI_3:29
theorem Th30: :: AMI_3:30
canceled;
theorem Th31: :: AMI_3:31
theorem Th32: :: AMI_3:32
theorem Th33: :: AMI_3:33
:: deftheorem Def12 defines Start-At AMI_3:def 12 :
theorem Th34: :: AMI_3:34
:: deftheorem Def13 defines programmed AMI_3:def 13 :
theorem Th35: :: AMI_3:35
theorem Th36: :: AMI_3:36
theorem Th37: :: AMI_3:37
theorem Th38: :: AMI_3:38
:: deftheorem Def14 defines starts_at AMI_3:def 14 :
:: deftheorem Def15 defines halts_at AMI_3:def 15 :
theorem Th39: :: AMI_3:39
:: deftheorem Def16 defines IC AMI_3:def 16 :
:: deftheorem Def17 defines starts_at AMI_3:def 17 :
:: deftheorem Def18 defines halts_at AMI_3:def 18 :
theorem Th40: :: AMI_3:40
theorem Th41: :: AMI_3:41
theorem Th42: :: AMI_3:42
theorem Th43: :: AMI_3:43
theorem Th44: :: AMI_3:44
theorem Th45: :: AMI_3:45
theorem Th46: :: AMI_3:46
theorem Th47: :: AMI_3:47
theorem Th48: :: AMI_3:48
theorem Th49: :: AMI_3:49
theorem Th50: :: AMI_3:50
Lemma154:
for s being State of SCM
for i being Instruction of SCM
for l being Instruction-Location of SCM holds (Exec i,s) . l = s . l
theorem Th51: :: AMI_3:51
:: deftheorem Def19 defines dl. AMI_3:def 19 :
:: deftheorem Def20 defines il. AMI_3:def 20 :
theorem Th52: :: AMI_3:52
theorem Th53: :: AMI_3:53
theorem Th54: :: AMI_3:54
theorem Th55: :: AMI_3:55
theorem Th56: :: AMI_3:56
theorem Th57: :: AMI_3:57
theorem Th58: :: AMI_3:58
theorem Th59: :: AMI_3:59
theorem Th60: :: AMI_3:60
theorem Th61: :: AMI_3:61
theorem Th62: :: AMI_3:62
theorem Th63: :: AMI_3:63
theorem Th64: :: AMI_3:64
theorem Th65: :: AMI_3:65
theorem Th66: :: AMI_3:66
theorem Th67: :: AMI_3:67
theorem Th68: :: AMI_3:68
theorem Th69: :: AMI_3:69
for
I being
set holds
(
I is
Instruction of
SCM iff (
I = [0,{} ] or ex
a,
b being
Data-Location st
I = a := b or ex
a,
b being
Data-Location st
I = AddTo a,
b or ex
a,
b being
Data-Location st
I = SubFrom a,
b or ex
a,
b being
Data-Location st
I = MultBy a,
b or ex
a,
b being
Data-Location st
I = Divide a,
b or ex
loc being
Instruction-Location of
SCM st
I = goto loc or ex
a being
Data-Location ex
loc being
Instruction-Location of
SCM st
I = a =0_goto loc or ex
a being
Data-Location ex
loc being
Instruction-Location of
SCM st
I = a >0_goto loc ) )
by ;
theorem Th70: :: AMI_3:70
theorem Th71: :: AMI_3:71