Proof: Get Begin Expr Params 67

Let's prove the following theorem:

if the following are true:

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

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

Proof:

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

Given

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

Proof Table

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

Comments

Please log in to add comments