Proof: Do Arg Stack At Unchanged 7

Let's prove the following theorem:

if the following are true:

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

then arguments stack at time 8 = [ [ ], [ ] ]

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments