Proof: Do Arg Stack At Unchanged 33

Let's prove the following theorem:

if the following are true:

expression state at time 33 = "call_function_begin"
arguments stack at time 33 = [ ]

then arguments stack at time 34 = [ ]

Proof:

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

Given

1	expression state at time 33 = "call_function_begin"
2	arguments stack at time 33 = [ ]

Proof Table

#	Claim	Reason
1	arguments stack at time (33 + 1) = arguments stack at time 33	if expression state at time 33 = "call_function_begin", then arguments stack at time (33 + 1) = arguments stack at time 33 (Assign Parent (2))
2	arguments stack at time (33 + 1) = [ ]	if arguments stack at time (33 + 1) = arguments stack at time 33 and arguments stack at time 33 = [ ], then arguments stack at time (33 + 1) = [ ] (Transitive Property of Equality)
3	33 + 1 = 34	33 + 1 = 34 (Fixed Value Statement)
4	arguments stack at time (33 + 1) = arguments stack at time 34	if 33 + 1 = 34, then arguments stack at time (33 + 1) = arguments stack at time 34 (Substitution)
5	arguments stack at time 34 = [ ]	if arguments stack at time (33 + 1) = arguments stack at time 34 and arguments stack at time (33 + 1) = [ ], then arguments stack at time 34 = [ ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments