:: WELLORD2 semantic presentation

definition

let X be set ;
func RelIncl X -> Relation means :Def1: :: WELLORD2:def 1
( field it = X & ( for Y, Z being set st Y in X & Z in X holds
( [Y,Z] in it iff Y c= Z ) ) );
existence

proof end;

uniqueness

proof end;

end;

:: deftheorem Def1 defines RelIncl WELLORD2:def 1 :

theorem :: WELLORD2:1

canceled;

theorem Th2: :: WELLORD2:2

for X being set holds RelIncl X is reflexive

proof end;

theorem Th3: :: WELLORD2:3

for X being set holds RelIncl X is transitive

proof end;

theorem Th4: :: WELLORD2:4

for A being Ordinal holds RelIncl A is connected

proof end;

theorem Th5: :: WELLORD2:5

for X being set holds RelIncl X is antisymmetric

proof end;

theorem Th6: :: WELLORD2:6

for A being Ordinal holds RelIncl A is well_founded

proof end;

theorem Th7: :: WELLORD2:7

for A being Ordinal holds RelIncl A is well-ordering

proof end;

theorem Th8: :: WELLORD2:8

for Y, X being set st Y c= X holds
(RelIncl X) |_2 Y = RelIncl Y

proof end;

theorem Th9: :: WELLORD2:9

for A being Ordinal
for X being set st X c= A holds
RelIncl X is well-ordering

proof end;

theorem Th10: :: WELLORD2:10

for A, B being Ordinal st A in B holds
A = (RelIncl B) -Seg A

proof end;

theorem Th11: :: WELLORD2:11

for A, B being Ordinal st RelIncl A, RelIncl B are_isomorphic holds
A = B

proof end;

theorem Th12: :: WELLORD2:12

for R being Relation
for A, B being Ordinal st R, RelIncl A are_isomorphic & R, RelIncl B are_isomorphic holds
A = B

proof end;

theorem Th13: :: WELLORD2:13

for R being Relation st R is well-ordering & ( for a being set st a in field R holds
ex A being Ordinal st R |_2 (R -Seg a), RelIncl A are_isomorphic ) holds
ex A being Ordinal st R, RelIncl A are_isomorphic

proof end;

theorem Th14: :: WELLORD2:14

for R being Relation st R is well-ordering holds
ex A being Ordinal st R, RelIncl A are_isomorphic

proof end;

definition

let R be Relation;
assume A1: R is well-ordering ;
func order_type_of R -> Ordinal means :Def2: :: WELLORD2:def 2
R, RelIncl it are_isomorphic ;
existence by A1, Th14;
uniqueness by Th12;

end;

:: deftheorem Def2 defines order_type_of WELLORD2:def 2 :

definition

let A be Ordinal;
let R be Relation;
pred A is_order_type_of R means :: WELLORD2:def 3
A = order_type_of R;

end;

:: deftheorem defines is_order_type_of WELLORD2:def 3 :

theorem :: WELLORD2:15

canceled;

theorem :: WELLORD2:16

canceled;

theorem :: WELLORD2:17

for X being set
for A being Ordinal st X c= A holds
order_type_of (RelIncl X) c= A

proof end;

definition

let X, Y be set ;
:: original: are_equipotent
redefine pred X,Y are_equipotent means :: WELLORD2:def 4
ex f being Function st
( f is one-to-one & dom f = X & rng f = Y );
compatibility

proof end;

reflexivity

proof end;

symmetry

proof end;

end;

:: deftheorem defines are_equipotent WELLORD2:def 4 :

theorem :: WELLORD2:18

canceled;

theorem :: WELLORD2:19

canceled;

theorem :: WELLORD2:20

canceled;

theorem :: WELLORD2:21

canceled;

theorem :: WELLORD2:22

for X, Y, Z being set st X,Y are_equipotent & Y,Z are_equipotent holds
X,Z are_equipotent

proof end;

theorem :: WELLORD2:23

canceled;

theorem :: WELLORD2:24

canceled;

theorem Th25: :: WELLORD2:25

for X being set
for R being Relation st R well_orders X holds
( field (R |_2 X) = X & R |_2 X is well-ordering )

proof end;

Lm1: for X being set
for R being Relation st R is well-ordering & X, field R are_equipotent holds
ex R being Relation st R well_orders X

proof end;

theorem Th26: :: WELLORD2:26

for X being set ex R being Relation st R well_orders X

proof end;

theorem :: WELLORD2:27

for M being non empty set st ( for X being set st X in M holds
X <> {} ) & ( for X, Y being set st X in M & Y in M & X <> Y holds
X misses Y ) holds
ex Choice being set st
for X being set st X in M holds
ex x being set st Choice /\ X = {x}

proof end;

theorem Th28: :: WELLORD2:28

for M being non empty set st ( for X being set st X in M holds
X <> {} ) holds
ex Choice being Function st
( dom Choice = M & ( for X being set st X in M holds
Choice . X in X ) )

proof end;

scheme :: WELLORD2:sch 1
NonUniqBoundFuncEx{ F₁() -> set , F₂() -> set , P₁[ set , set ] } :

ex f being Function st
( dom f = F₁() & rng f c= F₂() & ( for x being set st x in F₁() holds
P₁[x,f . x] ) )

provided

A1: for x being set st x in F₁() holds
ex y being set st
( y in F₂() & P₁[x,y] )

proof end;

scheme :: WELLORD2:sch 2
BiFuncEx{ F₁() -> set , F₂() -> set , F₃() -> set , P₁[ set , set , set ] } :

ex f, g being Function st
( dom f = F₁() & dom g = F₁() & ( for x being set st x in F₁() holds
P₁[x,f . x,g . x] ) )

provided

A1: for x being set st x in F₁() holds
ex y, z being set st
( y in F₂() & z in F₃() & P₁[x,y,z] )

proof end;