let n be non zero Nat; for X being non empty set
for r being total transitive Relation of X holds n -placesOf r is total transitive Relation of (n -tuples_on X)
let X be non empty set ; for r being total transitive Relation of X holds n -placesOf r is total transitive Relation of (n -tuples_on X)
let r be total transitive Relation of X; n -placesOf r is total transitive Relation of (n -tuples_on X)
B0:
field r = X
by ORDERS_1:12;
set R = n -placesOf r;
B2:
field (n -placesOf r) = n -tuples_on X
by ORDERS_1:12;
now let x,
y,
z be
set ;
( x in n -tuples_on X & y in n -tuples_on X & z in n -tuples_on X & [x,y] in n -placesOf r & [y,z] in n -placesOf r implies [x,z] in n -placesOf r )assume
x in n -tuples_on X
;
( y in n -tuples_on X & z in n -tuples_on X & [x,y] in n -placesOf r & [y,z] in n -placesOf r implies [x,z] in n -placesOf r )then reconsider xa =
x as
Element of
Funcs (
(Seg n),
X)
by FINSEQ_2:93;
assume
y in n -tuples_on X
;
( z in n -tuples_on X & [x,y] in n -placesOf r & [y,z] in n -placesOf r implies [x,z] in n -placesOf r )then reconsider ya =
y as
Element of
Funcs (
(Seg n),
X)
by FINSEQ_2:93;
assume
z in n -tuples_on X
;
( [x,y] in n -placesOf r & [y,z] in n -placesOf r implies [x,z] in n -placesOf r )then reconsider za =
z as
Element of
Funcs (
(Seg n),
X)
by FINSEQ_2:93;
assume C1:
[x,y] in n -placesOf r
;
( [y,z] in n -placesOf r implies [x,z] in n -placesOf r )assume C2:
[y,z] in n -placesOf r
;
[x,z] in n -placesOf rC4:
r is_transitive_in X
by B0, RELAT_2:def 16;
hence
[x,z] in n -placesOf r
by Lm9;
verum end;
then
n -placesOf r is_transitive_in n -tuples_on X
by RELAT_2:def 8;
hence
n -placesOf r is total transitive Relation of (n -tuples_on X)
by B2, RELAT_2:def 16; verum