let A be non empty set ; :: thesis: for T being Sequence
for O being Ordinal st O <> 0 & O is limit_ordinal & dom T = O & ( for O1 being Ordinal st O1 in O holds
T . O1 = ConsecutiveSet (A,O1) ) holds
ConsecutiveSet (A,O) = union (rng T)
let T be Sequence; :: thesis: for O being Ordinal st O <> 0 & O is limit_ordinal & dom T = O & ( for O1 being Ordinal st O1 in O holds
T . O1 = ConsecutiveSet (A,O1) ) holds
ConsecutiveSet (A,O) = union (rng T)
let O be Ordinal; :: thesis: ( O <> 0 & O is limit_ordinal & dom T = O & ( for O1 being Ordinal st O1 in O holds
T . O1 = ConsecutiveSet (A,O1) ) implies ConsecutiveSet (A,O) = union (rng T) )
deffunc H₁( Ordinal, Sequence) -> set = union (rng $2);
deffunc H₂( Ordinal, set ) -> set = new_set $2;
deffunc H₃( Ordinal) -> set = ConsecutiveSet (A,$1);
assume that
A1: ( O <> 0 & O is limit_ordinal ) and
A2: dom T = O and
A3: for O1 being Ordinal st O1 in O holds
T . O1 = H₃(O1) ; :: thesis: ConsecutiveSet (A,O) = union (rng T)
A4: for O being Ordinal
for x being object holds
( x = H₃(O) iff ex L0 being Sequence st
( x = last L0 & dom L0 = succ O & L0 . 0 = A & ( for C being Ordinal st succ C in succ O holds
L0 . (succ C) = H₂(C,L0 . C) ) & ( for C being Ordinal st C in succ O & C <> 0 & C is limit_ordinal holds
L0 . C = H₁(C,L0 | C) ) ) ) by Def12;
thus H₃(O) = H₁(O,T) from ORDINAL2:sch 10(A4, A1, A2, A3); :: thesis: verum