deffunc H1( set ) -> set = $1;
defpred S1[ set ] means verum;
defpred S2[ Element of PFuncs (Involved A),C] means for h being Element of PFuncs V,C st h in A holds
not $1 tolerates h;
set M = { f where f is Element of PFuncs (Involved A),C : for g being Element of PFuncs V,C st g in A holds
not f tolerates g } ;
A1:
{ f where f is Element of PFuncs (Involved A),C : verum } c= PFuncs (Involved A),C
A2:
for v being Element of PFuncs (Involved A),C st S2[v] holds
S1[v]
;
A3:
{ H1(f) where f is Element of PFuncs (Involved A),C : S2[f] } c= { H1(f) where f is Element of PFuncs (Involved A),C : S1[f] }
from FRAENKEL:sch 1(A2);
A4:
{ f where f is Element of PFuncs (Involved A),C : for g being Element of PFuncs V,C st g in A holds
not f tolerates g } c= PFuncs V,C
proof
let a be
set ;
TARSKI:def 3 ( not a in { f where f is Element of PFuncs (Involved A),C : for g being Element of PFuncs V,C st g in A holds
not f tolerates g } or a in PFuncs V,C )
assume
a in { f where f is Element of PFuncs (Involved A),C : for g being Element of PFuncs V,C st g in A holds
not f tolerates g }
;
a in PFuncs V,C
then
ex
f1 being
Element of
PFuncs (Involved A),
C st
(
f1 = a & ( for
g being
Element of
PFuncs V,
C st
g in A holds
not
f1 tolerates g ) )
;
then A5:
a in PFuncs (Involved A),
C
;
Involved A c= V
by Th10;
then
PFuncs (Involved A),
C c= PFuncs V,
C
by PARTFUN1:128;
hence
a in PFuncs V,
C
by A5;
verum
end;
Involved A is finite
;
then
PFuncs (Involved A),C is finite
by PRE_POLY:17;
hence
{ f where f is Element of PFuncs (Involved A),C : for g being Element of PFuncs V,C st g in A holds
not f tolerates g } is Element of Fin (PFuncs V,C)
by A3, A1, A4, FINSUB_1:def 5; verum