 reserve A,B,O for Ordinal,
      n,m for Nat,
      a,b,o for object,
      x,y,z for Surreal,
      X,Y,Z for set,
      Inv,I1,I2 for Function;

theorem Th12:
  Union divL(x,Inv)
    = {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)\/
      divset(Union divR(x,Inv),x,L_x,Inv)
proof
  defpred P[Nat] means
  divL(x,Inv).$1 c= {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)\/
  divset(Union divR(x,Inv),x,L_x,Inv);
  divL(x,Inv).0 = {0_No} by Th1;
  then
A1: P[0] by XBOOLE_1:7,10;
A2: P[n] implies P[n+1]
  proof
    assume
A3: P[n];
    let o;
    assume
A4: o in divL(x,Inv).(n+1);
    divL(x,Inv).(n+1) = divL(x,Inv).n \/
    divset(divL(x,Inv).n,x,R_x,Inv) \/ divset(divR(x,Inv).n,x,L_x,Inv)
    by Th6;
    then o in divL(x,Inv).n \/
    divset(divL(x,Inv).n,x,R_x,Inv) or o in divset(divR(x,Inv).n,x,L_x,Inv)
    by A4,XBOOLE_0:def 3;
    then per cases by XBOOLE_0:def 3;
    suppose o in divL(x,Inv).n;
      hence thesis by A3;
    end;
    suppose
A5:   o in divset(divL(x,Inv).n,x,R_x,Inv);
      divset(divL(x,Inv).n,x,R_x,Inv) c=
      divset(Union divL(x,Inv),x,R_x,Inv) by ABCMIZ_1:1,Th11;
      then o in {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)
      by A5,XBOOLE_0:def 3;
      hence o in {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)\/
      divset(Union divR(x,Inv),x,L_x,Inv)
      by XBOOLE_0:def 3;
    end;
    suppose
A6:   o in divset(divR(x,Inv).n,x,L_x,Inv);
      divset(divR(x,Inv).n,x,L_x,Inv) c=
      divset(Union divR(x,Inv),x,L_x,Inv) by Th11,ABCMIZ_1:1;
      hence thesis by A6,XBOOLE_0:def 3;
    end;
  end;
A7: P[n] from NAT_1:sch 2(A1,A2);
  thus Union divL(x,Inv)
  c= {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)\/
  divset(Union divR(x,Inv),x,L_x,Inv)
  proof
    let o;
    assume o in Union divL(x,Inv);
    then consider n be object such that
A8: n in dom divL(x,Inv) & o in divL(x,Inv).n by CARD_5:2;
    n in NAT by A8,Def5;
    then reconsider n as Nat;
    divL(x,Inv).n c= {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv)\/
    divset(Union divR(x,Inv),x,L_x,Inv) by A7;
    hence thesis by A8;
  end;
A9: divset(Union divL(x,Inv),x,R_x,Inv) c= Union divL(x,Inv)
  proof
    let o;
    assume o in divset(Union divL(x,Inv),x,R_x,Inv);
    then consider l be object such that
A10: l in Union divL(x,Inv) & o in divs(l,x,R_x,Inv) by Def3;
    consider n be object such that
A11: n in dom divL(x,Inv) & l in divL(x,Inv).n by A10,CARD_5:2;
    n in NAT by A11,Def5;
    then reconsider n as Nat;
    o in divset(divL(x,Inv).n,x,R_x,Inv) by A10,A11,Def3;
    then o in  divL(x,Inv).n \/ divset(divL(x,Inv).n,x,R_x,Inv)
    by XBOOLE_0:def 3;
    then o in divL(x,Inv).n \/
    divset(divL(x,Inv).n,x,R_x,Inv) \/
    divset(divR(x,Inv).n,x,L_x,Inv) by XBOOLE_0:def 3;
    then
A12: o in divL(x,Inv).(n+1) by Th6;
    n+1 in NAT;
    then n+1 in dom divL(x,Inv) by Def5;
    hence thesis by A12,CARD_5:2;
  end;
A13: divset(Union divR(x,Inv),x,L_x,Inv) c= Union divL(x,Inv)
  proof
    let o;
    assume o in divset(Union divR(x,Inv),x,L_x,Inv);
    then consider l be object such that
A14: l in Union divR(x,Inv) & o in divs(l,x,L_x,Inv) by Def3;
    consider n be object such that
A15: n in dom divR(x,Inv) & l in divR(x,Inv).n by A14,CARD_5:2;
    n in NAT by A15,Def6;
    then reconsider n as Nat;
    o in divset(divR(x,Inv).n,x,L_x,Inv) by A14,A15,Def3;
    then o in divL(x,Inv).n \/
    divset(divL(x,Inv).n,x,R_x,Inv) \/
    divset(divR(x,Inv).n,x,L_x,Inv) by XBOOLE_0:def 3;
    then
A16: o in divL(x,Inv).(n+1) by Th6;
    n+1 in NAT;
    then n+1 in dom divL(x,Inv) by Def5;
    hence thesis by A16,CARD_5:2;
  end;
  divL(x,Inv).0 = {0_No} by Th1;
  then {0_No} c= Union divL(x,Inv) by ABCMIZ_1:1;
  then {0_No}\/divset(Union divL(x,Inv),x,R_x,Inv) c= Union divL(x,Inv)
    by A9,XBOOLE_1:8;
  hence thesis by A13,XBOOLE_1:8;
end;
