Proof: Write Assign End Stack 26

Let's prove the following theorem:

if the following are true:
  • the line at time 26 = 1
  • the tab at time 26 = 0
  • statement at line 1, tab 0 = locations = {"ES": "Estonia", "MX": "Mexico"}
  • stack at time 26 = [ ]
  • expression state at time 26 = "end_expr"

then stack at time 27 = [ ]

Proof:

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

Given
1 the line at time 26 = 1
2 the tab at time 26 = 0
3 statement at line 1, tab 0 = locations = {"ES": "Estonia", "MX": "Mexico"}
4 stack at time 26 = [ ]
5 expression state at time 26 = "end_expr"
Proof Table
# Claim Reason
1 stack at time (26 + 1) = stack at time 26 if the line at time 26 = 1 and the tab at time 26 = 0 and statement at line 1, tab 0 = locations = {"ES": "Estonia", "MX": "Mexico"} and expression state at time 26 = "end_expr", then stack at time (26 + 1) = stack at time 26
2 stack at time (26 + 1) = [ ] if stack at time (26 + 1) = stack at time 26 and stack at time 26 = [ ], then stack at time (26 + 1) = [ ]
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 = [ ] if stack at time (26 + 1) = stack at time 27 and stack at time (26 + 1) = [ ], then stack at time 27 = [ ]

Comments

Please log in to add comments