TWOSCOMP: 2's Complement Circuit. Part I. Boolean Operators and 2's Complement Circuit Properties

:: 2's Complement Circuit. Part I. Boolean Operators and 2's Complement Circuit Properties
:: by Katsumi Wasaki and Pauline N. Kawamoto
::
:: Received October 25, 1996
:: Copyright (c) 1996-2012 Association of Mizar Users

begin

::---------------------------------------------------------------------------
:: Preliminaries
::---------------------------------------------------------------------------

definition

let S be non empty non void unsplit ManySortedSign ;
let A be Boolean Circuit of S;
let s be State of A;
let v be Vertex of S;
:: original: .
redefine func s . v -> Element of BOOLEAN ;
coherence

proof end;

end;

deffunc H₁( Element of BOOLEAN , Element of BOOLEAN ) -> Element of BOOLEAN = $1 '&' $2;

definition

func and2 -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def1: :: TWOSCOMP:def 1
for x, y being Element of BOOLEAN holds it . <*x,y*> = x '&' y;

proof end;

proof end;

func and2a -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def2: :: TWOSCOMP:def 2
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) '&' y;

proof end;

proof end;

func and2b -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def3: :: TWOSCOMP:def 3
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) '&' ('not' y);

proof end;

proof end;

end;

:: deftheorem Def1 defines and2 TWOSCOMP:def 1 :

:: deftheorem Def2 defines and2a TWOSCOMP:def 2 :

:: deftheorem Def3 defines and2b TWOSCOMP:def 3 :

definition

func nand2 -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def4: :: TWOSCOMP:def 4
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (x '&' y);

proof end;

proof end;

func nand2a -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def5: :: TWOSCOMP:def 5
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (('not' x) '&' y);

proof end;

proof end;

func nand2b -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def6: :: TWOSCOMP:def 6
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (('not' x) '&' ('not' y));

proof end;

proof end;

end;

:: deftheorem Def4 defines nand2 TWOSCOMP:def 4 :

:: deftheorem Def5 defines nand2a TWOSCOMP:def 5 :

:: deftheorem Def6 defines nand2b TWOSCOMP:def 6 :

definition

func or2 -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def7: :: TWOSCOMP:def 7
for x, y being Element of BOOLEAN holds it . <*x,y*> = x 'or' y;

proof end;

proof end;

func or2a -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def8: :: TWOSCOMP:def 8
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) 'or' y;

proof end;

proof end;

func or2b -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def9: :: TWOSCOMP:def 9
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) 'or' ('not' y);

proof end;

proof end;

end;

:: deftheorem Def7 defines or2 TWOSCOMP:def 7 :

:: deftheorem Def8 defines or2a TWOSCOMP:def 8 :

:: deftheorem Def9 defines or2b TWOSCOMP:def 9 :

definition

func nor2 -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def10: :: TWOSCOMP:def 10
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (x 'or' y);

proof end;

proof end;

func nor2a -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def11: :: TWOSCOMP:def 11
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (('not' x) 'or' y);

proof end;

proof end;

func nor2b -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def12: :: TWOSCOMP:def 12
for x, y being Element of BOOLEAN holds it . <*x,y*> = 'not' (('not' x) 'or' ('not' y));

proof end;

proof end;

end;

:: deftheorem Def10 defines nor2 TWOSCOMP:def 10 :

:: deftheorem Def11 defines nor2a TWOSCOMP:def 11 :

:: deftheorem Def12 defines nor2b TWOSCOMP:def 12 :

definition

func xor2 -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def13: :: TWOSCOMP:def 13
for x, y being Element of BOOLEAN holds it . <*x,y*> = x 'xor' y;

proof end;

proof end;

func xor2a -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def14: :: TWOSCOMP:def 14
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) 'xor' y;

proof end;

proof end;

func xor2b -> Function of (2 -tuples_on BOOLEAN),BOOLEAN means :Def15: :: TWOSCOMP:def 15
for x, y being Element of BOOLEAN holds it . <*x,y*> = ('not' x) 'xor' ('not' y);

proof end;

proof end;

end;

:: deftheorem Def13 defines xor2 TWOSCOMP:def 13 :

:: deftheorem Def14 defines xor2a TWOSCOMP:def 14 :

:: deftheorem Def15 defines xor2b TWOSCOMP:def 15 :

theorem :: TWOSCOMP:1

for x, y being Element of BOOLEAN holds
( and2 . <*x,y*> = x '&' y & and2a . <*x,y*> = ('not' x) '&' y & and2b . <*x,y*> = ('not' x) '&' ('not' y) ) by Def1, Def2, Def3;

theorem :: TWOSCOMP:2

for x, y being Element of BOOLEAN holds
( nand2 . <*x,y*> = 'not' (x '&' y) & nand2a . <*x,y*> = 'not' (('not' x) '&' y) & nand2b . <*x,y*> = 'not' (('not' x) '&' ('not' y)) ) by Def4, Def5, Def6;

theorem :: TWOSCOMP:3

for x, y being Element of BOOLEAN holds
( or2 . <*x,y*> = x 'or' y & or2a . <*x,y*> = ('not' x) 'or' y & or2b . <*x,y*> = ('not' x) 'or' ('not' y) ) by Def7, Def8, Def9;

theorem :: TWOSCOMP:4

for x, y being Element of BOOLEAN holds
( nor2 . <*x,y*> = 'not' (x 'or' y) & nor2a . <*x,y*> = 'not' (('not' x) 'or' y) & nor2b . <*x,y*> = 'not' (('not' x) 'or' ('not' y)) ) by Def10, Def11, Def12;

theorem :: TWOSCOMP:5

for x, y being Element of BOOLEAN holds
( xor2 . <*x,y*> = x 'xor' y & xor2a . <*x,y*> = ('not' x) 'xor' y & xor2b . <*x,y*> = ('not' x) 'xor' ('not' y) ) by Def13, Def14, Def15;

theorem :: TWOSCOMP:6

for x, y being Element of BOOLEAN holds
( and2 . <*x,y*> = nor2b . <*x,y*> & and2a . <*x,y*> = nor2a . <*y,x*> & and2b . <*x,y*> = nor2 . <*x,y*> )

proof end;

theorem :: TWOSCOMP:7

for x, y being Element of BOOLEAN holds
( or2 . <*x,y*> = nand2b . <*x,y*> & or2a . <*x,y*> = nand2a . <*y,x*> & or2b . <*x,y*> = nand2 . <*x,y*> )

proof end;

theorem :: TWOSCOMP:8

for x, y being Element of BOOLEAN holds xor2b . <*x,y*> = xor2 . <*x,y*>

proof end;

theorem :: TWOSCOMP:9

( and2 . <*0,0*> = 0 & and2 . <*0,1*> = 0 & and2 . <*1,0*> = 0 & and2 . <*1,1*> = 1 & and2a . <*0,0*> = 0 & and2a . <*0,1*> = 1 & and2a . <*1,0*> = 0 & and2a . <*1,1*> = 0 & and2b . <*0,0*> = 1 & and2b . <*0,1*> = 0 & and2b . <*1,0*> = 0 & and2b . <*1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:10

( or2 . <*0,0*> = 0 & or2 . <*0,1*> = 1 & or2 . <*1,0*> = 1 & or2 . <*1,1*> = 1 & or2a . <*0,0*> = 1 & or2a . <*0,1*> = 1 & or2a . <*1,0*> = 0 & or2a . <*1,1*> = 1 & or2b . <*0,0*> = 1 & or2b . <*0,1*> = 1 & or2b . <*1,0*> = 1 & or2b . <*1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:11

( xor2 . <*0,0*> = 0 & xor2 . <*0,1*> = 1 & xor2 . <*1,0*> = 1 & xor2 . <*1,1*> = 0 & xor2a . <*0,0*> = 1 & xor2a . <*0,1*> = 0 & xor2a . <*1,0*> = 0 & xor2a . <*1,1*> = 1 )

proof end;

:: 3-Input Operators

definition

func and3 -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def16: :: TWOSCOMP:def 16
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (x '&' y) '&' z;

proof end;

proof end;

func and3a -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def17: :: TWOSCOMP:def 17
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) '&' y) '&' z;

proof end;

proof end;

func and3b -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def18: :: TWOSCOMP:def 18
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) '&' ('not' y)) '&' z;

proof end;

proof end;

func and3c -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def19: :: TWOSCOMP:def 19
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) '&' ('not' y)) '&' ('not' z);

proof end;

proof end;

end;

:: deftheorem Def16 defines and3 TWOSCOMP:def 16 :

:: deftheorem Def17 defines and3a TWOSCOMP:def 17 :

:: deftheorem Def18 defines and3b TWOSCOMP:def 18 :

:: deftheorem Def19 defines and3c TWOSCOMP:def 19 :

definition

func nand3 -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def20: :: TWOSCOMP:def 20
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((x '&' y) '&' z);

proof end;

proof end;

func nand3a -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def21: :: TWOSCOMP:def 21
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) '&' y) '&' z);

proof end;

proof end;

func nand3b -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def22: :: TWOSCOMP:def 22
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) '&' ('not' y)) '&' z);

proof end;

proof end;

func nand3c -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def23: :: TWOSCOMP:def 23
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) '&' ('not' y)) '&' ('not' z));

proof end;

proof end;

end;

:: deftheorem Def20 defines nand3 TWOSCOMP:def 20 :

:: deftheorem Def21 defines nand3a TWOSCOMP:def 21 :

:: deftheorem Def22 defines nand3b TWOSCOMP:def 22 :

:: deftheorem Def23 defines nand3c TWOSCOMP:def 23 :

definition

func or3 -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def24: :: TWOSCOMP:def 24
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (x 'or' y) 'or' z;

proof end;

proof end;

func or3a -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def25: :: TWOSCOMP:def 25
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) 'or' y) 'or' z;

proof end;

proof end;

func or3b -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def26: :: TWOSCOMP:def 26
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) 'or' ('not' y)) 'or' z;

proof end;

proof end;

func or3c -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def27: :: TWOSCOMP:def 27
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (('not' x) 'or' ('not' y)) 'or' ('not' z);

proof end;

proof end;

end;

:: deftheorem Def24 defines or3 TWOSCOMP:def 24 :

:: deftheorem Def25 defines or3a TWOSCOMP:def 25 :

:: deftheorem Def26 defines or3b TWOSCOMP:def 26 :

:: deftheorem Def27 defines or3c TWOSCOMP:def 27 :

definition

func nor3 -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def28: :: TWOSCOMP:def 28
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((x 'or' y) 'or' z);

proof end;

proof end;

func nor3a -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def29: :: TWOSCOMP:def 29
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) 'or' y) 'or' z);

proof end;

proof end;

func nor3b -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def30: :: TWOSCOMP:def 30
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) 'or' ('not' y)) 'or' z);

proof end;

proof end;

func nor3c -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def31: :: TWOSCOMP:def 31
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = 'not' ((('not' x) 'or' ('not' y)) 'or' ('not' z));

proof end;

proof end;

end;

:: deftheorem Def28 defines nor3 TWOSCOMP:def 28 :

:: deftheorem Def29 defines nor3a TWOSCOMP:def 29 :

:: deftheorem Def30 defines nor3b TWOSCOMP:def 30 :

:: deftheorem Def31 defines nor3c TWOSCOMP:def 31 :

definition

func xor3 -> Function of (3 -tuples_on BOOLEAN),BOOLEAN means :Def32: :: TWOSCOMP:def 32
for x, y, z being Element of BOOLEAN holds it . <*x,y,z*> = (x 'xor' y) 'xor' z;

proof end;

proof end;

end;

:: deftheorem Def32 defines xor3 TWOSCOMP:def 32 :

theorem :: TWOSCOMP:12

for x, y, z being Element of BOOLEAN holds
( and3 . <*x,y,z*> = (x '&' y) '&' z & and3a . <*x,y,z*> = (('not' x) '&' y) '&' z & and3b . <*x,y,z*> = (('not' x) '&' ('not' y)) '&' z & and3c . <*x,y,z*> = (('not' x) '&' ('not' y)) '&' ('not' z) ) by Def16, Def17, Def18, Def19;

theorem :: TWOSCOMP:13

for x, y, z being Element of BOOLEAN holds
( nand3 . <*x,y,z*> = 'not' ((x '&' y) '&' z) & nand3a . <*x,y,z*> = 'not' ((('not' x) '&' y) '&' z) & nand3b . <*x,y,z*> = 'not' ((('not' x) '&' ('not' y)) '&' z) & nand3c . <*x,y,z*> = 'not' ((('not' x) '&' ('not' y)) '&' ('not' z)) ) by Def20, Def21, Def22, Def23;

theorem :: TWOSCOMP:14

for x, y, z being Element of BOOLEAN holds
( or3 . <*x,y,z*> = (x 'or' y) 'or' z & or3a . <*x,y,z*> = (('not' x) 'or' y) 'or' z & or3b . <*x,y,z*> = (('not' x) 'or' ('not' y)) 'or' z & or3c . <*x,y,z*> = (('not' x) 'or' ('not' y)) 'or' ('not' z) ) by Def24, Def25, Def26, Def27;

theorem :: TWOSCOMP:15

for x, y, z being Element of BOOLEAN holds
( nor3 . <*x,y,z*> = 'not' ((x 'or' y) 'or' z) & nor3a . <*x,y,z*> = 'not' ((('not' x) 'or' y) 'or' z) & nor3b . <*x,y,z*> = 'not' ((('not' x) 'or' ('not' y)) 'or' z) & nor3c . <*x,y,z*> = 'not' ((('not' x) 'or' ('not' y)) 'or' ('not' z)) ) by Def28, Def29, Def30, Def31;

theorem :: TWOSCOMP:16

for x, y, z being Element of BOOLEAN holds
( and3 . <*x,y,z*> = nor3c . <*x,y,z*> & and3a . <*x,y,z*> = nor3b . <*z,y,x*> & and3b . <*x,y,z*> = nor3a . <*z,y,x*> & and3c . <*x,y,z*> = nor3 . <*x,y,z*> )

proof end;

theorem :: TWOSCOMP:17

for x, y, z being Element of BOOLEAN holds
( or3 . <*x,y,z*> = nand3c . <*x,y,z*> & or3a . <*x,y,z*> = nand3b . <*z,y,x*> & or3b . <*x,y,z*> = nand3a . <*z,y,x*> & or3c . <*x,y,z*> = nand3 . <*x,y,z*> )

proof end;

theorem :: TWOSCOMP:18

( and3 . <*0,0,0*> = 0 & and3 . <*0,0,1*> = 0 & and3 . <*0,1,0*> = 0 & and3 . <*0,1,1*> = 0 & and3 . <*1,0,0*> = 0 & and3 . <*1,0,1*> = 0 & and3 . <*1,1,0*> = 0 & and3 . <*1,1,1*> = 1 )

proof end;

theorem :: TWOSCOMP:19

( and3a . <*0,0,0*> = 0 & and3a . <*0,0,1*> = 0 & and3a . <*0,1,0*> = 0 & and3a . <*0,1,1*> = 1 & and3a . <*1,0,0*> = 0 & and3a . <*1,0,1*> = 0 & and3a . <*1,1,0*> = 0 & and3a . <*1,1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:20

( and3b . <*0,0,0*> = 0 & and3b . <*0,0,1*> = 1 & and3b . <*0,1,0*> = 0 & and3b . <*0,1,1*> = 0 & and3b . <*1,0,0*> = 0 & and3b . <*1,0,1*> = 0 & and3b . <*1,1,0*> = 0 & and3b . <*1,1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:21

( and3c . <*0,0,0*> = 1 & and3c . <*0,0,1*> = 0 & and3c . <*0,1,0*> = 0 & and3c . <*0,1,1*> = 0 & and3c . <*1,0,0*> = 0 & and3c . <*1,0,1*> = 0 & and3c . <*1,1,0*> = 0 & and3c . <*1,1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:22

( or3 . <*0,0,0*> = 0 & or3 . <*0,0,1*> = 1 & or3 . <*0,1,0*> = 1 & or3 . <*0,1,1*> = 1 & or3 . <*1,0,0*> = 1 & or3 . <*1,0,1*> = 1 & or3 . <*1,1,0*> = 1 & or3 . <*1,1,1*> = 1 )

proof end;

theorem :: TWOSCOMP:23

( or3a . <*0,0,0*> = 1 & or3a . <*0,0,1*> = 1 & or3a . <*0,1,0*> = 1 & or3a . <*0,1,1*> = 1 & or3a . <*1,0,0*> = 0 & or3a . <*1,0,1*> = 1 & or3a . <*1,1,0*> = 1 & or3a . <*1,1,1*> = 1 )

proof end;

theorem :: TWOSCOMP:24

( or3b . <*0,0,0*> = 1 & or3b . <*0,0,1*> = 1 & or3b . <*0,1,0*> = 1 & or3b . <*0,1,1*> = 1 & or3b . <*1,0,0*> = 1 & or3b . <*1,0,1*> = 1 & or3b . <*1,1,0*> = 0 & or3b . <*1,1,1*> = 1 )

proof end;

theorem :: TWOSCOMP:25

( or3c . <*0,0,0*> = 1 & or3c . <*0,0,1*> = 1 & or3c . <*0,1,0*> = 1 & or3c . <*0,1,1*> = 1 & or3c . <*1,0,0*> = 1 & or3c . <*1,0,1*> = 1 & or3c . <*1,1,0*> = 1 & or3c . <*1,1,1*> = 0 )

proof end;

theorem :: TWOSCOMP:26

( xor3 . <*0,0,0*> = 0 & xor3 . <*0,0,1*> = 1 & xor3 . <*0,1,0*> = 1 & xor3 . <*0,1,1*> = 0 & xor3 . <*1,0,0*> = 1 & xor3 . <*1,0,1*> = 0 & xor3 . <*1,1,0*> = 0 & xor3 . <*1,1,1*> = 1 )

proof end;

begin

::---------------------------------------------------------------------------
:: 1bit 2's Complement Circuit (Complementor + Incrementor)
::---------------------------------------------------------------------------
:: Complementor

definition

let x, b be set ;

func CompStr (x,b) -> non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign equals :: TWOSCOMP:def 33
1GateCircStr (<*x,b*>,xor2a);

end;

:: deftheorem defines CompStr TWOSCOMP:def 33 :

definition

let x, b be set ;

func CompCirc (x,b) -> strict gate`2=den Boolean Circuit of CompStr (x,b) equals :: TWOSCOMP:def 34
1GateCircuit (x,b,xor2a);

end;

:: deftheorem defines CompCirc TWOSCOMP:def 34 :

definition

let x, b be set ;

func CompOutput (x,b) -> Element of InnerVertices (CompStr (x,b)) equals :: TWOSCOMP:def 35
[<*x,b*>,xor2a];

coherence by FACIRC_1:47;

end;

:: deftheorem defines CompOutput TWOSCOMP:def 35 :

:: Incrementor

definition

let x, b be set ;

func IncrementStr (x,b) -> non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign equals :: TWOSCOMP:def 36
1GateCircStr (<*x,b*>,and2a);

end;

:: deftheorem defines IncrementStr TWOSCOMP:def 36 :

definition

let x, b be set ;

func IncrementCirc (x,b) -> strict gate`2=den Boolean Circuit of IncrementStr (x,b) equals :: TWOSCOMP:def 37
1GateCircuit (x,b,and2a);

end;

:: deftheorem defines IncrementCirc TWOSCOMP:def 37 :

definition

let x, b be set ;

func IncrementOutput (x,b) -> Element of InnerVertices (IncrementStr (x,b)) equals :: TWOSCOMP:def 38
[<*x,b*>,and2a];

coherence by FACIRC_1:47;

end;

:: deftheorem defines IncrementOutput TWOSCOMP:def 38 :

:: 2's-BitComplementor

definition

let x, b be set ;

func BitCompStr (x,b) -> non empty non void strict unsplit gate`1=arity gate`2isBoolean ManySortedSign equals :: TWOSCOMP:def 39
(CompStr (x,b)) +* (IncrementStr (x,b));

end;

:: deftheorem defines BitCompStr TWOSCOMP:def 39 :

definition

let x, b be set ;

func BitCompCirc (x,b) -> strict gate`2=den Boolean Circuit of BitCompStr (x,b) equals :: TWOSCOMP:def 40
(CompCirc (x,b)) +* (IncrementCirc (x,b));

end;

:: deftheorem defines BitCompCirc TWOSCOMP:def 40 :

theorem Th27: :: TWOSCOMP:27

for x, b being non pair set holds the carrier of (CompStr (x,b)) = {x,b} \/ {[<*x,b*>,xor2a]}

proof end;

theorem :: TWOSCOMP:28

for x, b being non pair set holds [<*x,b*>,xor2a] in InnerVertices (CompStr (x,b))

proof end;

theorem :: TWOSCOMP:29

for x, b being non pair set holds
( x in InputVertices (CompStr (x,b)) & b in InputVertices (CompStr (x,b)) )

proof end;

theorem :: TWOSCOMP:30

for x, b being non pair set holds InputVertices (CompStr (x,b)) is without_pairs

proof end;

theorem Th31: :: TWOSCOMP:31

for x, b being non pair set holds the carrier of (IncrementStr (x,b)) = {x,b} \/ {[<*x,b*>,and2a]}

proof end;

theorem :: TWOSCOMP:32

for x, b being non pair set holds [<*x,b*>,and2a] in InnerVertices (IncrementStr (x,b))

proof end;

theorem :: TWOSCOMP:33

for x, b being non pair set holds
( x in InputVertices (IncrementStr (x,b)) & b in InputVertices (IncrementStr (x,b)) )

proof end;

theorem :: TWOSCOMP:34

for x, b being non pair set holds InputVertices (IncrementStr (x,b)) is without_pairs

proof end;

:: 2's-BitComplementor

theorem :: TWOSCOMP:35

for x, b being non pair set holds InnerVertices (BitCompStr (x,b)) is Relation

proof end;

theorem Th36: :: TWOSCOMP:36

for x, b being non pair set holds
( x in the carrier of (BitCompStr (x,b)) & b in the carrier of (BitCompStr (x,b)) & [<*x,b*>,xor2a] in the carrier of (BitCompStr (x,b)) & [<*x,b*>,and2a] in the carrier of (BitCompStr (x,b)) )

proof end;

theorem Th37: :: TWOSCOMP:37

for x, b being non pair set holds the carrier of (BitCompStr (x,b)) = {x,b} \/ {[<*x,b*>,xor2a],[<*x,b*>,and2a]}

proof end;

theorem Th38: :: TWOSCOMP:38

for x, b being non pair set holds InnerVertices (BitCompStr (x,b)) = {[<*x,b*>,xor2a],[<*x,b*>,and2a]}

proof end;

theorem Th39: :: TWOSCOMP:39

for x, b being non pair set holds
( [<*x,b*>,xor2a] in InnerVertices (BitCompStr (x,b)) & [<*x,b*>,and2a] in InnerVertices (BitCompStr (x,b)) )

proof end;

theorem Th40: :: TWOSCOMP:40

for x, b being non pair set holds InputVertices (BitCompStr (x,b)) = {x,b}

proof end;

theorem Th41: :: TWOSCOMP:41

for x, b being non pair set holds
( x in InputVertices (BitCompStr (x,b)) & b in InputVertices (BitCompStr (x,b)) )

proof end;

theorem :: TWOSCOMP:42

for x, b being non pair set holds InputVertices (BitCompStr (x,b)) is without_pairs

proof end;

::------------------------------------------------------------------------
:: for s being State of BitCompCirc(x,b) holds (Following s) is stable
::------------------------------------------------------------------------

theorem Th43: :: TWOSCOMP:43

for x, b being non pair set
for s being State of (CompCirc (x,b)) holds
( (Following s) . (CompOutput (x,b)) = xor2a . <*(s . x),(s . b)*> & (Following s) . x = s . x & (Following s) . b = s . b )

proof end;

theorem :: TWOSCOMP:44

for x, b being non pair set
for s being State of (CompCirc (x,b))
for a1, a2 being Element of BOOLEAN st a1 = s . x & a2 = s . b holds
( (Following s) . (CompOutput (x,b)) = ('not' a1) 'xor' a2 & (Following s) . x = a1 & (Following s) . b = a2 )

proof end;

theorem Th45: :: TWOSCOMP:45

for x, b being non pair set
for s being State of (BitCompCirc (x,b)) holds
( (Following s) . (CompOutput (x,b)) = xor2a . <*(s . x),(s . b)*> & (Following s) . x = s . x & (Following s) . b = s . b )

proof end;

theorem Th46: :: TWOSCOMP:46

for x, b being non pair set
for s being State of (BitCompCirc (x,b))
for a1, a2 being Element of BOOLEAN st a1 = s . x & a2 = s . b holds
( (Following s) . (CompOutput (x,b)) = ('not' a1) 'xor' a2 & (Following s) . x = a1 & (Following s) . b = a2 )

proof end;

theorem Th47: :: TWOSCOMP:47

for x, b being non pair set
for s being State of (IncrementCirc (x,b)) holds
( (Following s) . (IncrementOutput (x,b)) = and2a . <*(s . x),(s . b)*> & (Following s) . x = s . x & (Following s) . b = s . b )

proof end;

theorem :: TWOSCOMP:48

for x, b being non pair set
for s being State of (IncrementCirc (x,b))
for a1, a2 being Element of BOOLEAN st a1 = s . x & a2 = s . b holds
( (Following s) . (IncrementOutput (x,b)) = ('not' a1) '&' a2 & (Following s) . x = a1 & (Following s) . b = a2 )

proof end;

theorem Th49: :: TWOSCOMP:49

for x, b being non pair set
for s being State of (BitCompCirc (x,b)) holds
( (Following s) . (IncrementOutput (x,b)) = and2a . <*(s . x),(s . b)*> & (Following s) . x = s . x & (Following s) . b = s . b )

proof end;

theorem Th50: :: TWOSCOMP:50

for x, b being non pair set
for s being State of (BitCompCirc (x,b))
for a1, a2 being Element of BOOLEAN st a1 = s . x & a2 = s . b holds
( (Following s) . (IncrementOutput (x,b)) = ('not' a1) '&' a2 & (Following s) . x = a1 & (Following s) . b = a2 )

proof end;

theorem :: TWOSCOMP:51

for x, b being non pair set
for s being State of (BitCompCirc (x,b)) holds
( (Following s) . (CompOutput (x,b)) = xor2a . <*(s . x),(s . b)*> & (Following s) . (IncrementOutput (x,b)) = and2a . <*(s . x),(s . b)*> & (Following s) . x = s . x & (Following s) . b = s . b ) by Th45, Th49;

theorem :: TWOSCOMP:52

for x, b being non pair set
for s being State of (BitCompCirc (x,b))
for a1, a2 being Element of BOOLEAN st a1 = s . x & a2 = s . b holds
( (Following s) . (CompOutput (x,b)) = ('not' a1) 'xor' a2 & (Following s) . (IncrementOutput (x,b)) = ('not' a1) '&' a2 & (Following s) . x = a1 & (Following s) . b = a2 ) by Th46, Th50;

theorem :: TWOSCOMP:53

for x, b being non pair set
for s being State of (BitCompCirc (x,b)) holds Following s is stable

proof end;