Proof: Compare Example Eq

Let's prove the following theorem:

Proof:

Proof Table

#	Claim	Reason
1	compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = compare bit 1 and bit 1	compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = compare bit 1 and bit 1 (Compare x to y)
2	compare bit 1 and bit 1 = [ 1, [ 0, [ ] ] ]	compare bit 1 and bit 1 = [ 1, [ 0, [ ] ] ] (Compare 1 to 1)
3	compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = [ 1, [ 0, [ ] ] ]	if compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = compare bit 1 and bit 1 and compare bit 1 and bit 1 = [ 1, [ 0, [ ] ] ], then compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = [ 1, [ 0, [ ] ] ] (Transitive Property of Equality)

Comments

Please log in to add comments