Proof: Write Skip Line Stack At 1

Let's prove the following theorem:

if the following are true:
  • the line at time 1 = 2
  • the tab at time 1 = 0
  • statement at line 2, tab 1 = z = __add__(x, 3)
  • stack at time 1 = [ ]

then stack at time 2 = [ ]

Proof:

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

Given
1 the line at time 1 = 2
2 the tab at time 1 = 0
3 statement at line 2, tab 1 = z = __add__(x, 3)
4 stack at time 1 = [ ]
Proof Table
# Claim Reason
1 1 > 0 1 > 0
2 stack at time (1 + 1) = stack at time 1 if the line at time 1 = 2 and the tab at time 1 = 0 and statement at line 2, tab 1 = z = __add__(x, 3) and 1 > 0, then stack at time (1 + 1) = stack at time 1
3 stack at time (1 + 1) = [ ] if stack at time (1 + 1) = stack at time 1 and stack at time 1 = [ ], then stack at time (1 + 1) = [ ]
4 1 + 1 = 2 1 + 1 = 2
5 stack at time (1 + 1) = stack at time 2 if 1 + 1 = 2, then stack at time (1 + 1) = stack at time 2
6 stack at time 2 = [ ] if stack at time (1 + 1) = stack at time 2 and stack at time (1 + 1) = [ ], then stack at time 2 = [ ]

Comments

Please log in to add comments