Proof: Do Stack At Unchanged 69

Let's prove the following theorem:

if the following are true:

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

then stack at time 70 = [ ]

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments