Proof: Do Stack At Unchanged 26

Let's prove the following theorem:

if the following are true:
  • expression state at time 26 = "begin_expr"
  • stack at time 26 = [ 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 27 = [ 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 26 = "begin_expr"
2 stack at time 26 = [ 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 (26 + 1) = stack at time 26 if expression state at time 26 = "begin_expr", then stack at time (26 + 1) = stack at time 26
2 stack at time (26 + 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 (26 + 1) = stack at time 26 and stack at time 26 = [ 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 (26 + 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 26 + 1 = 27 26 + 1 = 27
4 stack at time (26 + 1) = stack at time 27 if 26 + 1 = 27, then stack at time (26 + 1) = stack at time 27
5 stack at time 27 = [ 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 (26 + 1) = stack at time 27 and stack at time (26 + 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 27 = [ 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