Proof: Do Arg Stack At Unchanged 9

Let's prove the following theorem:

if the following are true:
  • expression state at time 9 = "call_function_begin"
  • arguments stack at time 9 = [ ]

then arguments stack at time 10 = [ ]

Proof:

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

Given
1 expression state at time 9 = "call_function_begin"
2 arguments stack at time 9 = [ ]
Proof Table
# Claim Reason
1 arguments stack at time (9 + 1) = arguments stack at time 9 if expression state at time 9 = "call_function_begin", then arguments stack at time (9 + 1) = arguments stack at time 9
2 arguments stack at time (9 + 1) = [ ] if arguments stack at time (9 + 1) = arguments stack at time 9 and arguments stack at time 9 = [ ], then arguments stack at time (9 + 1) = [ ]
3 9 + 1 = 10 9 + 1 = 10
4 arguments stack at time (9 + 1) = arguments stack at time 10 if 9 + 1 = 10, then arguments stack at time (9 + 1) = arguments stack at time 10
5 arguments stack at time 10 = [ ] if arguments stack at time (9 + 1) = arguments stack at time 10 and arguments stack at time (9 + 1) = [ ], then arguments stack at time 10 = [ ]

Comments

Please log in to add comments