Proof: Byte 4 Stays the Same 9

Let's prove the following theorem:

if the following are true:

instruction #5 is beq left=3 right=4 imm=1
the PC at time 9 = 5
value of cell 4 at time 9 = 2

then value of cell 4 at time 10 = 2

Proof:

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

Given

1	instruction #5 is `beq left=3 right=4 imm=1`
2	the PC at time 9 = 5
3	value of cell 4 at time 9 = 2

Proof Table

#	Claim	Reason
1	value of cell 4 at time (9 + 1) = value of cell 4 at time 9	if instruction #5 is `beq left=3 right=4 imm=1` and the PC at time 9 = 5, then value of cell 4 at time (9 + 1) = value of cell 4 at time 9 (BEQ Instruction Property 3)
2	9 + 1 = 10	9 + 1 = 10 (Fixed Value Statement)
3	value of cell 4 at time (9 + 1) = value of cell 4 at time 10	if 9 + 1 = 10, then value of cell 4 at time (9 + 1) = value of cell 4 at time 10 (Substitution)
4	value of cell 4 at time 10 = value of cell 4 at time 9	if value of cell 4 at time (9 + 1) = value of cell 4 at time 10 and value of cell 4 at time (9 + 1) = value of cell 4 at time 9, then value of cell 4 at time 10 = value of cell 4 at time 9 (Transitive Property of Equality Variation 2)
5	value of cell 4 at time 10 = 2	if value of cell 4 at time 10 = value of cell 4 at time 9 and value of cell 4 at time 9 = 2, then value of cell 4 at time 10 = 2 (Transitive Property of Equality)

Comments

Please log in to add comments