Proof: Get Begin Expr Params 37

Let's prove the following theorem:

if the following are true:

expression state at time 37 = "begin_expr"
the expression at time 37 = joe.move()
arguments stack at time 37 = [ ]

then arguments stack at time 38 = [ [ ], [ ] ]

Proof:

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

Given

1	expression state at time 37 = "begin_expr"
2	the expression at time 37 = `joe.move()`
3	arguments stack at time 37 = [ ]

Proof Table

#	Claim	Reason
1	arguments stack at time (37 + 1) = [ [ ], arguments stack at time 37 ]	if expression state at time 37 = "begin_expr" and the expression at time 37 = `joe.move()`, then arguments stack at time (37 + 1) = [ [ ], arguments stack at time 37 ] (Push Method Arguments)
2	[ [ ], arguments stack at time 37 ] = [ [ ], [ ] ]	if arguments stack at time 37 = [ ], then [ [ ], arguments stack at time 37 ] = [ [ ], [ ] ] (Substitution)
3	arguments stack at time (37 + 1) = [ [ ], [ ] ]	if arguments stack at time (37 + 1) = [ [ ], arguments stack at time 37 ] and [ [ ], arguments stack at time 37 ] = [ [ ], [ ] ], then arguments stack at time (37 + 1) = [ [ ], [ ] ] (Transitive Property of Equality)
4	37 + 1 = 38	37 + 1 = 38 (Fixed Value Statement)
5	arguments stack at time (37 + 1) = arguments stack at time 38	if 37 + 1 = 38, then arguments stack at time (37 + 1) = arguments stack at time 38 (Substitution)
6	arguments stack at time 38 = [ [ ], [ ] ]	if arguments stack at time (37 + 1) = arguments stack at time 38 and arguments stack at time (37 + 1) = [ [ ], [ ] ], then arguments stack at time 38 = [ [ ], [ ] ] (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments