:: MCART_3 semantic presentation  Show TPTP formulae Show IDV graph for whole article:: Showing IDV graph ... (Click the Palm Trees again to close it)

theorem :: MCART_3:1  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being set st X <> {} holds
ex Y being set st
( Y in X & ( for Y1, Y2, Y3, Y4, Y5, Y6, Y7, Y8 being set st Y1 in Y2 & Y2 in Y3 & Y3 in Y4 & Y4 in Y5 & Y5 in Y6 & Y6 in Y7 & Y7 in Y8 & Y8 in Y holds
Y1 misses X ) )
proof end;

theorem Th2: :: MCART_3:2  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being set st X <> {} holds
ex Y being set st
( Y in X & ( for Y1, Y2, Y3, Y4, Y5, Y6, Y7, Y8, Y9 being set st Y1 in Y2 & Y2 in Y3 & Y3 in Y4 & Y4 in Y5 & Y5 in Y6 & Y6 in Y7 & Y7 in Y8 & Y8 in Y9 & Y9 in Y holds
Y1 misses X ) )
proof end;

definition
let x1, x2, x3, x4, x5, x6 be set ;
func [x1,x2,x3,x4,x5,x6] -> set equals :: MCART_3:def 1
[[x1,x2,x3,x4,x5],x6];
correctness
coherence
[[x1,x2,x3,x4,x5],x6] is set ;
;
end;

:: deftheorem defines [ MCART_3:def 1 :
for x1, x2, x3, x4, x5, x6 being set holds [x1,x2,x3,x4,x5,x6] = [[x1,x2,x3,x4,x5],x6];

theorem Th3: :: MCART_3:3  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6 being set holds [x1,x2,x3,x4,x5,x6] = [[[[[x1,x2],x3],x4],x5],x6]
proof end;

theorem :: MCART_3:4  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: MCART_3:5  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6 being set holds [x1,x2,x3,x4,x5,x6] = [[x1,x2,x3,x4],x5,x6]
proof end;

theorem :: MCART_3:6  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6 being set holds [x1,x2,x3,x4,x5,x6] = [[x1,x2,x3],x4,x5,x6]
proof end;

theorem Th7: :: MCART_3:7  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6 being set holds [x1,x2,x3,x4,x5,x6] = [[x1,x2],x3,x4,x5,x6]
proof end;

theorem Th8: :: MCART_3:8  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6, y1, y2, y3, y4, y5, y6 being set st [x1,x2,x3,x4,x5,x6] = [y1,y2,y3,y4,y5,y6] holds
( x1 = y1 & x2 = y2 & x3 = y3 & x4 = y4 & x5 = y5 & x6 = y6 )
proof end;

theorem Th9: :: MCART_3:9  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X being set st X <> {} holds
ex v being set st
( v in X & ( for x1, x2, x3, x4, x5, x6 being set holds
( ( not x1 in X & not x2 in X ) or not v = [x1,x2,x3,x4,x5,x6] ) ) )
proof end;

definition
let X1, X2, X3, X4, X5, X6 be set ;
func [:X1,X2,X3,X4,X5,X6:] -> set equals :: MCART_3:def 2
[:[:X1,X2,X3,X4,X5:],X6:];
coherence
[:[:X1,X2,X3,X4,X5:],X6:] is set ;
end;

:: deftheorem defines [: MCART_3:def 2 :
for X1, X2, X3, X4, X5, X6 being set holds [:X1,X2,X3,X4,X5,X6:] = [:[:X1,X2,X3,X4,X5:],X6:];

theorem Th10: :: MCART_3:10  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set holds [:X1,X2,X3,X4,X5,X6:] = [:[:[:[:[:X1,X2:],X3:],X4:],X5:],X6:]
proof end;

theorem :: MCART_3:11  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
canceled;

theorem :: MCART_3:12  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set holds [:X1,X2,X3,X4,X5,X6:] = [:[:X1,X2,X3,X4:],X5,X6:]
proof end;

theorem :: MCART_3:13  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set holds [:X1,X2,X3,X4,X5,X6:] = [:[:X1,X2,X3:],X4,X5,X6:]
proof end;

theorem Th14: :: MCART_3:14  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set holds [:X1,X2,X3,X4,X5,X6:] = [:[:X1,X2:],X3,X4,X5,X6:]
proof end;

theorem Th15: :: MCART_3:15  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set holds
( ( X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} ) iff [:X1,X2,X3,X4,X5,X6:] <> {} )
proof end;

theorem Th16: :: MCART_3:16  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, Y1, Y2, Y3, Y4, Y5, Y6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & [:X1,X2,X3,X4,X5,X6:] = [:Y1,Y2,Y3,Y4,Y5,Y6:] holds
( X1 = Y1 & X2 = Y2 & X3 = Y3 & X4 = Y4 & X5 = Y5 & X6 = Y6 )
proof end;

theorem :: MCART_3:17  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, Y1, Y2, Y3, Y4, Y5, Y6 being set st [:X1,X2,X3,X4,X5,X6:] <> {} & [:X1,X2,X3,X4,X5,X6:] = [:Y1,Y2,Y3,Y4,Y5,Y6:] holds
( X1 = Y1 & X2 = Y2 & X3 = Y3 & X4 = Y4 & X5 = Y5 & X6 = Y6 )
proof end;

theorem :: MCART_3:18  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X, Y being set st [:X,X,X,X,X,X:] = [:Y,Y,Y,Y,Y,Y:] holds
X = Y
proof end;

theorem Th19: :: MCART_3:19  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:] ex xx1 being Element of X1 ex xx2 being Element of X2 ex xx3 being Element of X3 ex xx4 being Element of X4 ex xx5 being Element of X5 ex xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6]
proof end;

definition
let X1, X2, X3, X4, X5, X6 be set ;
assume A1: ( X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} ) ;
let x be Element of [:X1,X2,X3,X4,X5,X6:];
func x `1 -> Element of X1 means :Def3: :: MCART_3:def 3
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x1;
existence
ex b1 being Element of X1 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x1
proof end;
uniqueness
for b1, b2 being Element of X1 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x1 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x1 ) holds
b1 = b2
proof end;
func x `2 -> Element of X2 means :Def4: :: MCART_3:def 4
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x2;
existence
ex b1 being Element of X2 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x2
proof end;
uniqueness
for b1, b2 being Element of X2 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x2 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x2 ) holds
b1 = b2
proof end;
func x `3 -> Element of X3 means :Def5: :: MCART_3:def 5
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x3;
existence
ex b1 being Element of X3 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x3
proof end;
uniqueness
for b1, b2 being Element of X3 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x3 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x3 ) holds
b1 = b2
proof end;
func x `4 -> Element of X4 means :Def6: :: MCART_3:def 6
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x4;
existence
ex b1 being Element of X4 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x4
proof end;
uniqueness
for b1, b2 being Element of X4 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x4 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x4 ) holds
b1 = b2
proof end;
func x `5 -> Element of X5 means :Def7: :: MCART_3:def 7
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x5;
existence
ex b1 being Element of X5 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x5
proof end;
uniqueness
for b1, b2 being Element of X5 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x5 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x5 ) holds
b1 = b2
proof end;
func x `6 -> Element of X6 means :Def8: :: MCART_3:def 8
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
it = x6;
existence
ex b1 being Element of X6 st
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x6
proof end;
uniqueness
for b1, b2 being Element of X6 st ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b1 = x6 ) & ( for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b2 = x6 ) holds
b1 = b2
proof end;
end;

:: deftheorem Def3 defines `1 MCART_3:def 3 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X1 holds
( b8 = x `1 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x1 );

:: deftheorem Def4 defines `2 MCART_3:def 4 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X2 holds
( b8 = x `2 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x2 );

:: deftheorem Def5 defines `3 MCART_3:def 5 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X3 holds
( b8 = x `3 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x3 );

:: deftheorem Def6 defines `4 MCART_3:def 6 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X4 holds
( b8 = x `4 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x4 );

:: deftheorem Def7 defines `5 MCART_3:def 7 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X5 holds
( b8 = x `5 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x5 );

:: deftheorem Def8 defines `6 MCART_3:def 8 :
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for b8 being Element of X6 holds
( b8 = x `6 iff for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
b8 = x6 );

theorem :: MCART_3:20  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
( x `1 = x1 & x `2 = x2 & x `3 = x3 & x `4 = x4 & x `5 = x5 & x `6 = x6 ) by Def3, Def4, Def5, Def6, Def7, Def8;

theorem Th21: :: MCART_3:21  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:] holds x = [(x `1 ),(x `2 ),(x `3 ),(x `4 ),(x `5 ),(x `6 )]
proof end;

theorem Th22: :: MCART_3:22  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:] holds
( x `1 = ((((x `1 ) `1 ) `1 ) `1 ) `1 & x `2 = ((((x `1 ) `1 ) `1 ) `1 ) `2 & x `3 = (((x `1 ) `1 ) `1 ) `2 & x `4 = ((x `1 ) `1 ) `2 & x `5 = (x `1 ) `2 & x `6 = x `2 )
proof end;

theorem :: MCART_3:23  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set st ( X1 c= [:X1,X2,X3,X4,X5,X6:] or X1 c= [:X2,X3,X4,X5,X6,X1:] or X1 c= [:X3,X4,X5,X6,X1,X2:] or X1 c= [:X4,X5,X6,X1,X2,X3:] or X1 c= [:X5,X6,X1,X2,X3,X4:] or X1 c= [:X6,X1,X2,X3,X4,X5:] ) holds
X1 = {}
proof end;

theorem :: MCART_3:24  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, Y1, Y2, Y3, Y4, Y5, Y6 being set st [:X1,X2,X3,X4,X5,X6:] meets [:Y1,Y2,Y3,Y4,Y5,Y6:] holds
( X1 meets Y1 & X2 meets Y2 & X3 meets Y3 & X4 meets Y4 & X5 meets Y5 & X6 meets Y6 )
proof end;

theorem :: MCART_3:25  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6 being set holds [:{x1},{x2},{x3},{x4},{x5},{x6}:] = {[x1,x2,x3,x4,x5,x6]}
proof end;

theorem :: MCART_3:26  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} holds
for x1, x2, x3, x4, x5, x6 being set st x = [x1,x2,x3,x4,x5,x6] holds
( x `1 = x1 & x `2 = x2 & x `3 = x3 & x `4 = x4 & x `5 = x5 & x `6 = x6 ) by Def3, Def4, Def5, Def6, Def7, Def8;

theorem :: MCART_3:27  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y1 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y1 = xx1 ) holds
y1 = x `1
proof end;

theorem :: MCART_3:28  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y2 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y2 = xx2 ) holds
y2 = x `2
proof end;

theorem :: MCART_3:29  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y3 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y3 = xx3 ) holds
y3 = x `3
proof end;

theorem :: MCART_3:30  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y4 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y4 = xx4 ) holds
y4 = x `4
proof end;

theorem :: MCART_3:31  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y5 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y5 = xx5 ) holds
y5 = x `5
proof end;

theorem :: MCART_3:32  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, y6 being set
for x being Element of [:X1,X2,X3,X4,X5,X6:] st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & ( for xx1 being Element of X1
for xx2 being Element of X2
for xx3 being Element of X3
for xx4 being Element of X4
for xx5 being Element of X5
for xx6 being Element of X6 st x = [xx1,xx2,xx3,xx4,xx5,xx6] holds
y6 = xx6 ) holds
y6 = x `6
proof end;

theorem :: MCART_3:33  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for z, X1, X2, X3, X4, X5, X6 being set st z in [:X1,X2,X3,X4,X5,X6:] holds
ex x1, x2, x3, x4, x5, x6 being set st
( x1 in X1 & x2 in X2 & x3 in X3 & x4 in X4 & x5 in X5 & x6 in X6 & z = [x1,x2,x3,x4,x5,x6] )
proof end;

theorem :: MCART_3:34  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for x1, x2, x3, x4, x5, x6, X1, X2, X3, X4, X5, X6 being set holds
( [x1,x2,x3,x4,x5,x6] in [:X1,X2,X3,X4,X5,X6:] iff ( x1 in X1 & x2 in X2 & x3 in X3 & x4 in X4 & x5 in X5 & x6 in X6 ) )
proof end;

theorem :: MCART_3:35  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for Z, X1, X2, X3, X4, X5, X6 being set st ( for z being set holds
( z in Z iff ex x1, x2, x3, x4, x5, x6 being set st
( x1 in X1 & x2 in X2 & x3 in X3 & x4 in X4 & x5 in X5 & x6 in X6 & z = [x1,x2,x3,x4,x5,x6] ) ) ) holds
Z = [:X1,X2,X3,X4,X5,X6:]
proof end;

theorem Th36: :: MCART_3:36  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6, Y1, Y2, Y3, Y4, Y5, Y6 being set st X1 <> {} & X2 <> {} & X3 <> {} & X4 <> {} & X5 <> {} & X6 <> {} & Y1 <> {} & Y2 <> {} & Y3 <> {} & Y4 <> {} & Y5 <> {} & Y6 <> {} holds
for x being Element of [:X1,X2,X3,X4,X5,X6:]
for y being Element of [:Y1,Y2,Y3,Y4,Y5,Y6:] st x = y holds
( x `1 = y `1 & x `2 = y `2 & x `3 = y `3 & x `4 = y `4 & x `5 = y `5 & x `6 = y `6 )
proof end;

theorem :: MCART_3:37  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set
for A1 being Subset of X1
for A2 being Subset of X2
for A3 being Subset of X3
for A4 being Subset of X4
for A5 being Subset of X5
for A6 being Subset of X6
for x being Element of [:X1,X2,X3,X4,X5,X6:] st x in [:A1,A2,A3,A4,A5,A6:] holds
( x `1 in A1 & x `2 in A2 & x `3 in A3 & x `4 in A4 & x `5 in A5 & x `6 in A6 )
proof end;

theorem Th38: :: MCART_3:38  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, Y1, X2, Y2, X3, Y3, X4, Y4, X5, Y5, X6, Y6 being set st X1 c= Y1 & X2 c= Y2 & X3 c= Y3 & X4 c= Y4 & X5 c= Y5 & X6 c= Y6 holds
[:X1,X2,X3,X4,X5,X6:] c= [:Y1,Y2,Y3,Y4,Y5,Y6:]
proof end;

theorem :: MCART_3:39  Show TPTP formulae Show IDV graph:: Showing IDV graph ... (Click the Palm Tree again to close it) Show TPTP problem
for X1, X2, X3, X4, X5, X6 being set
for A1 being Subset of X1
for A2 being Subset of X2
for A3 being Subset of X3
for A4 being Subset of X4
for A5 being Subset of X5
for A6 being Subset of X6 holds [:A1,A2,A3,A4,A5,A6:] is Subset of [:X1,X2,X3,X4,X5,X6:] by Th38;