Proof: Get Begin Expr Params 73

Let's prove the following theorem:

if the following are true:

expression state at time 73 = "begin_expr"
the expression at time 73 = self."y" = 5
arguments stack at time 73 = [ ]

then arguments stack at time 74 = [ [ 5, [ ] ], [ ] ]

Proof:

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

Given

1	expression state at time 73 = "begin_expr"
2	the expression at time 73 = self."y" = 5
3	arguments stack at time 73 = [ ]

Proof Table

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

Comments

Please log in to add comments