Proof: Write End Decrement If State 14

Let's prove the following theorem:

if the following are true:

the line at time 14 = 5
the tab at time 14 = 1
number of lines = 5 - 1
Control Map at time 14 = [ entry 0: (pair ("if", False)), [ ] ]

then expression state at time 15 = "not_expr"

Proof:

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

Given

1	the line at time 14 = 5
2	the tab at time 14 = 1
3	number of lines = 5 - 1
4	Control Map at time 14 = [ entry 0: (pair ("if", False)), [ ] ]

Proof Table

#	Claim	Reason
1	value at (1 - 1) in map (Control Map at time 14) = pair ("if", False)	if Control Map at time 14 = [ entry 0: (pair ("if", False)), [ ] ], then value at (1 - 1) in map (Control Map at time 14) = pair ("if", False) (Get Decrement Key Value Control Map At 14)
2	expression state at time (14 + 1) = "not_expr"	if the line at time 14 = 5 and the tab at time 14 = 1 and number of lines = 5 - 1 and value at (1 - 1) in map (Control Map at time 14) = pair ("if", False), then expression state at time (14 + 1) = "not_expr" (Decrement Tab At If End (3))
3	14 + 1 = 15	14 + 1 = 15 (Fixed Value Statement)
4	expression state at time (14 + 1) = expression state at time 15	if 14 + 1 = 15, then expression state at time (14 + 1) = expression state at time 15 (Substitution)
5	expression state at time 15 = "not_expr"	if expression state at time (14 + 1) = expression state at time 15 and expression state at time (14 + 1) = "not_expr", then expression state at time 15 = "not_expr" (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments