Proof: Get Begin Expr State 15

Let's prove the following theorem:

if the following are true:

the expression at time 15 = 7
expression state at time 15 = "begin_expr"
7 is constant
parent stack at time 15 = [ __eq__(7, 9), [ ] ]

then expression state at time 16 = "return"

Proof:

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

Given

1	the expression at time 15 = 7
2	expression state at time 15 = "begin_expr"
3	7 is constant
4	parent stack at time 15 = [ `__eq__(7, 9)`, [ ] ]

Proof Table

#	Claim	Reason
1	expression state at time (15 + 1) = "return"	if expression state at time 15 = "begin_expr" and the expression at time 15 = 7 and 7 is constant and parent stack at time 15 = [ `__eq__(7, 9)`, [ ] ], then expression state at time (15 + 1) = "return" (Evaluate Constant Argument State Property)
2	15 + 1 = 16	15 + 1 = 16 (Fixed Value Statement)
3	expression state at time (15 + 1) = expression state at time 16	if 15 + 1 = 16, then expression state at time (15 + 1) = expression state at time 16 (Substitution)
4	expression state at time 16 = "return"	if expression state at time (15 + 1) = expression state at time 16 and expression state at time (15 + 1) = "return", then expression state at time 16 = "return" (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments