set Y = [:(Fin L),L:];
set Z = { [{t,(t '->' u)},u] where t, u is Formula of L : verum } ;
for a being object st a in { [{t,(t '->' u)},u] where t, u is Formula of L : verum } holds
a in [:(Fin L),L:]
proof
let a be
object ;
( a in { [{t,(t '->' u)},u] where t, u is Formula of L : verum } implies a in [:(Fin L),L:] )
assume
a in { [{t,(t '->' u)},u] where t, u is Formula of L : verum }
;
a in [:(Fin L),L:]
then consider t,
u being
Formula of
L such that A2:
a = [{t,(t '->' u)},u]
;
set w =
{t,(t '->' u)};
(
t in L &
t '->' u in L )
;
then
(
{t,(t '->' u)} c= L &
{t,(t '->' u)} is
finite )
by TARSKI:def 2;
then
{t,(t '->' u)} in Fin L
by FINSUB_1:def 5;
hence
a in [:(Fin L),L:]
by A2, ZFMISC_1:def 2;
verum
end;
then
{ [{t,(t '->' u)},u] where t, u is Formula of L : verum } c= [:(Fin L),L:]
;
then reconsider Z = { [{t,(t '->' u)},u] where t, u is Formula of L : verum } as Relation of (Fin L),L ;
A10:
( dom Z c= Fin L & rng Z c= L )
by RELAT_1:def 18, RELAT_1:def 19;
then
Z is finitary
by FINSUB_1:def 5;
hence
{ [{t,(t '->' u)},u] where t, u is Formula of L : verum } is Rule of L
by A10, PROOFS_1:def 2; verum