Proof: Get Iterate End Expr 13

Let's prove the following theorem:

if the following are true:

expression state at time 13 = "iterate_args"
arguments stack at time 13 = [ [ ], [ ] ]
parent stack at time 13 = [ Dog(), [ ] ]

then the expression at time 14 = Dog()

Proof:

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

Given

1	expression state at time 13 = "iterate_args"
2	arguments stack at time 13 = [ [ ], [ ] ]
3	parent stack at time 13 = [ `Dog()`, [ ] ]

Proof Table

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

Comments

Please log in to add comments