Proof: Do Control Map At Unchanged 16

Let's prove the following theorem:

if the following are true:

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

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

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments