Proof: Pc 11

Let's prove the following theorem:

if the following are true:

instruction #3 is addi dst=5 src=5 imm=7
the PC at time 11 = 3

then the PC at time 12 = 4

Proof:

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

Given

1	instruction #3 is `addi dst=5 src=5 imm=7`
2	the PC at time 11 = 3

Proof Table

#	Claim	Reason
1	the PC at time (11 + 1) = 3 + 1	if instruction #3 is `addi dst=5 src=5 imm=7` and the PC at time 11 = 3, then the PC at time (11 + 1) = 3 + 1 (Program Counter on ADDI)
2	11 + 1 = 12	11 + 1 = 12 (Fixed Value Statement)
3	3 + 1 = 4	3 + 1 = 4 (Fixed Value Statement)
4	the PC at time (11 + 1) = the PC at time 12	if 11 + 1 = 12, then the PC at time (11 + 1) = the PC at time 12 (Substitution)
5	the PC at time 12 = 4	if the PC at time (11 + 1) = 3 + 1 and the PC at time (11 + 1) = the PC at time 12 and 3 + 1 = 4, then the PC at time 12 = 4 (Transitive Property Application 2)

Comments

Please log in to add comments