Proof: Get Iterate End State 19

Let's prove the following theorem:

if the following are true:

expression state at time 19 = "iterate_args"
arguments stack at time 19 = [ [ ], [ ] ]
parent stack at time 19 = [ Person("John", "Smith", 25), [ ] ]

then expression state at time 20 = "call_function_begin"

Proof:

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

Given

1	expression state at time 19 = "iterate_args"
2	arguments stack at time 19 = [ [ ], [ ] ]
3	parent stack at time 19 = [ `Person("John", "Smith", 25)`, [ ] ]

Proof Table

#	Claim	Reason
1	expression state at time (19 + 1) = "call_function_begin"	if expression state at time 19 = "iterate_args" and arguments stack at time 19 = [ [ ], [ ] ] and parent stack at time 19 = [ `Person("John", "Smith", 25)`, [ ] ], then expression state at time (19 + 1) = "call_function_begin" (Iterate Arguments Finished State Rule)
2	19 + 1 = 20	19 + 1 = 20 (Fixed Value Statement)
3	expression state at time (19 + 1) = expression state at time 20	if 19 + 1 = 20, then expression state at time (19 + 1) = expression state at time 20 (Substitution)
4	expression state at time 20 = "call_function_begin"	if expression state at time (19 + 1) = expression state at time 20 and expression state at time (19 + 1) = "call_function_begin", then expression state at time 20 = "call_function_begin" (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments