Proof: Reverse One

Let's prove the following theorem:

Proof:

Proof Table

#	Claim	Reason
1	reverse of [ [ 0, [ ] ], [ ] ] = reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ]	reverse of [ [ 0, [ ] ], [ ] ] = reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ] (Reversing a List Property 1)
2	reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ] = [ [ 0, [ ] ], [ ] ]	reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ] = [ [ 0, [ ] ], [ ] ] (Reversing a List Property 4)
3	reverse of [ [ 0, [ ] ], [ ] ] = [ [ 0, [ ] ], [ ] ]	if reverse of [ [ 0, [ ] ], [ ] ] = reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ] and reverse of remaining stack [ [ 0, [ ] ], [ ] ] and already reversed stack [ ] = [ [ 0, [ ] ], [ ] ], then reverse of [ [ 0, [ ] ], [ ] ] = [ [ 0, [ ] ], [ ] ] (Transitive Property of Equality)

Comments

Please log in to add comments