Proof: Do Control Map At Unchanged 13

Let's prove the following theorem:

if the following are true:

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

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

Proof:

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

Given

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

Proof Table

#	Claim	Reason
1	Control Map at time (13 + 1) = Control Map at time 13	if expression state at time 13 = "begin_expr", then Control Map at time (13 + 1) = Control Map at time 13 (Insn Count Begin Expression (7))
2	Control Map at time (13 + 1) = [ entry 0: (pair ("while", 2)), [ ] ]	if Control Map at time (13 + 1) = Control Map at time 13 and Control Map at time 13 = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time (13 + 1) = [ entry 0: (pair ("while", 2)), [ ] ] (Transitive Property of Equality)
3	13 + 1 = 14	13 + 1 = 14 (Fixed Value Statement)
4	Control Map at time (13 + 1) = Control Map at time 14	if 13 + 1 = 14, then Control Map at time (13 + 1) = Control Map at time 14 (Substitution)
5	Control Map at time 14 = [ entry 0: (pair ("while", 2)), [ ] ]	if Control Map at time (13 + 1) = Control Map at time 14 and Control Map at time (13 + 1) = [ entry 0: (pair ("while", 2)), [ ] ], then Control Map at time 14 = [ entry 0: (pair ("while", 2)), [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments