reserve k,n,n1,m,m1,m0,h,i,j for Nat,
  a,x,y,X,X1,X2,X3,X4,Y for set;
reserve L,L1,L2 for FinSequence;
reserve F,F1,G,G1,H for LTL-formula;
reserve W,W1,W2 for Subset of Subformulae H;
reserve v for LTL-formula;
reserve N,N1,N2,N10,N20,M for strict LTLnode over v;
reserve w for Element of Inf_seq(AtomicFamily);
reserve R1,R2 for Real_Sequence;
reserve s,s0,s1,s2 for elementary strict LTLnode over v;
reserve q for sequence of LTLStates(v);
reserve U for Choice_Function of BOOL Subformulae v;

theorem Th65:
  H is neg-inner-most implies (H is Sub_atomic or H is conjunctive
  or H is disjunctive or H is next or H is Until or H is Release)
proof
  assume
A1: H is neg-inner-most;
  per cases by MODELC_2:2;
  suppose
    H is atomic;
    hence thesis;
  end;
  suppose
A2: H is negative;
    set G = the_argument_of H;
A3: G is atomic by A1,A2;
    H = 'not' G by A2,MODELC_2:def 18;
    hence thesis by A3;
  end;
  suppose
    H is conjunctive or H is disjunctive or H is next or H is Until or
    H is Release;
    hence thesis;
  end;
end;
