consider p being FinSequence of bool X such that
len p = card Y and
rng p = Y and
A1: Components Y = { (Intersect (rng (MergeSequence (p,q)))) where q is FinSequence of BOOLEAN : len q = len p } by Def2;
deffunc H1( Element of BOOLEAN * ) -> Element of bool X = Intersect (rng (MergeSequence (p,X)));
A2: Components Y c= { (Intersect (rng (MergeSequence (p,q)))) where q is Element of BOOLEAN * : q in (len p) -tuples_on BOOLEAN }
proof
let z be object ; :: according to TARSKI:def 3 :: thesis: ( not z in Components Y or z in { (Intersect (rng (MergeSequence (p,q)))) where q is Element of BOOLEAN * : q in (len p) -tuples_on BOOLEAN } )
assume z in Components Y ; :: thesis: z in { (Intersect (rng (MergeSequence (p,q)))) where q is Element of BOOLEAN * : q in (len p) -tuples_on BOOLEAN }
then consider q being FinSequence of BOOLEAN such that
A3: ( z = Intersect (rng (MergeSequence (p,q))) & len q = len p ) by A1;
( q is Element of BOOLEAN * & q is Element of (len q) -tuples_on BOOLEAN ) by ;
hence z in { (Intersect (rng (MergeSequence (p,q)))) where q is Element of BOOLEAN * : q in (len p) -tuples_on BOOLEAN } by A3; :: thesis: verum
end;
A4: (len p) -tuples_on BOOLEAN is finite ;
{ H1(q) where q is Element of BOOLEAN * : q in (len p) -tuples_on BOOLEAN } is finite from hence Components Y is finite by A2; :: thesis: verum