Proof: Do Stack At Unchanged 22

Let's prove the following theorem:

if the following are true:

expression state at time 22 = "call_function_begin"
stack at time 22 = [ ]

then stack at time 23 = [ ]

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments