:: AMI_5 semantic presentation
Lm1:
for a being Data-Location
for s being State of SCM holds
( (Exec (Divide a,a),s) . (IC SCM ) = Next (IC s) & (Exec (Divide a,a),s) . a = (s . a) mod (s . a) & ( for c being Data-Location st c <> a holds
(Exec (Divide a,a),s) . c = s . c ) )
by AMI_3:12;
Lm2:
for x being set st x in SCM-Data-Loc holds
x is Data-Location
by AMI_3:def 2;
theorem :: AMI_5:1
canceled;
theorem :: AMI_5:2
canceled;
theorem :: AMI_5:3
canceled;
theorem :: AMI_5:4
canceled;
theorem :: AMI_5:5
canceled;
theorem :: AMI_5:6
canceled;
theorem :: AMI_5:7
canceled;
theorem :: AMI_5:8
canceled;
theorem :: AMI_5:9
canceled;
theorem :: AMI_5:10
canceled;
theorem :: AMI_5:11
canceled;
theorem :: AMI_5:12
canceled;
theorem :: AMI_5:13
canceled;
theorem :: AMI_5:14
canceled;
theorem :: AMI_5:15
canceled;
theorem :: AMI_5:16
canceled;
theorem :: AMI_5:17
canceled;
theorem Th18: :: AMI_5:18
theorem Th19: :: AMI_5:19
theorem Th20: :: AMI_5:20
theorem :: AMI_5:21
canceled;
theorem Th22: :: AMI_5:22
theorem Th23: :: AMI_5:23
theorem :: AMI_5:24
theorem Th25: :: AMI_5:25
theorem :: AMI_5:26
theorem Th27: :: AMI_5:27
theorem Th28: :: AMI_5:28
theorem :: AMI_5:29
theorem :: AMI_5:30
theorem Th31: :: AMI_5:31
theorem Th32: :: AMI_5:32
theorem Th33: :: AMI_5:33
theorem :: AMI_5:34
theorem Th35: :: AMI_5:35
:: deftheorem defines InsCode AMI_5:def 1 :
:: deftheorem defines @ AMI_5:def 2 :
:: deftheorem defines @ AMI_5:def 3 :
:: deftheorem defines @ AMI_5:def 4 :
theorem Th36: :: AMI_5:36
theorem Th37: :: AMI_5:37
theorem :: AMI_5:38
canceled;
theorem :: AMI_5:39
canceled;
theorem :: AMI_5:40
canceled;
theorem :: AMI_5:41
canceled;
theorem :: AMI_5:42
canceled;
theorem :: AMI_5:43
canceled;
theorem :: AMI_5:44
canceled;
theorem :: AMI_5:45
canceled;
theorem Th46: :: AMI_5:46
theorem Th47: :: AMI_5:47
theorem Th48: :: AMI_5:48
theorem Th49: :: AMI_5:49
theorem Th50: :: AMI_5:50
theorem Th51: :: AMI_5:51
theorem Th52: :: AMI_5:52
theorem Th53: :: AMI_5:53
theorem Th54: :: AMI_5:54
theorem :: AMI_5:55
theorem :: AMI_5:56
theorem :: AMI_5:57
theorem Th58: :: AMI_5:58
theorem Th59: :: AMI_5:59
theorem Th60: :: AMI_5:60
:: deftheorem defines pi AMI_5:def 5 :
theorem Th61: :: AMI_5:61
:: deftheorem defines ProgramPart AMI_5:def 6 :
:: deftheorem defines DataPart AMI_5:def 7 :
:: deftheorem Def8 defines data-only AMI_5:def 8 :
Lm3:
for p being FinPartState of SCM holds DataPart p = p | SCM-Data-Loc
Lm4:
for f being FinPartState of SCM holds
( f is data-only iff dom f c= SCM-Data-Loc )
Lm5:
for N being set
for S being non empty AMI-Struct of N
for p being FinPartState of S holds DataPart p c= p
by RELAT_1:88;
Lm6:
for N being set
for S being AMI-Struct of N
for p being FinPartState of S holds ProgramPart p c= p
by RELAT_1:88;
theorem :: AMI_5:62
canceled;
theorem :: AMI_5:63
canceled;
theorem :: AMI_5:64
theorem Th65: :: AMI_5:65
theorem Th66: :: AMI_5:66
theorem :: AMI_5:67
theorem :: AMI_5:68
theorem :: AMI_5:69
theorem :: AMI_5:70
canceled;
theorem Th71: :: AMI_5:71
theorem Th72: :: AMI_5:72
theorem :: AMI_5:73
theorem :: AMI_5:74
theorem :: AMI_5:75
:: deftheorem defines data-only AMI_5:def 9 :
theorem :: AMI_5:76
theorem :: AMI_5:77
theorem :: AMI_5:78
theorem :: AMI_5:79
theorem :: AMI_5:80
theorem :: AMI_5:81
theorem :: AMI_5:82
theorem Th83: :: AMI_5:83
theorem Th84: :: AMI_5:84
theorem :: AMI_5:85
theorem Th86: :: AMI_5:86
theorem Th87: :: AMI_5:87
theorem :: AMI_5:88
theorem :: AMI_5:89
theorem :: AMI_5:90
theorem :: AMI_5:91
theorem :: AMI_5:92
theorem :: AMI_5:93
theorem :: AMI_5:94
theorem :: AMI_5:95
theorem :: AMI_5:96
theorem :: AMI_5:97