reserve k,m,n for Nat,
  a, b, c for object,
  x, y, X, Y, Z for set,
  D for non empty set;
reserve p, q, r, s, t, u, v for FinSequence;
reserve P, Q, R, P1, P2, Q1, Q2, R1, R2 for FinSequence-membered set;
reserve S, T for non empty FinSequence-membered set;
reserve A for Function of P, NAT;
reserve U, V, W for Subset of P*;
reserve k,l,m,n,i,j for Nat,
  a, b, c for object,
  x, y, z, X, Y, Z for set,
  D, D1, D2 for non empty set;
reserve p, q, r, s, t, u, v for FinSequence;
reserve P, Q, R for FinSequence-membered set;
reserve B, C for antichain;
reserve S, T for Polish-language;
reserve A for Polish-arity-function of T;
reserve U, V, W for Polish-language of T;
reserve F, G for Polish-WFF of T, A;
reserve f for Polish-recursion-function of A, D;
reserve K, K1, K2 for Function of Polish-WFF-set(T, A), D;
reserve L for non trivial Polish-language;
reserve E for Polish-arity-function of L;
reserve g for Polish-recursion-function of E, D;
reserve J, J1, J2, J3 for Subset of Polish-WFF-set(L, E);
reserve H for Function of J, D;
reserve H1 for Function of J1, D;
reserve H2 for Function of J2, D;
reserve H3 for Function of J3, D;

theorem
  for L, E, D, g for K being Function of Polish-WFF-set(L, E), D
      for a st K is g-recursive & a in Polish-atoms(L, E) holds
    K.a = g.(a, {})
proof
  let L, E, D, g;
  set W = Polish-WFF-set(L, E);
  let K be Function of W, D;
  let a;
  assume that
    A1: K is g-recursive and
    A2: a in Polish-atoms(L, E);
  reconsider F = a as Polish-WFF of L, E by A2, Th34, TARSKI:def 3;
  A3: L-head F = F & Polish-WFF-args F = {} by A2, Th85;
  thus K.a = g.[L-head F, K * (Polish-WFF-args F)] by A1
      .= g.( F, K * {} ) by A3, BINOP_1:def 1
      .= g.( a, {} );
end;
