consider V being ManySortedSet of such that
A1:
Vars = Union V
and
A2:
V . 0 = { [{} ,i] where i is Element of NAT : verum }
and
A3:
for n being Nat holds V . (n + 1) = { [(varcl A),j] where A is Subset of (V . n), j is Element of NAT : A is finite }
by VARSdef;
defpred S1[ Nat] means varcl (V . $1) = V . $1;
then
( varcl (V . 0 ) c= V . 0 & V . 0 c= varcl (V . 0 ) )
by VARCL;
then B1:
S1[ 0 ]
by XBOOLE_0:def 10;
B2:
now let i be
Nat;
:: thesis: ( S1[i] implies S1[i + 1] )assume B3:
S1[
i]
;
:: thesis: S1[i + 1]reconsider i' =
i as
Element of
NAT by ORDINAL1:def 13;
B4:
V . (i + 1) = { [(varcl A),j] where A is Subset of (V . i), j is Element of NAT : A is finite }
by A3;
now let x,
y be
set ;
:: thesis: ( [x,y] in V . (i + 1) implies x c= V . (i + 1) )assume
[x,y] in V . (i + 1)
;
:: thesis: x c= V . (i + 1)then consider A being
Subset of
(V . i),
j being
Element of
NAT such that B5:
(
[x,y] = [(varcl A),j] &
A is
finite )
by B4;
(
x = varcl A &
i <= i + 1 )
by B5, NAT_1:11, ZFMISC_1:33;
then
(
x c= V . i &
V . i' c= V . (i' + 1) )
by A2, A3, B3, Th13, Lem1;
hence
x c= V . (i + 1)
by XBOOLE_1:1;
:: thesis: verum end; then
(
varcl (V . (i + 1)) c= V . (i + 1) &
V . (i + 1) c= varcl (V . (i + 1)) )
by VARCL;
hence
S1[
i + 1]
by XBOOLE_0:def 10;
:: thesis: verum end;
B3:
for i being Nat holds S1[i]
from NAT_1:sch 2(B1, B2);
A4:
varcl Vars = union { (varcl a) where a is Element of rng V : verum }
by A1, Th14;
thus
Vars c= varcl Vars
by VARCL; :: thesis: verum