Proof: Pc 9

Let's prove the following theorem:

if the following are true:

instruction #2 is addi dst=5 src=5 imm=1
the PC at time 9 = 2

then the PC at time 10 = 3

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments