Proof: Write Stmt Control Map At Unchanged 35

Let's prove the following theorem:

if the following are true:
  • the line at time 35 = 3
  • the tab at time 35 = 1
  • statement at line 3, tab 1 = a = __add__(a, 1)
  • Control Map at time 35 = [ entry 0: (pair ("while", 2)), [ ] ]

then Control Map at time 36 = [ entry 0: (pair ("while", 2)), [ ] ]

Proof:

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

Given
1 the line at time 35 = 3
2 the tab at time 35 = 1
3 statement at line 3, tab 1 = a = __add__(a, 1)
4 Control Map at time 35 = [ entry 0: (pair ("while", 2)), [ ] ]
Proof Table
# Claim Reason
1 Control Map at time (35 + 1) = Control Map at time 35 if the line at time 35 = 3 and the tab at time 35 = 1 and statement at line 3, tab 1 = a = __add__(a, 1), then Control Map at time (35 + 1) = Control Map at time 35
2 Control Map at time (35 + 1) = [ entry 0: (pair ("while", 2)), [ ] ] if Control Map at time (35 + 1) = Control Map at time 35 and Control Map at time 35 = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time (35 + 1) = [ entry 0: (pair ("while", 2)), [ ] ]
3 35 + 1 = 36 35 + 1 = 36
4 Control Map at time (35 + 1) = Control Map at time 36 if 35 + 1 = 36, then Control Map at time (35 + 1) = Control Map at time 36
5 Control Map at time 36 = [ entry 0: (pair ("while", 2)), [ ] ] if Control Map at time (35 + 1) = Control Map at time 36 and Control Map at time (35 + 1) = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time 36 = [ entry 0: (pair ("while", 2)), [ ] ]

Comments

Please log in to add comments