Proof: Do Arg Stack At Unchanged 28

Let's prove the following theorem:

if the following are true:

expression state at time 28 = "return"
arguments stack at time 28 = [ [ 2, [ ] ], [ ] ]

then arguments stack at time 29 = [ [ 2, [ ] ], [ ] ]

Proof:

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

Given

1	expression state at time 28 = "return"
2	arguments stack at time 28 = [ [ 2, [ ] ], [ ] ]

Proof Table

#	Claim	Reason
1	arguments stack at time (28 + 1) = arguments stack at time 28	if expression state at time 28 = "return", then arguments stack at time (28 + 1) = arguments stack at time 28 (Return (3))
2	arguments stack at time (28 + 1) = [ [ 2, [ ] ], [ ] ]	if arguments stack at time (28 + 1) = arguments stack at time 28 and arguments stack at time 28 = [ [ 2, [ ] ], [ ] ], then arguments stack at time (28 + 1) = [ [ 2, [ ] ], [ ] ] (Transitive Property of Equality)
3	28 + 1 = 29	28 + 1 = 29 (Fixed Value Statement)
4	arguments stack at time (28 + 1) = arguments stack at time 29	if 28 + 1 = 29, then arguments stack at time (28 + 1) = arguments stack at time 29 (Substitution)
5	arguments stack at time 29 = [ [ 2, [ ] ], [ ] ]	if arguments stack at time (28 + 1) = arguments stack at time 29 and arguments stack at time (28 + 1) = [ [ 2, [ ] ], [ ] ], then arguments stack at time 29 = [ [ 2, [ ] ], [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments