reserve
  x for object, X for set,
  i, n, m for Nat,
  r, s for Real,
  c, c1, c2, d for Complex,
  f, g for complex-valued Function,
  g1 for n-element complex-valued FinSequence,
  f1 for n-element real-valued FinSequence,
  T for non empty TopSpace,
  p for Element of TOP-REAL n;

theorem
  for A being non empty 1-sorted, B being 1-element 1-sorted
  for t being Point of B
  for f being Function of A,B holds f = A --> t
  proof
    let A be non empty 1-sorted;
    let B be 1-element 1-sorted;
    let t be Point of B;
    let f be Function of A,B;
    let a be Element of A;
    thus f.a = (A --> t).a by STRUCT_0:def 10;
  end;
