Proof: Do Control Map At Unchanged 33

Let's prove the following theorem:

if the following are true:

expression state at time 33 = "call_function_begin"
Control Map at time 33 = [ entry 0: (pair ("while", 2)), [ ] ]

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

Proof:

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

Given

1	expression state at time 33 = "call_function_begin"
2	Control Map at time 33 = [ entry 0: (pair ("while", 2)), [ ] ]

Proof Table

#	Claim	Reason
1	Control Map at time (33 + 1) = Control Map at time 33	if expression state at time 33 = "call_function_begin", then Control Map at time (33 + 1) = Control Map at time 33 (Assign Parent (9))
2	Control Map at time (33 + 1) = [ entry 0: (pair ("while", 2)), [ ] ]	if Control Map at time (33 + 1) = Control Map at time 33 and Control Map at time 33 = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time (33 + 1) = [ entry 0: (pair ("while", 2)), [ ] ] (Transitive Property of Equality)
3	33 + 1 = 34	33 + 1 = 34 (Fixed Value Statement)
4	Control Map at time (33 + 1) = Control Map at time 34	if 33 + 1 = 34, then Control Map at time (33 + 1) = Control Map at time 34 (Substitution)
5	Control Map at time 34 = [ entry 0: (pair ("while", 2)), [ ] ]	if Control Map at time (33 + 1) = Control Map at time 34 and Control Map at time (33 + 1) = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time 34 = [ entry 0: (pair ("while", 2)), [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments