Proof: Get Iterate End State 30

Let's prove the following theorem:

if the following are true:

expression state at time 30 = "iterate_args"
arguments stack at time 30 = [ [ ], [ ] ]
parent stack at time 30 = [ self."y" = 0, [ ] ]

then expression state at time 31 = "call_function_begin"

Proof:

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

Given

1	expression state at time 30 = "iterate_args"
2	arguments stack at time 30 = [ [ ], [ ] ]
3	parent stack at time 30 = [ self."y" = 0, [ ] ]

Proof Table

#	Claim	Reason
1	expression state at time (30 + 1) = "call_function_begin"	if expression state at time 30 = "iterate_args" and arguments stack at time 30 = [ [ ], [ ] ] and parent stack at time 30 = [ self."y" = 0, [ ] ], then expression state at time (30 + 1) = "call_function_begin" (Iterate Arguments Finished State Rule)
2	30 + 1 = 31	30 + 1 = 31 (Fixed Value Statement)
3	expression state at time (30 + 1) = expression state at time 31	if 30 + 1 = 31, then expression state at time (30 + 1) = expression state at time 31 (Substitution)
4	expression state at time 31 = "call_function_begin"	if expression state at time (30 + 1) = expression state at time 31 and expression state at time (30 + 1) = "call_function_begin", then expression state at time 31 = "call_function_begin" (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments