Proof: Get Begin Expr State 75

Let's prove the following theorem:

if the following are true:

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

then expression state at time 76 = "return"

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments