Proof: Get Begin Expr State 20

Let's prove the following theorem:

if the following are true:

the expression at time 20 = 0
expression state at time 20 = "begin_expr"
0 is constant
parent stack at time 20 = [ self."x" = 0, [ ] ]

then expression state at time 21 = "return"

Proof:

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

Given

1	the expression at time 20 = 0
2	expression state at time 20 = "begin_expr"
3	0 is constant
4	parent stack at time 20 = [ self."x" = 0, [ ] ]

Proof Table

#	Claim	Reason
1	expression state at time (20 + 1) = "return"	if expression state at time 20 = "begin_expr" and the expression at time 20 = 0 and 0 is constant and parent stack at time 20 = [ self."x" = 0, [ ] ], then expression state at time (20 + 1) = "return" (Evaluate Constant Argument State Property)
2	20 + 1 = 21	20 + 1 = 21 (Fixed Value Statement)
3	expression state at time (20 + 1) = expression state at time 21	if 20 + 1 = 21, then expression state at time (20 + 1) = expression state at time 21 (Substitution)
4	expression state at time 21 = "return"	if expression state at time (20 + 1) = expression state at time 21 and expression state at time (20 + 1) = "return", then expression state at time 21 = "return" (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments