Proof: Get Begin Expr State 28

Let's prove the following theorem:

if the following are true:

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

then expression state at time 29 = "return"

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments