Proof: Get Iterate End Expr 19

Let's prove the following theorem:

if the following are true:

expression state at time 19 = "iterate_args"
arguments stack at time 19 = [ [ ], [ ] ]
parent stack at time 19 = [ Person("John", "Smith", 25), [ ] ]

then the expression at time 20 = Person("John", "Smith", 25)

Proof:

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

Given

1	expression state at time 19 = "iterate_args"
2	arguments stack at time 19 = [ [ ], [ ] ]
3	parent stack at time 19 = [ `Person("John", "Smith", 25)`, [ ] ]

Proof Table

#	Claim	Reason
1	the expression at time (19 + 1) = `Person("John", "Smith", 25)`	if expression state at time 19 = "iterate_args" and arguments stack at time 19 = [ [ ], [ ] ] and parent stack at time 19 = [ `Person("John", "Smith", 25)`, [ ] ], then the expression at time (19 + 1) = `Person("John", "Smith", 25)` (Iterate Arguments Finished Rule)
2	19 + 1 = 20	19 + 1 = 20 (Fixed Value Statement)
3	the expression at time (19 + 1) = the expression at time 20	if 19 + 1 = 20, then the expression at time (19 + 1) = the expression at time 20 (Substitution)
4	the expression at time 20 = `Person("John", "Smith", 25)`	if the expression at time (19 + 1) = the expression at time 20 and the expression at time (19 + 1) = `Person("John", "Smith", 25)`, then the expression at time 20 = `Person("John", "Smith", 25)` (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments