Proof: Get Begin Expr Value 26

Let's prove the following theorem:

if the following are true:

expression state at time 26 = "begin_expr"
the expression at time 26 = self."y" = 0
Value Stack at time 26 = [ ]

then Value Stack at time 27 = [ [ ], [ ] ]

Proof:

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

Given

1	expression state at time 26 = "begin_expr"
2	the expression at time 26 = self."y" = 0
3	Value Stack at time 26 = [ ]

Proof Table

#	Claim	Reason
1	Value Stack at time (26 + 1) = [ [ ], Value Stack at time 26 ]	if expression state at time 26 = "begin_expr" and the expression at time 26 = self."y" = 0, then Value Stack at time (26 + 1) = [ [ ], Value Stack at time 26 ] (Begin Set Attribute Arguments (1))
2	[ [ ], Value Stack at time 26 ] = [ [ ], [ ] ]	if Value Stack at time 26 = [ ], then [ [ ], Value Stack at time 26 ] = [ [ ], [ ] ] (Substitution)
3	Value Stack at time (26 + 1) = [ [ ], [ ] ]	if Value Stack at time (26 + 1) = [ [ ], Value Stack at time 26 ] and [ [ ], Value Stack at time 26 ] = [ [ ], [ ] ], then Value Stack at time (26 + 1) = [ [ ], [ ] ] (Transitive Property of Equality)
4	26 + 1 = 27	26 + 1 = 27 (Fixed Value Statement)
5	Value Stack at time (26 + 1) = Value Stack at time 27	if 26 + 1 = 27, then Value Stack at time (26 + 1) = Value Stack at time 27 (Substitution)
6	Value Stack at time 27 = [ [ ], [ ] ]	if Value Stack at time (26 + 1) = Value Stack at time 27 and Value Stack at time (26 + 1) = [ [ ], [ ] ], then Value Stack at time 27 = [ [ ], [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments