reserve i,j,n,k,m for Nat,
     a,b,x,y,z for object,
     F,G for FinSequence-yielding FinSequence,
     f,g,p,q for FinSequence,
     X,Y for set,
     D for non empty set;
reserve
  B,A,M for BinOp of D,
  F,G for D* -valued FinSequence,
  f for FinSequence of D,
  d,d1,d2 for Element of D;
reserve
  F,G for non-empty non empty FinSequence of D*,
  f for non empty FinSequence of D;
reserve f,g for FinSequence of D,
        a,b,c for set,
        F,F1,F2 for finite set;

theorem Th79:
  for E1 be Enumeration of F1,E2 be Enumeration of F2 st F1 misses F2
    holds E1^E2 is Enumeration of F1\/F2
proof
  let E1 be Enumeration of F1,E2 be Enumeration of F2
    such that
A1: F1 misses F2;
  rng E1=F1 & rng E2=F2 by RLAFFIN3:def 1;
  then E1^E2 is one-to-one&rng (E1^E2) = F1\/F2 by A1,FINSEQ_3:91,FINSEQ_1:31;
  hence thesis by RLAFFIN3:def 1;
end;
