Proof: Compare Example Two

Let's prove the following theorem:

Proof:

Proof Table

#	Claim	Reason
1	compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = [ 1, [ 0, [ ] ] ]	compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = [ 1, [ 0, [ ] ] ] (compare_example_eq)
2	compare bit stack [ 0, [ 1, [ ] ] ] and bit stack [ 1, [ 1, [ ] ] ] = compare bit 0 and bit 1	if compare bit stack [ 1, [ ] ] and bit stack [ 1, [ ] ] = [ 1, [ 0, [ ] ] ], then compare bit stack [ 0, [ 1, [ ] ] ] and bit stack [ 1, [ 1, [ ] ] ] = compare bit 0 and bit 1 (Equal Bits Could Change)
3	compare bit 0 and bit 1 = [ 0, [ 0, [ ] ] ]	compare bit 0 and bit 1 = [ 0, [ 0, [ ] ] ] (Compare 0 to 1)
4	compare bit stack [ 0, [ 1, [ ] ] ] and bit stack [ 1, [ 1, [ ] ] ] = [ 0, [ 0, [ ] ] ]	if compare bit stack [ 0, [ 1, [ ] ] ] and bit stack [ 1, [ 1, [ ] ] ] = compare bit 0 and bit 1 and compare bit 0 and bit 1 = [ 0, [ 0, [ ] ] ], then compare bit stack [ 0, [ 1, [ ] ] ] and bit stack [ 1, [ 1, [ ] ] ] = [ 0, [ 0, [ ] ] ] (Transitive Property of Equality)

Comments

Please log in to add comments