Proof: Do Stack At Unchanged 31

Let's prove the following theorem:

if the following are true:
  • expression state at time 31 = "call_function_begin"
  • stack at time 31 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ]

then stack at time 32 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ]

Proof:

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

Given
1 expression state at time 31 = "call_function_begin"
2 stack at time 31 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ]
Proof Table
# Claim Reason
1 stack at time (31 + 1) = stack at time 31 if expression state at time 31 = "call_function_begin", then stack at time (31 + 1) = stack at time 31
2 stack at time (31 + 1) = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ] if stack at time (31 + 1) = stack at time 31 and stack at time 31 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ], then stack at time (31 + 1) = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ]
3 31 + 1 = 32 31 + 1 = 32
4 stack at time (31 + 1) = stack at time 32 if 31 + 1 = 32, then stack at time (31 + 1) = stack at time 32
5 stack at time 32 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ] if stack at time (31 + 1) = stack at time 32 and stack at time (31 + 1) = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ], then stack at time 32 = [ program context with variables: [ ] and expression state: (expression state with parent stack: [ ] arguments: [ ] values: [ ] line: 10 tab: 0) and control map: [ entry 0: (pair ("class", "Dog")), [ ] ], [ ] ]

Comments

Please log in to add comments