Proof: Minimum Example 2

Let's prove the following theorem:

Proof:

Proof Table

#	Claim	Reason
1	[ 1, [ ] ] is greater than [ 0, [ ] ]	[ 1, [ ] ] is greater than [ 0, [ ] ] (greater_than_example)
2	minimum value of stack [ [ 0, [ ] ], [ ] ] = [ 0, [ ] ]	minimum value of stack [ [ 0, [ ] ], [ ] ] = [ 0, [ ] ] (Minimum Of A Single Element List)
3	[ 1, [ ] ] is greater than (minimum value of stack [ [ 0, [ ] ], [ ] ])	if [ 1, [ ] ] is greater than [ 0, [ ] ] and minimum value of stack [ [ 0, [ ] ], [ ] ] = [ 0, [ ] ], then [ 1, [ ] ] is greater than (minimum value of stack [ [ 0, [ ] ], [ ] ]) (Greater Than Substitution)
4	minimum value of stack [ [ 1, [ ] ], [ [ 0, [ ] ], [ ] ] ] = minimum value of stack [ [ 0, [ ] ], [ ] ]	if [ 1, [ ] ] is greater than (minimum value of stack [ [ 0, [ ] ], [ ] ]), then minimum value of stack [ [ 1, [ ] ], [ [ 0, [ ] ], [ ] ] ] = minimum value of stack [ [ 0, [ ] ], [ ] ] (Minimum Value (2))
5	minimum value of stack [ [ 1, [ ] ], [ [ 0, [ ] ], [ ] ] ] = [ 0, [ ] ]	if minimum value of stack [ [ 1, [ ] ], [ [ 0, [ ] ], [ ] ] ] = minimum value of stack [ [ 0, [ ] ], [ ] ] and minimum value of stack [ [ 0, [ ] ], [ ] ] = [ 0, [ ] ], then minimum value of stack [ [ 1, [ ] ], [ [ 0, [ ] ], [ ] ] ] = [ 0, [ ] ] (Transitive Property of Equality)

Comments

Please log in to add comments