Proof: Do Control Map At Unchanged 17

Let's prove the following theorem:

if the following are true:

expression state at time 17 = "return"
Control Map at time 17 = [ entry 0: (pair ("function", "add_three")), [ ] ]

then Control Map at time 18 = [ entry 0: (pair ("function", "add_three")), [ ] ]

Proof:

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

Given

1	expression state at time 17 = "return"
2	Control Map at time 17 = [ entry 0: (pair ("function", "add_three")), [ ] ]

Proof Table

#	Claim	Reason
1	Control Map at time (17 + 1) = Control Map at time 17	if expression state at time 17 = "return", then Control Map at time (17 + 1) = Control Map at time 17 (Return (10))
2	Control Map at time (17 + 1) = [ entry 0: (pair ("function", "add_three")), [ ] ]	if Control Map at time (17 + 1) = Control Map at time 17 and Control Map at time 17 = [ entry 0: (pair ("function", "add_three")), [ ] ], then Control Map at time (17 + 1) = [ entry 0: (pair ("function", "add_three")), [ ] ] (Transitive Property of Equality)
3	17 + 1 = 18	17 + 1 = 18 (Fixed Value Statement)
4	Control Map at time (17 + 1) = Control Map at time 18	if 17 + 1 = 18, then Control Map at time (17 + 1) = Control Map at time 18 (Substitution)
5	Control Map at time 18 = [ entry 0: (pair ("function", "add_three")), [ ] ]	if Control Map at time (17 + 1) = Control Map at time 18 and Control Map at time (17 + 1) = [ entry 0: (pair ("function", "add_three")), [ ] ], then Control Map at time 18 = [ entry 0: (pair ("function", "add_three")), [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments