A0: for p being FinSequence of NAT st p in SCI-binops holds
p . 1 > 20
proof
let p be FinSequence of NAT ; :: thesis: ( p in SCI-binops implies p . 1 > 20 )
assume p in SCI-binops ; :: thesis: p . 1 > 20
then ( p = '&&s' or p = '||s' or p = '->' or p = '<->' or p = '==' ) by ENUMSET1:def 3;
hence p . 1 > 20 ; :: thesis: verum
end;
given a being object such that A10: a in SCI-unops and
A11: a in SCI-binops ; :: thesis: contradiction
reconsider a = a as FinSequence of NAT by A10, TARSKI:def 1;
a = 'not' by A10, TARSKI:def 1;
then a . 1 = 11 ;
hence contradiction by A0, A11; :: thesis: verum