let a, b, c be Int-Location; :: thesis: ( a <> b implies not MultBy (b,c) destroys a )
assume A1: a <> b ; :: thesis: not MultBy (b,c) destroys a

now :: thesis: for e being Int-Location
for l being Element of NAT
for f being FinSeq-Location holds
( a := e <> MultBy (b,c) & AddTo (a,e) <> MultBy (b,c) & SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )

let e be Int-Location; :: thesis: for l being Element of NAT
for f being FinSeq-Location holds
( a := e <> MultBy (b,c) & AddTo (a,e) <> MultBy (b,c) & SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
let l be Element of NAT ; :: thesis: for f being FinSeq-Location holds
( a := e <> MultBy (b,c) & AddTo (a,e) <> MultBy (b,c) & SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
let f be FinSeq-Location ; :: thesis: ( a := e <> MultBy (b,c) & AddTo (a,e) <> MultBy (b,c) & SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
A2: InsCode (MultBy (b,c)) = 4 by SCMFSA_2:21;
hence a := e <> MultBy (b,c) by SCMFSA_2:18; :: thesis: ( AddTo (a,e) <> MultBy (b,c) & SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
thus AddTo (a,e) <> MultBy (b,c) by A2, SCMFSA_2:19; :: thesis: ( SubFrom (a,e) <> MultBy (b,c) & MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
thus SubFrom (a,e) <> MultBy (b,c) by A2, SCMFSA_2:20; :: thesis: ( MultBy (a,e) <> MultBy (b,c) & Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
thus MultBy (a,e) <> MultBy (b,c) by A1, SF_MASTR:4; :: thesis: ( Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) & a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
thus ( Divide (a,e) <> MultBy (b,c) & Divide (e,a) <> MultBy (b,c) ) by A2, SCMFSA_2:22; :: thesis: ( a := (f,e) <> MultBy (b,c) & a :=len f <> MultBy (b,c) )
thus a := (f,e) <> MultBy (b,c) by A2, SCMFSA_2:26; :: thesis: a :=len f <> MultBy (b,c)
thus a :=len f <> MultBy (b,c) by A2, SCMFSA_2:28; :: thesis: verum

end;

hence not MultBy (b,c) destroys a ; :: thesis: verum