Proof: Do Stack At Unchanged 12

Let's prove the following theorem:

if the following are true:

expression state at time 12 = "begin_expr"
stack at time 12 = [ ]

then stack at time 13 = [ ]

Proof:

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

Given

1	expression state at time 12 = "begin_expr"
2	stack at time 12 = [ ]

Proof Table

#	Claim	Reason
1	stack at time (12 + 1) = stack at time 12	if expression state at time 12 = "begin_expr", then stack at time (12 + 1) = stack at time 12 (Insn Count Begin Expression (5))
2	stack at time (12 + 1) = [ ]	if stack at time (12 + 1) = stack at time 12 and stack at time 12 = [ ], then stack at time (12 + 1) = [ ] (Transitive Property of Equality)
3	12 + 1 = 13	12 + 1 = 13 (Fixed Value Statement)
4	stack at time (12 + 1) = stack at time 13	if 12 + 1 = 13, then stack at time (12 + 1) = stack at time 13 (Substitution)
5	stack at time 13 = [ ]	if stack at time (12 + 1) = stack at time 13 and stack at time (12 + 1) = [ ], then stack at time 13 = [ ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments