:: BINARI_3 semantic presentation
theorem Th1: :: BINARI_3:1
theorem Th2: :: BINARI_3:2
theorem Th3: :: BINARI_3:3
theorem Th4: :: BINARI_3:4
theorem Th5: :: BINARI_3:5
theorem Th6: :: BINARI_3:6
theorem Th7: :: BINARI_3:7
theorem Th8: :: BINARI_3:8
theorem Th9: :: BINARI_3:9
theorem Th10: :: BINARI_3:10
theorem Th11: :: BINARI_3:11
theorem Th12: :: BINARI_3:12
theorem Th13: :: BINARI_3:13
theorem Th14: :: BINARI_3:14
theorem Th15: :: BINARI_3:15
theorem Th16: :: BINARI_3:16
theorem Th17: :: BINARI_3:17
theorem Th18: :: BINARI_3:18
theorem Th19: :: BINARI_3:19
theorem Th20: :: BINARI_3:20
theorem Th21: :: BINARI_3:21
theorem Th22: :: BINARI_3:22
theorem Th23: :: BINARI_3:23
theorem Th24: :: BINARI_3:24
theorem Th25: :: BINARI_3:25
definition
let n be
Nat,
k be
Nat;
func c1 -BinarySequence c2 -> Tuple of
a1,
BOOLEAN means :
Def1:
:: BINARI_3:def 1
for
i being
Element of
NAT st
i in Seg n holds
it /. i = IFEQ ((k div (2 to_power (i -' 1))) mod 2),0,
FALSE ,
TRUE ;
existence
ex b1 being Tuple of n,BOOLEAN st
for i being Element of NAT st i in Seg n holds
b1 /. i = IFEQ ((k div (2 to_power (i -' 1))) mod 2),0,FALSE ,TRUE
uniqueness
for b1, b2 being Tuple of n,BOOLEAN st ( for i being Element of NAT st i in Seg n holds
b1 /. i = IFEQ ((k div (2 to_power (i -' 1))) mod 2),0,FALSE ,TRUE ) & ( for i being Element of NAT st i in Seg n holds
b2 /. i = IFEQ ((k div (2 to_power (i -' 1))) mod 2),0,FALSE ,TRUE ) holds
b1 = b2
end;
:: deftheorem Def1 defines -BinarySequence BINARI_3:def 1 :
theorem Th26: :: BINARI_3:26
theorem Th27: :: BINARI_3:27
theorem Th28: :: BINARI_3:28
Lemma96:
for n being non empty Element of NAT holds (n + 1) -BinarySequence (2 to_power n) = (0* n) ^ <*TRUE *>
Lemma99:
for n being non empty Element of NAT
for k being Element of NAT st 2 to_power n <= k & k < 2 to_power (n + 1) holds
((n + 1) -BinarySequence k) . (n + 1) = TRUE
Lemma100:
for n being non empty Element of NAT
for k being Element of NAT st 2 to_power n <= k & k < 2 to_power (n + 1) holds
(n + 1) -BinarySequence k = (n -BinarySequence (k -' (2 to_power n))) ^ <*TRUE *>
Lemma101:
for n being non empty Element of NAT
for k being Element of NAT st k < 2 to_power n holds
for x being Tuple of n,BOOLEAN st x = 0* n holds
( n -BinarySequence k = 'not' x iff k = (2 to_power n) - 1 )
theorem Th29: :: BINARI_3:29
theorem Th30: :: BINARI_3:30
theorem Th31: :: BINARI_3:31
theorem Th32: :: BINARI_3:32
theorem Th33: :: BINARI_3:33
theorem Th34: :: BINARI_3:34
theorem Th35: :: BINARI_3:35
theorem Th36: :: BINARI_3:36
theorem Th37: :: BINARI_3:37