:: BVFUNC11 semantic presentation :: Showing IDV graph ... (Click the Palm Trees again to close it)
theorem Th1: :: BVFUNC11:1 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:2 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:3 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:4 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:5 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:6 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:7 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem Th8: :: BVFUNC11:8 :: Showing IDV graph ... (Click the Palm Tree again to close it)
theorem :: BVFUNC11:9 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: BVFUNC11:10 :: Showing IDV graph ... (Click the Palm Tree again to close it)
canceled;
theorem :: BVFUNC11:11 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
All (All a,A,G),
B,
G '<' Ex (All a,B,G),
A,
G
theorem :: BVFUNC11:12 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
All (All a,A,G),
B,
G '<' Ex (Ex a,B,G),
A,
G
theorem :: BVFUNC11:13 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
All (All a,A,G),
B,
G '<' All (Ex a,B,G),
A,
G
theorem :: BVFUNC11:14 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
All (Ex a,A,G),
B,
G '<' Ex (Ex a,B,G),
A,
G
theorem :: BVFUNC11:15 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
'not' (Ex (All a,A,G),B,G) '<' Ex (Ex ('not' a),B,G),
A,
G
theorem Th16: :: BVFUNC11:16 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
Ex ('not' (All a,A,G)),
B,
G '<' Ex (Ex ('not' a),B,G),
A,
G
theorem Th17: :: BVFUNC11:17 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
'not' (All (All a,A,G),B,G) = Ex ('not' (All a,B,G)),
A,
G
theorem :: BVFUNC11:18 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
All ('not' (All a,A,G)),
B,
G '<' Ex (Ex ('not' a),B,G),
A,
G
theorem :: BVFUNC11:19 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
'not' (All (All a,A,G),B,G) = Ex (Ex ('not' a),B,G),
A,
G
theorem :: BVFUNC11:20 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
'not' (All (All a,A,G),B,G) '<' Ex (Ex ('not' a),A,G),
B,
G
theorem :: BVFUNC11:21 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
'not' (All (Ex a,A,G),B,G) = Ex (All ('not' a),A,G),
B,
G
theorem :: BVFUNC11:22 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
'not' (Ex (All a,A,G),B,G) = All (Ex ('not' a),A,G),
B,
G
theorem :: BVFUNC11:23 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
'not' (All (All a,A,G),B,G) = Ex (Ex ('not' a),A,G),
B,
G
theorem :: BVFUNC11:24 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y st
G is
independent holds
Ex (All a,A,G),
B,
G '<' Ex (Ex a,B,G),
A,
G
theorem :: BVFUNC11:25 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
All (All a,A,G),
B,
G '<' All (Ex a,A,G),
B,
G
theorem :: BVFUNC11:26 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
All (All a,A,G),
B,
G '<' Ex (Ex a,A,G),
B,
G
theorem :: BVFUNC11:27 :: Showing IDV graph ... (Click the Palm Tree again to close it)
for
Y being non
empty set for
a being
Element of
Funcs Y,
BOOLEAN for
G being
Subset of
(PARTITIONS Y) for
A,
B being
a_partition of
Y holds
Ex (All a,A,G),
B,
G '<' Ex (Ex a,A,G),
B,
G