:: MCART_3 semantic presentation
theorem Th1: :: MCART_3:1
for b
1 being
set holds
not ( b
1 <> {} & ( for b
2 being
set holds
not ( b
2 in b
1 & ( for b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10 being
set holds
( b
3 in b
4 & b
4 in b
5 & b
5 in b
6 & b
6 in b
7 & b
7 in b
8 & b
8 in b
9 & b
9 in b
10 & b
10 in b
2 implies b
3 misses b
1 ) ) ) ) )
theorem Th2: :: MCART_3:2
for b
1 being
set holds
not ( b
1 <> {} & ( for b
2 being
set holds
not ( b
2 in b
1 & ( for b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11 being
set holds
( b
3 in b
4 & b
4 in b
5 & b
5 in b
6 & b
6 in b
7 & b
7 in b
8 & b
8 in b
9 & b
9 in b
10 & b
10 in b
11 & b
11 in b
2 implies b
3 misses b
1 ) ) ) ) )
definition
let c
1, c
2, c
3, c
4, c
5, c
6 be
set ;
func [c1,c2,c3,c4,c5,c6] -> set equals :: MCART_3:def 1
[[a1,a2,a3,a4,a5],a6];
correctness
coherence
[[c1,c2,c3,c4,c5],c6] is set ;
;
end;
:: deftheorem Def1 defines [ MCART_3:def 1 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[b1,b2,b3,b4,b5,b6] = [[b1,b2,b3,b4,b5],b6];
theorem Th3: :: MCART_3:3
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[b1,b2,b3,b4,b5,b6] = [[[[[b1,b2],b3],b4],b5],b6]
theorem Th4: :: MCART_3:4
canceled;
theorem Th5: :: MCART_3:5
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[b1,b2,b3,b4,b5,b6] = [[b1,b2,b3,b4],b5,b6]
theorem Th6: :: MCART_3:6
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[b1,b2,b3,b4,b5,b6] = [[b1,b2,b3],b4,b5,b6]
theorem Th7: :: MCART_3:7
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[b1,b2,b3,b4,b5,b6] = [[b1,b2],b3,b4,b5,b6]
theorem Th8: :: MCART_3:8
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
(
[b1,b2,b3,b4,b5,b6] = [b7,b8,b9,b10,b11,b12] implies ( b
1 = b
7 & b
2 = b
8 & b
3 = b
9 & b
4 = b
10 & b
5 = b
11 & b
6 = b
12 ) )
theorem Th9: :: MCART_3:9
for b
1 being
set holds
not ( b
1 <> {} & ( for b
2 being
set holds
not ( b
2 in b
1 & ( for b
3, b
4, b
5, b
6, b
7, b
8 being
set holds
not ( ( b
3 in b
1 or b
4 in b
1 ) & b
2 = [b3,b4,b5,b6,b7,b8] ) ) ) ) )
definition
let c
1, c
2, c
3, c
4, c
5, c
6 be
set ;
func [:c1,c2,c3,c4,c5,c6:] -> set equals :: MCART_3:def 2
[:[:a1,a2,a3,a4,a5:],a6:];
coherence
[:[:c1,c2,c3,c4,c5:],c6:] is set
;
end;
:: deftheorem Def2 defines [: MCART_3:def 2 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:b1,b2,b3,b4,b5,b6:] = [:[:b1,b2,b3,b4,b5:],b6:];
theorem Th10: :: MCART_3:10
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:b1,b2,b3,b4,b5,b6:] = [:[:[:[:[:b1,b2:],b3:],b4:],b5:],b6:]
theorem Th11: :: MCART_3:11
canceled;
theorem Th12: :: MCART_3:12
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:b1,b2,b3,b4,b5,b6:] = [:[:b1,b2,b3,b4:],b5,b6:]
theorem Th13: :: MCART_3:13
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:b1,b2,b3,b4,b5,b6:] = [:[:b1,b2,b3:],b4,b5,b6:]
theorem Th14: :: MCART_3:14
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:b1,b2,b3,b4,b5,b6:] = [:[:b1,b2:],b3,b4,b5,b6:]
theorem Th15: :: MCART_3:15
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( ( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} ) iff
[:b1,b2,b3,b4,b5,b6:] <> {} )
theorem Th16: :: MCART_3:16
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} &
[:b1,b2,b3,b4,b5,b6:] = [:b7,b8,b9,b10,b11,b12:] implies ( b
1 = b
7 & b
2 = b
8 & b
3 = b
9 & b
4 = b
10 & b
5 = b
11 & b
6 = b
12 ) )
theorem Th17: :: MCART_3:17
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
(
[:b1,b2,b3,b4,b5,b6:] <> {} &
[:b1,b2,b3,b4,b5,b6:] = [:b7,b8,b9,b10,b11,b12:] implies ( b
1 = b
7 & b
2 = b
8 & b
3 = b
9 & b
4 = b
10 & b
5 = b
11 & b
6 = b
12 ) )
theorem Th18: :: MCART_3:18
for b
1, b
2 being
set holds
(
[:b1,b1,b1,b1,b1,b1:] = [:b2,b2,b2,b2,b2,b2:] implies b
1 = b
2 )
theorem Th19: :: MCART_3:19
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
ex b
8 being
Element of b
1ex b
9 being
Element of b
2ex b
10 being
Element of b
3ex b
11 being
Element of b
4ex b
12 being
Element of b
5ex b
13 being
Element of b
6 st b
7 = [b8,b9,b10,b11,b12,b13] )
definition
let c
1, c
2, c
3, c
4, c
5, c
6 be
set ;
assume E11:
( c
1 <> {} & c
2 <> {} & c
3 <> {} & c
4 <> {} & c
5 <> {} & c
6 <> {} )
;
let c
7 be
Element of
[:c1,c2,c3,c4,c5,c6:];
func c
7 `1 -> Element of a
1 means :
Def3:
:: MCART_3:def 3
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
1 );
existence
ex b1 being Element of c1 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b2 )
uniqueness
for b1, b2 being Element of c1 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b3 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b3 ) ) implies b1 = b2 )
func c
7 `2 -> Element of a
2 means :
Def4:
:: MCART_3:def 4
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
2 );
existence
ex b1 being Element of c2 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b3 )
uniqueness
for b1, b2 being Element of c2 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b4 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b4 ) ) implies b1 = b2 )
func c
7 `3 -> Element of a
3 means :
Def5:
:: MCART_3:def 5
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
3 );
existence
ex b1 being Element of c3 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b4 )
uniqueness
for b1, b2 being Element of c3 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b5 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b5 ) ) implies b1 = b2 )
func c
7 `4 -> Element of a
4 means :
Def6:
:: MCART_3:def 6
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
4 );
existence
ex b1 being Element of c4 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b5 )
uniqueness
for b1, b2 being Element of c4 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b6 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b6 ) ) implies b1 = b2 )
func c
7 `5 -> Element of a
5 means :
Def7:
:: MCART_3:def 7
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
5 );
existence
ex b1 being Element of c5 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b6 )
uniqueness
for b1, b2 being Element of c5 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b7 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b7 ) ) implies b1 = b2 )
func c
7 `6 -> Element of a
6 means :
Def8:
:: MCART_3:def 8
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( a
7 = [b1,b2,b3,b4,b5,b6] implies a
8 = b
6 );
existence
ex b1 being Element of c6 st
for b2, b3, b4, b5, b6, b7 being set holds
( c7 = [b2,b3,b4,b5,b6,b7] implies b1 = b7 )
uniqueness
for b1, b2 being Element of c6 holds
( ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b1 = b8 ) ) & ( for b3, b4, b5, b6, b7, b8 being set holds
( c7 = [b3,b4,b5,b6,b7,b8] implies b2 = b8 ) ) implies b1 = b2 )
end;
:: deftheorem Def3 defines `1 MCART_3:def 3 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
1 holds
( b
8 = b
7 `1 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
9 ) ) );
:: deftheorem Def4 defines `2 MCART_3:def 4 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
2 holds
( b
8 = b
7 `2 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
10 ) ) );
:: deftheorem Def5 defines `3 MCART_3:def 5 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
3 holds
( b
8 = b
7 `3 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
11 ) ) );
:: deftheorem Def6 defines `4 MCART_3:def 6 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
4 holds
( b
8 = b
7 `4 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
12 ) ) );
:: deftheorem Def7 defines `5 MCART_3:def 7 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
5 holds
( b
8 = b
7 `5 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
13 ) ) );
:: deftheorem Def8 defines `6 MCART_3:def 8 :
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8 being
Element of b
6 holds
( b
8 = b
7 `6 iff for b
9, b
10, b
11, b
12, b
13, b
14 being
set holds
( b
7 = [b9,b10,b11,b12,b13,b14] implies b
8 = b
14 ) ) );
theorem Th20: :: MCART_3:20
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
8, b
9, b
10, b
11, b
12, b
13 being
set holds
( b
7 = [b8,b9,b10,b11,b12,b13] implies ( b
7 `1 = b
8 & b
7 `2 = b
9 & b
7 `3 = b
10 & b
7 `4 = b
11 & b
7 `5 = b
12 & b
7 `6 = b
13 ) ) )
by Def3, Def4, Def5, Def6, Def7, Def8;
theorem Th21: :: MCART_3:21
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds b
7 = [(b7 `1 ),(b7 `2 ),(b7 `3 ),(b7 `4 ),(b7 `5 ),(b7 `6 )] )
theorem Th22: :: MCART_3:22
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
7 `1 = ((((b7 `1 ) `1 ) `1 ) `1 ) `1 & b
7 `2 = ((((b7 `1 ) `1 ) `1 ) `1 ) `2 & b
7 `3 = (((b7 `1 ) `1 ) `1 ) `2 & b
7 `4 = ((b7 `1 ) `1 ) `2 & b
7 `5 = (b7 `1 ) `2 & b
7 `6 = b
7 `2 ) )
theorem Th23: :: MCART_3:23
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
( not ( not b
1 c= [:b1,b2,b3,b4,b5,b6:] & not b
1 c= [:b2,b3,b4,b5,b6,b1:] & not b
1 c= [:b3,b4,b5,b6,b1,b2:] & not b
1 c= [:b4,b5,b6,b1,b2,b3:] & not b
1 c= [:b5,b6,b1,b2,b3,b4:] & not b
1 c= [:b6,b1,b2,b3,b4,b5:] ) implies b
1 = {} )
theorem Th24: :: MCART_3:24
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
(
[:b1,b2,b3,b4,b5,b6:] meets [:b7,b8,b9,b10,b11,b12:] implies ( b
1 meets b
7 & b
2 meets b
8 & b
3 meets b
9 & b
4 meets b
10 & b
5 meets b
11 & b
6 meets b
12 ) )
theorem Th25: :: MCART_3:25
for b
1, b
2, b
3, b
4, b
5, b
6 being
set holds
[:{b1},{b2},{b3},{b4},{b5},{b6}:] = {[b1,b2,b3,b4,b5,b6]}
theorem Th26: :: MCART_3:26
for b
1, b
2, b
3, b
4, b
5, b
6 being
set for b
7 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} implies for b
8, b
9, b
10, b
11, b
12, b
13 being
set holds
( b
7 = [b8,b9,b10,b11,b12,b13] implies ( b
7 `1 = b
8 & b
7 `2 = b
9 & b
7 `3 = b
10 & b
7 `4 = b
11 & b
7 `5 = b
12 & b
7 `6 = b
13 ) ) )
by Def3, Def4, Def5, Def6, Def7, Def8;
theorem Th27: :: MCART_3:27
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
9 ) ) implies b
7 = b
8 `1 )
theorem Th28: :: MCART_3:28
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
10 ) ) implies b
7 = b
8 `2 )
theorem Th29: :: MCART_3:29
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
11 ) ) implies b
7 = b
8 `3 )
theorem Th30: :: MCART_3:30
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
12 ) ) implies b
7 = b
8 `4 )
theorem Th31: :: MCART_3:31
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
13 ) ) implies b
7 = b
8 `5 )
theorem Th32: :: MCART_3:32
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set for b
8 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & ( for b
9 being
Element of b
1for b
10 being
Element of b
2for b
11 being
Element of b
3for b
12 being
Element of b
4for b
13 being
Element of b
5for b
14 being
Element of b
6 holds
( b
8 = [b9,b10,b11,b12,b13,b14] implies b
7 = b
14 ) ) implies b
7 = b
8 `6 )
theorem Th33: :: MCART_3:33
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
not ( b
1 in [:b2,b3,b4,b5,b6,b7:] & ( for b
8, b
9, b
10, b
11, b
12, b
13 being
set holds
not ( b
8 in b
2 & b
9 in b
3 & b
10 in b
4 & b
11 in b
5 & b
12 in b
6 & b
13 in b
7 & b
1 = [b8,b9,b10,b11,b12,b13] ) ) )
theorem Th34: :: MCART_3:34
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
(
[b1,b2,b3,b4,b5,b6] in [:b7,b8,b9,b10,b11,b12:] iff ( b
1 in b
7 & b
2 in b
8 & b
3 in b
9 & b
4 in b
10 & b
5 in b
11 & b
6 in b
12 ) )
theorem Th35: :: MCART_3:35
for b
1, b
2, b
3, b
4, b
5, b
6, b
7 being
set holds
( ( for b
8 being
set holds
( b
8 in b
1 iff ex b
9, b
10, b
11, b
12, b
13, b
14 being
set st
( b
9 in b
2 & b
10 in b
3 & b
11 in b
4 & b
12 in b
5 & b
13 in b
6 & b
14 in b
7 & b
8 = [b9,b10,b11,b12,b13,b14] ) ) ) implies b
1 = [:b2,b3,b4,b5,b6,b7:] )
theorem Th36: :: MCART_3:36
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
( b
1 <> {} & b
2 <> {} & b
3 <> {} & b
4 <> {} & b
5 <> {} & b
6 <> {} & b
7 <> {} & b
8 <> {} & b
9 <> {} & b
10 <> {} & b
11 <> {} & b
12 <> {} implies for b
13 being
Element of
[:b1,b2,b3,b4,b5,b6:]for b
14 being
Element of
[:b7,b8,b9,b10,b11,b12:] holds
( b
13 = b
14 implies ( b
13 `1 = b
14 `1 & b
13 `2 = b
14 `2 & b
13 `3 = b
14 `3 & b
13 `4 = b
14 `4 & b
13 `5 = b
14 `5 & b
13 `6 = b
14 `6 ) ) )
theorem Th37: :: MCART_3:37
for b
1, b
2, b
3, b
4, b
5, b
6 being
set for b
7 being
Subset of b
1for b
8 being
Subset of b
2for b
9 being
Subset of b
3for b
10 being
Subset of b
4for b
11 being
Subset of b
5for b
12 being
Subset of b
6for b
13 being
Element of
[:b1,b2,b3,b4,b5,b6:] holds
( b
13 in [:b7,b8,b9,b10,b11,b12:] implies ( b
13 `1 in b
7 & b
13 `2 in b
8 & b
13 `3 in b
9 & b
13 `4 in b
10 & b
13 `5 in b
11 & b
13 `6 in b
12 ) )
theorem Th38: :: MCART_3:38
for b
1, b
2, b
3, b
4, b
5, b
6, b
7, b
8, b
9, b
10, b
11, b
12 being
set holds
( b
1 c= b
2 & b
3 c= b
4 & b
5 c= b
6 & b
7 c= b
8 & b
9 c= b
10 & b
11 c= b
12 implies
[:b1,b3,b5,b7,b9,b11:] c= [:b2,b4,b6,b8,b10,b12:] )
theorem Th39: :: MCART_3:39
for b
1, b
2, b
3, b
4, b
5, b
6 being
set for b
7 being
Subset of b
1for b
8 being
Subset of b
2for b
9 being
Subset of b
3for b
10 being
Subset of b
4for b
11 being
Subset of b
5for b
12 being
Subset of b
6 holds
[:b7,b8,b9,b10,b11,b12:] is
Subset of
[:b1,b2,b3,b4,b5,b6:] by Th38;