Proof: Byte 1 Stays the Same 5

Let's prove the following theorem:

if the following are true:

instruction #11 is addi dst=3 src=0 imm=3
the PC at time 5 = 11
value of cell 1 at time 5 = 127

then value of cell 1 at time 6 = 127

Proof:

View as a tree | View dependent proofs | Try proving it

Given

1	instruction #11 is `addi dst=3 src=0 imm=3`
2	the PC at time 5 = 11
3	value of cell 1 at time 5 = 127

Proof Table

#	Claim	Reason
1	not (1 = 3)	not (1 = 3) (Fixed Value Statement)
2	value of cell 1 at time (5 + 1) = value of cell 1 at time 5	if instruction #11 is `addi dst=3 src=0 imm=3` and the PC at time 5 = 11 and not (1 = 3), then value of cell 1 at time (5 + 1) = value of cell 1 at time 5 (ADDI Instruction Property 2)
3	5 + 1 = 6	5 + 1 = 6 (Fixed Value Statement)
4	value of cell 1 at time (5 + 1) = value of cell 1 at time 6	if 5 + 1 = 6, then value of cell 1 at time (5 + 1) = value of cell 1 at time 6 (Substitution)
5	value of cell 1 at time 6 = value of cell 1 at time 5	if value of cell 1 at time (5 + 1) = value of cell 1 at time 6 and value of cell 1 at time (5 + 1) = value of cell 1 at time 5, then value of cell 1 at time 6 = value of cell 1 at time 5 (Transitive Property of Equality Variation 2)
6	value of cell 1 at time 6 = 127	if value of cell 1 at time 6 = value of cell 1 at time 5 and value of cell 1 at time 5 = 127, then value of cell 1 at time 6 = 127 (Transitive Property of Equality)

Comments

Please log in to add comments