let B, A be Ordinal; :: thesis: ( B <> {} & B is limit_ordinal implies for fi being Ordinal-Sequence st dom fi = B & ( for C being Ordinal st C in B holds
fi . C = C *^ A ) holds
B *^ A = union (sup fi) )
assume A1: ( B <> {} & B is limit_ordinal ) ; :: thesis: for fi being Ordinal-Sequence st dom fi = B & ( for C being Ordinal st C in B holds
fi . C = C *^ A ) holds
B *^ A = union (sup fi)
deffunc H₁( Ordinal) -> Ordinal = $1 *^ A;
deffunc H₂( Ordinal, Ordinal-Sequence) -> set = union (sup $2);
deffunc H₃( Ordinal, Ordinal) -> Ordinal = $2 +^ A;
let fi be Ordinal-Sequence; :: thesis: ( dom fi = B & ( for C being Ordinal st C in B holds
fi . C = C *^ A ) implies B *^ A = union (sup fi) )
assume that
A2: dom fi = B and
A3: for C being Ordinal st C in B holds
fi . C = H₁(C) ; :: thesis: B *^ A = union (sup fi)
A4: for B, C being Ordinal holds
( C = H₁(B) iff ex fi being Ordinal-Sequence st
( C = last fi & dom fi = succ B & fi . {} = {} & ( for C being Ordinal st succ C in succ B holds
fi . (succ C) = H₃(C,fi . C) ) & ( for C being Ordinal st C in succ B & C <> {} & C is limit_ordinal holds
fi . C = H₂(C,fi | C) ) ) ) by Def19;
thus H₁(B) = H₂(B,fi) from ORDINAL2:sch 16(A4, A1, A2, A3); :: thesis: verum