:: TAXONOM2 semantic presentation

K32() is Element of bool K28()

K28() is set

bool K28() is non empty set

omega is set

bool omega is non empty set

bool K32() is non empty set

1 is non empty set

[:1,1:] is non empty set

bool [:1,1:] is non empty set

[:[:1,1:],1:] is non empty set

bool [:[:1,1:],1:] is non empty set

[:[:1,1:],K28():] is set

bool [:[:1,1:],K28():] is non empty set

[:K28(),K28():] is set

[:[:K28(),K28():],K28():] is set

bool [:[:K28(),K28():],K28():] is non empty set

2 is non empty set

[:2,2:] is non empty set

[:[:2,2:],K28():] is set

bool [:[:2,2:],K28():] is non empty set

{} is empty set

bool {} is non empty set

{{}} is non empty set

union {} is set

X is set

{X} is non empty set

{{X}} is non empty set

InclPoset {{X}} is non empty strict reflexive transitive antisymmetric RelStr

RelIncl {{X}} is Relation-like {{X}} -defined {{X}} -valued V22({{X}}) V30() V33() V37() Element of bool [:{{X}},{{X}}:]

[:{{X}},{{X}}:] is non empty set

bool [:{{X}},{{X}}:] is non empty set

h is Relation-like {{X}} -defined {{X}} -valued Element of bool [:{{X}},{{X}}:]

RelStr(# {{X}},h #) is strict RelStr

the U1 of RelStr(# {{X}},h #) is set

RL is Element of the U1 of RelStr(# {{X}},h #)

the InternalRel of RelStr(# {{X}},h #) is Relation-like the U1 of RelStr(# {{X}},h #) -defined the U1 of RelStr(# {{X}},h #) -valued Element of bool [: the U1 of RelStr(# {{X}},h #), the U1 of RelStr(# {{X}},h #):]

[: the U1 of RelStr(# {{X}},h #), the U1 of RelStr(# {{X}},h #):] is set

bool [: the U1 of RelStr(# {{X}},h #), the U1 of RelStr(# {{X}},h #):] is non empty set

field h is set

C is set

[C,RL] is set

{C,RL} is non empty set

{C} is non empty set

{{C,RL},{C}} is non empty set

{{X}} \/ {{X}} is non empty set

[RL,RL] is set

{RL,RL} is non empty set

{RL} is non empty set

{{RL,RL},{RL}} is non empty set

the U1 of RelStr(# {{X}},h #) is set

L is Element of the U1 of RelStr(# {{X}},h #)

RL is Element of the U1 of RelStr(# {{X}},h #)

[L,RL] is set

{L,RL} is non empty set

{L} is non empty set

{{L,RL},{L}} is non empty set

{{{}}} is non empty set

InclPoset {{{}}} is non empty strict reflexive transitive antisymmetric RelStr

X is non empty set

[:X,X:] is non empty set

bool [:X,X:] is non empty set

H is Relation-like X -defined X -valued V22(X) V32() V37() Element of bool [:X,X:]

PX is set

h is set

Class (H,h) is Element of bool X

bool X is non empty set

h is set

Class (H,h) is Element of bool X

[PX,h] is set

{PX,h} is non empty set

{PX} is non empty set

{{PX,h},{PX}} is non empty set

[PX,h] is set

{PX,h} is non empty set

{{PX,h},{PX}} is non empty set

Class (H,PX) is Element of bool X

X is non empty set

h is set

H is non empty with_non-empty_elements a_partition of X

h is set

PX is set

X is non empty set

H is set

h is set

union H is set

h is set

L is set

PX is non empty with_non-empty_elements a_partition of X

union PX is Element of bool X

bool X is non empty set

X is non empty set

{X} is non empty set

H is set

union H is set

InclPoset (union H) is strict reflexive transitive antisymmetric RelStr

RelIncl (union H) is Relation-like union H -defined union H -valued V22( union H) V30() V33() V37() Element of bool [:(union H),(union H):]

[:(union H),(union H):] is set

bool [:(union H),(union H):] is non empty set

L is Relation-like union H -defined union H -valued Element of bool [:(union H),(union H):]

RelStr(# (union H),L #) is strict RelStr

the U1 of RelStr(# (union H),L #) is set

C is Element of the U1 of RelStr(# (union H),L #)

C is Element of the U1 of RelStr(# (union H),L #)

h is Element of the U1 of RelStr(# (union H),L #)

h is non empty set

bool X is non empty set

P is Element of h

PS is set

Cb is Element of bool X

Pmin is non empty with_non-empty_elements a_partition of X

PY is set

[h,C] is set

{h,C} is non empty set

{h} is non empty set

{{h,C},{h}} is non empty set

hw is Element of h

PS1 is set

PT is Element of h

s is set

[h,C] is set

{h,C} is non empty set

{{h,C},{h}} is non empty set

C1 is non empty with_non-empty_elements a_partition of X

P2 is non empty with_non-empty_elements a_partition of X

hx is set

P2 is non empty with_non-empty_elements a_partition of X

C1 is non empty with_non-empty_elements a_partition of X

hx is set

C1 is non empty with_non-empty_elements a_partition of X

P2 is non empty with_non-empty_elements a_partition of X

[hw,PT] is set

{hw,PT} is non empty set

{hw} is non empty set

{{hw,PT},{hw}} is non empty set

[PT,hw] is set

{PT,hw} is non empty set

{PT} is non empty set

{{PT,hw},{PT}} is non empty set

SmallestPartition X is non empty with_non-empty_elements a_partition of X

K54(X) is non empty Relation-like X -defined X -valued V22(X) Element of bool [:X,X:]

[:X,X:] is non empty set

bool [:X,X:] is non empty set

Class K54(X) is non empty with_non-empty_elements a_partition of X

h is set

C is Strong_Classification of X

C is Element of the U1 of RelStr(# (union H),L #)

the InternalRel of RelStr(# (union H),L #) is Relation-like the U1 of RelStr(# (union H),L #) -defined the U1 of RelStr(# (union H),L #) -valued Element of bool [: the U1 of RelStr(# (union H),L #), the U1 of RelStr(# (union H),L #):]

[: the U1 of RelStr(# (union H),L #), the U1 of RelStr(# (union H),L #):] is set

bool [: the U1 of RelStr(# (union H),L #), the U1 of RelStr(# (union H),L #):] is non empty set

Cb is set

field L is set

dom L is Element of bool (union H)

bool (union H) is non empty set

rng L is Element of bool (union H)

(dom L) \/ (rng L) is Element of bool (union H)

PS is Element of h

[Cb,C] is set

{Cb,C} is non empty set

{Cb} is non empty set

{{Cb,C},{Cb}} is non empty set

PS is Element of h

[Cb,C] is set

{Cb,C} is non empty set

{Cb} is non empty set

{{Cb,C},{Cb}} is non empty set

P is Element of the U1 of RelStr(# (union H),L #)

[P,C] is set

{P,C} is non empty set

{P} is non empty set

{{P,C},{P}} is non empty set

X is set

H is set

h is set

H is set

{H} is non empty set

H is set

{H} is non empty set

h is set

h is set

the empty set is empty set

the non empty set is non empty set

{ the non empty set , the empty set } is non empty set

h is set

h is set

PX is set

h is set

{h} is non empty set

X is set

H is set

X is set

H is set

X is set

bool X is non empty set

bool (bool X) is non empty set

h is Element of bool (bool X)

X is set

H is set

X is set

bool X is non empty set

bool (bool X) is non empty set

h is set

bool X is non empty Element of bool (bool X)

h is Element of bool (bool X)

X is set

H is set

X is set

{X} is non empty set

H is set

h is set

X is set

bool X is non empty set

bool (bool X) is non empty set

H is (X)

h is () Element of bool (bool X)

union h is Element of bool X

h is set

union H is Element of bool X

PX is set

L is set

h \ L is Element of bool (bool X)

{PX} is non empty set

(h \ L) \/ {PX} is non empty set

C is set

C is set

C is set

C is set

union ((h \ L) \/ {PX}) is set

C is set

C is set

X is set

bool X is non empty set

bool (bool X) is non empty set

h is () Element of bool (bool X)

H is (X)

union h is Element of bool X

h is Element of bool X

h \ {{}} is Element of bool (bool X)

union (h \ {{}}) is Element of bool X

L is set

RL is set

L is set

RL is set

X is set

bool X is non empty set

bool (bool X) is non empty set

X is set

bool X is non empty set

bool (bool X) is non empty set

H is Element of bool (bool X)

h is Element of bool X

h is Element of X

X is set

bool X is non empty set

bool (bool X) is non empty set

{X} is non empty set

h is Element of bool (bool X)

h is set

PX is set

h is (X)

union h is Element of bool X

PX is Element of bool X

L is Element of X

h is Element of bool (bool X)

h is (X)

X is set

bool X is non empty set

bool (bool X) is non empty set

X is set

bool X is non empty set

bool (bool X) is non empty set

H is Element of bool X

{H} is non empty set

h is () Element of bool (bool X)

h \/ {H} is non empty set

union (h \/ {H}) is set

union h is Element of bool X

PX is set

L is set

bool X is non empty Element of bool (bool X)

PX is set

PX is set

L is set

X is set

bool X is non empty set

bool (bool X) is non empty set

X is set

bool X is non empty set

bool (bool X) is non empty set

H is covering (X)

h is Element of bool (bool X)

{X} is non empty set

h is set

h is set

h is set

PX is Element of bool X

h is Element of bool (bool X)

L is Element of bool X

L is Element of bool X

RL is Element of bool X

union H is Element of bool X

union h is Element of bool X

PX is set

L is set

RL is Element of bool X

C is Element of bool X

h is with_non-empty_elements a_partition of X

X is set

bool X is non empty set

bool (bool X) is non empty set

H is covering (X)

h is () Element of bool (bool X)

union h is Element of bool X

h is Element of bool X

PX is Element of bool X

X is set

bool X is non empty set

bool (bool X) is non empty set

H is covering (X) (X)

h is Element of bool X

h is () Element of bool (bool X)

union h is Element of bool X

union H is Element of bool X

PX is set

L is set

RL is set

C is set

C is set

C is set

meet RL is set

C is set

C is Element of bool X

{C} is non empty set

h \/ {C} is non empty set

Cb is set

P is Element of X

PS is Element of bool X

Pmin is Element of bool X

PY is Element of bool X

hw is set

Pmin is Element of bool X

PY is set

P is set

P is set

union (h \/ {C}) is set

PX is Element of bool X

L is Element of bool X

X is set

bool X is non empty set

bool (bool X) is non empty set

H is covering (X) (X)

h is Element of bool X

h is () Element of bool (bool X)

union H is Element of bool X

union h is Element of bool X

PX is set

L is set

RL is set

C is set

C is set

C is set

meet RL is set

C is set

C is Element of bool X

{C} is non empty set

h is set

h \/ {C} is non empty set

Cb is set

P is Element of X

PS is Element of bool X

Pmin is Element of bool X

PY is Element of bool X

hw is set

Pmin is Element of bool X

PY is set

P is set

union (h \/ {C}) is set

PX is Element of bool X

L is Element of bool X

X is set

bool X is non empty set

bool (bool X) is non empty set

H is covering (X) (X)

h is Element of bool X

{h} is non empty set

bool X is non empty Element of bool (bool X)

bool (bool X) is non empty Element of bool (bool (bool X))

bool (bool X) is non empty set

bool (bool (bool X)) is non empty set

PX is set

L is set

RL is set

C is set

union L is set

C is set

C is set

C is set

h is set

P is set

Cb is set

C is set

RL is set

C is set

L is set

RL is () Element of bool (bool X)

X is non empty set

H is set

h is set

X is non empty set

bool X is non empty set

H is non empty set

h is non empty with_non-empty_elements a_partition of X

h is set

{h} is non empty set

h \ {h} is Element of bool (bool X)

bool (bool X) is non empty set

PX is non empty with_non-empty_elements a_partition of X

L is set

L \/ (h \ {h}) is set

RL is set

union PX is Element of bool X

union h is Element of bool X

union (L \/ (h \ {h})) is set

C is set

C is set

h is set

P is set

C is set

C is set

h is set

C is Element of bool X

C is Element of bool X

bool X is non empty Element of bool (bool X)

C is set

C is set

C is set

X is non empty set

H is non empty set

{H} is non empty set

bool X is non empty Element of bool (bool X)

bool X is non empty set

bool (bool X) is non empty set

h is set

h is non empty with_non-empty_elements a_partition of X

h is set

PX is set

PX is set

h is set

h \/ {H} is non empty set

L is set

L is Element of bool X

RL is Element of bool X

union h is Element of bool X

union (h \/ {H}) is set

L is set

RL is set

L is set

RL is set

L is set

L is non empty with_non-empty_elements a_partition of X

RL is set

C is set

X is non empty set

bool X is non empty set

bool (bool X) is non empty set

PARTITIONS X is set

H is covering (X) (X)

union H is Element of bool X

h is set

h is Element of bool X

PX is non empty with_non-empty_elements a_partition of X

{PX} is non empty set

RL is set

RL is set

C is set

bool (PARTITIONS X) is non empty Element of bool (bool (PARTITIONS X))

bool (PARTITIONS X) is non empty set

bool (bool (PARTITIONS X)) is non empty set

RL is set

C is set

C is set

union C is set

h is set

P is set

h is set

P is set

Cb is set

PS is set

P is set

h is set

Cb is set

P is set

Cb is set

P is set

C is set

C is Element of bool (PARTITIONS X)

h is non empty with_non-empty_elements a_partition of X

P is non empty with_non-empty_elements a_partition of X

union C is set

h is set

P is set

Cb is set

Cb is set

PS is non empty with_non-empty_elements a_partition of X

Pmin is set

PY is set

union PY is set

hw is set

P \/ Cb is set

Pmin is set

PY is set

Pmin is set

Pmin is set

PY is set

Pmin is set

PY is set

{h} is non empty set

Pmin is set

Pmin is set

PY is set

hw is set

hw \/ {h} is non empty set

{(hw \/ {h})} is non empty set

C \/ {(hw \/ {h})} is non empty set

C1 is set

C1 is set

C1 is set

C1 is set

C1 is set

s is set

P2 is set

hx is set

hz is set

hy is set

hx is set

hz is set

C1 is set

s is set

C1 is set

C1 is set

Pmin is set

PY is set

hw is set

PT is set

{hw} is non empty set

Pmin \ {hw} is Element of bool Pmin

bool Pmin is non empty set

PT \/ (Pmin \ {hw}) is set

{(PT \/ (Pmin \ {hw}))} is non empty set

C \/ {(PT \/ (Pmin \ {hw}))} is non empty set

s is set

s is set

s is set

s is set

s is set

P2 is set

s is set

h is set

P is set