Proof: Do Arg Stack At Unchanged 44

Let's prove the following theorem:

if the following are true:

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

then arguments stack at time 45 = [ ]

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments