reserve a,b,c,v,v1,x,y for object;
reserve V,A for set;
reserve d for TypeSCNominativeData of V,A;
reserve p,q,r for SCPartialNominativePredicate of V,A;
reserve n for Nat;
reserve X for Function;
reserve f,g,h for SCBinominativeFunction of V,A;

theorem Th36:
  for g being (V,A)-FPrg-yielding FinSequence st product g <> {}
  for x being Element of product g st d in dom(SC_Fsuperpos(f,x,X))
   holds d in_doms g &
   SC_Fsuperpos(f,x,X).d = f.global_overlapping(V,A,d,NDentry(g,X,d))
  proof
    let g be (V,A)-FPrg-yielding FinSequence such that
A1: product g <> {};
    let x be Element of product g such that
A2: d in dom(SC_Fsuperpos(f,x,X));
A3: dom(SCFsuperpos(g,X).(f,x)) = {d where d is TypeSCNominativeData of V,A:
    global_overlapping(V,A,d,NDentry(g,X,d)) in dom f & d in_doms g}
    by A1,Def13;
    SC_Fsuperpos(f,x,X) = SCFsuperpos(g,X).(f,x) by A1,Def14;
    then
A4: ex d1 being TypeSCNominativeData of V,A st d1 = d &
    (global_overlapping(V,A,d1,NDentry(g,X,d1)) in dom f & d1 in_doms g)
    by A2,A3;
    then SCFsuperpos(g,X).(f,x),d =~ f,global_overlapping(V,A,d,NDentry(g,X,d))
    by A1,Def13;
    hence thesis by A1,A4,Def14;
  end;
