Proof: Pc 10

Let's prove the following theorem:

if the following are true:

instruction #3 is addi dst=6 src=6 imm=1
the PC at time 10 = 3

then the PC at time 11 = 4

Proof:

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

Given

1	instruction #3 is `addi dst=6 src=6 imm=1`
2	the PC at time 10 = 3

Proof Table

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

Comments

Please log in to add comments