Proof: Do Stack At Unchanged 3

Let's prove the following theorem:

if the following are true:

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

then stack at time 4 = [ ]

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments