reserve n,i,j,k,l for Nat;
reserve D for non empty set;
reserve c,d for Element of D;
reserve p,q,q9,r for FinSequence of D;
reserve RAS for MidSp-like non empty ReperAlgebraStr over n+2;
reserve a,b,d,pii,p9i for Point of RAS;
reserve p,q for Tuple of (n+1),RAS;
reserve m for Nat of n;
reserve W for ATLAS of RAS;
reserve v for Vector of W;
reserve x,y for Tuple of (n+1),W;

theorem Th15:
  W.(a,p) = x iff (a,x).W = p
proof
  thus W.(a,p) = x implies (a,x).W = p
  proof
    assume
A1: W.(a,p) = x;
    now
      let m;
      W.(a,p.m) = x.m by A1,Def9;
      hence (a,x.m).W = p.m by MIDSP_2:33;
    end;
    hence thesis by Def8;
  end;
  thus (a,x).W = p implies W.(a,p) = x
  proof
    assume
A2: (a,x).W = p;
    now
      let m;
      (a,x.m).W = p.m by A2,Def8;
      hence W.(a,p.m) = x.m by MIDSP_2:33;
    end;
    hence thesis by Def9;
  end;
end;
