let M be non empty non void subset-closed finite-degree SubsetFamilyStr; ( M is Matroid iff for C being Subset of M
for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
card A = card B )
hereby ( ( for C being Subset of M
for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
card A = card B ) implies M is Matroid )
assume A1:
M is
Matroid
;
for C being Subset of M
for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
card A = card Blet C be
Subset of
M;
for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
card A = card BA2:
now for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
not card A < card Blet A,
B be
independent Subset of
M;
( A is_maximal_independent_in C & B is_maximal_independent_in C implies not card A < card B )assume that A3:
A is_maximal_independent_in C
and A4:
B is_maximal_independent_in C
and A5:
card A < card B
;
contradictionA6:
A c= C
by A3;
(card A) + 1
<= card B
by A5, NAT_1:13;
then
Segm ((card A) + 1) c= Segm (card B)
by NAT_1:39;
then consider D being
set such that A7:
D c= B
and A8:
card D = (card A) + 1
by CARD_FIL:36;
reconsider D =
D as
finite Subset of
M by A7, XBOOLE_1:1;
D is
independent
by A7, Th3;
then consider e being
Element of
M such that A9:
e in D \ A
and A10:
A \/ {e} is
independent
by A1, A8, Th4;
D \ A c= D
by XBOOLE_1:36;
then A11:
D \ A c= B
by A7;
B c= C
by A4;
then
D \ A c= C
by A11;
then
{e} c= C
by A9, ZFMISC_1:31;
then A12:
A \/ {e} c= C
by A6, XBOOLE_1:8;
A c= A \/ {e}
by XBOOLE_1:7;
then
A \/ {e} = A
by A3, A10, A12;
then
{e} c= A
by XBOOLE_1:7;
then
e in A
by ZFMISC_1:31;
hence
contradiction
by A9, XBOOLE_0:def 5;
verum end; let A,
B be
independent Subset of
M;
( A is_maximal_independent_in C & B is_maximal_independent_in C implies card A = card B )assume that A13:
A is_maximal_independent_in C
and A14:
B is_maximal_independent_in C
;
card A = card B
(
card A < card B or
card B < card A or
card A = card B )
by XXREAL_0:1;
hence
card A = card B
by A2, A13, A14;
verum
end;
assume A15:
for C being Subset of M
for A, B being independent Subset of M st A is_maximal_independent_in C & B is_maximal_independent_in C holds
card A = card B
; M is Matroid
M is with_exchange_property
hence
M is Matroid
; verum