Proof: Get Iterate End State 66

Let's prove the following theorem:

if the following are true:

expression state at time 66 = "iterate_args"
arguments stack at time 66 = [ [ ], [ [ 12, [ ] ], [ ] ] ]
parent stack at time 66 = [ self.age, [ __mul__(self.age, 12), [ ] ] ]

then expression state at time 67 = "call_function_begin"

Proof:

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

Given

1	expression state at time 66 = "iterate_args"
2	arguments stack at time 66 = [ [ ], [ [ 12, [ ] ], [ ] ] ]
3	parent stack at time 66 = [ `self.age`, [ `__mul__(self.age, 12)`, [ ] ] ]

Proof Table

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

Comments

Please log in to add comments