Proof: Do Arg Stack At Unchanged 39

Let's prove the following theorem:

if the following are true:
  • expression state at time 39 = "return"
  • arguments stack at time 39 = [ [ 1, [ ] ], [ ] ]

then arguments stack at time 40 = [ [ 1, [ ] ], [ ] ]

Proof:

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

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

Comments

Please log in to add comments