set Z = {0 ,1,(3 \ 1),2,(3 \ 2),3};
set N = B_6 ;
AA:
the carrier of B_6 = {0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
A1:
B_6 is with_suprema
proof
let x,
y be
Element of
B_6 ;
:: according to LATTICE3:def 10 :: thesis: ex b1 being Element of the carrier of B_6 st
( x <= b1 & y <= b1 & ( for b2 being Element of the carrier of B_6 holds
( not x <= b2 or not y <= b2 or b1 <= b2 ) ) )
A8:
{0 ,1,(3 \ 1),2,(3 \ 2),3} = the
carrier of
B_6
by YELLOW_1:1;
thus
ex
z being
Element of
B_6 st
(
x <= z &
y <= z & ( for
z' being
Element of
B_6 st
x <= z' &
y <= z' holds
z <= z' ) )
:: thesis: verumproof
per cases
( ( x = 0 & y = 0 ) or ( x = 0 & y = 3 \ 1 ) or ( x = 0 & y = 2 ) or ( x = 0 & y = 3 \ 2 ) or ( x = 0 & y = 3 ) or ( x = 3 \ 1 & y = 0 ) or ( x = 3 \ 1 & y = 3 \ 1 ) or ( x = 3 \ 1 & y = 2 ) or ( x = 1 & y = 0 ) or ( x = 1 & y = 1 ) or ( x = 1 & y = 3 \ 1 ) or ( x = 1 & y = 3 \ 2 ) or ( x = 1 & y = 3 ) or ( x = 1 & y = 2 ) or ( y = 1 & x = 0 ) or ( y = 1 & x = 1 ) or ( y = 1 & x = 3 \ 1 ) or ( y = 1 & x = 3 \ 2 ) or ( y = 1 & x = 3 ) or ( y = 1 & x = 2 ) or ( x = 3 \ 1 & y = 3 \ 2 ) or ( x = 3 \ 1 & y = 3 ) or ( x = 2 & y = 0 ) or ( x = 2 & y = 3 \ 1 ) or ( x = 2 & y = 2 ) or ( x = 2 & y = 3 \ 2 ) or ( x = 2 & y = 3 ) or ( x = 3 \ 2 & y = 0 ) or ( x = 3 \ 2 & y = 3 \ 1 ) or ( x = 3 \ 2 & y = 2 ) or ( x = 3 \ 2 & y = 3 \ 2 ) or ( x = 3 \ 2 & y = 3 ) or ( x = 3 & y = 0 ) or ( x = 3 & y = 3 \ 1 ) or ( x = 3 & y = 2 ) or ( x = 3 & y = 3 \ 2 ) or ( x = 3 & y = 3 ) )
by A8, ENUMSET1:def 4;
suppose A9:
(
x = 3
\ 1 &
y = 2 )
;
:: thesis: ex z being Element of B_6 st
( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
3
in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z = 3 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
(
x c= z &
y c= z )
by A9, NAT_1:40;
hence
(
x <= z &
y <= z )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z'let z' be
Element of
B_6 ;
:: thesis: ( x <= z' & y <= z' implies z <= z' )A10:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
x <= z' &
y <= z' )
;
:: thesis: z <= z'then A11:
( 3
\ 1
c= z' & 2
c= z' )
by A9, YELLOW_1:3;
A00:
z' <> 1
by A11, NAT_1:40;
z' <> 0
by A11;
hence
z <= z'
by A00, A10, A12, A13, A14, ENUMSET1:def 4;
:: thesis: verum end; suppose A9:
(
x = 1 &
y = 3
\ 2 )
;
:: thesis: ex z being Element of B_6 st
( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
3
in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z = 3 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
(
x c= z &
y c= z )
by A9, NAT_1:40;
hence
(
x <= z &
y <= z )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z'let z' be
Element of
B_6 ;
:: thesis: ( x <= z' & y <= z' implies z <= z' )A10:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
x <= z' &
y <= z' )
;
:: thesis: z <= z'then A11:
( 3
\ 2
c= z' & 1
c= z' )
by A9, YELLOW_1:3;
z' <> 0
by A11;
hence
z <= z'
by A00, A10, A12, A13, A14, ENUMSET1:def 4;
:: thesis: verum end; suppose A9:
(
y = 1 &
x = 3
\ 2 )
;
:: thesis: ex z being Element of B_6 st
( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
3
in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z = 3 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
(
x c= z &
y c= z )
by A9, NAT_1:40;
hence
(
x <= z &
y <= z )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z'let z' be
Element of
B_6 ;
:: thesis: ( x <= z' & y <= z' implies z <= z' )A10:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
x <= z' &
y <= z' )
;
:: thesis: z <= z'then A11:
( 3
\ 2
c= z' & 1
c= z' )
by A9, YELLOW_1:3;
z' <> 0
by A11;
hence
z <= z'
by A00, A10, A12, A13, A14, ENUMSET1:def 4;
:: thesis: verum end; suppose A16:
(
x = 2 &
y = 3
\ 1 )
;
:: thesis: ex z being Element of B_6 st
( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
3
in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z = 3 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( x <= z & y <= z & ( for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z' ) )
(
x c= z &
y c= z )
by A16, NAT_1:40;
hence
(
x <= z &
y <= z )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st x <= z' & y <= z' holds
z <= z'let z' be
Element of
B_6 ;
:: thesis: ( x <= z' & y <= z' implies z <= z' )A10:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
x <= z' &
y <= z' )
;
:: thesis: z <= z'then A11:
( 3
\ 1
c= z' & 2
c= z' )
by A16, YELLOW_1:3;
A00:
z' <> 1
by A11, NAT_1:40;
z' <> 0
by A11;
hence
z <= z'
by A00, A10, A12, A13, A14, ENUMSET1:def 4;
:: thesis: verum end; end;
end;
end;
B_6 is with_infima
proof
let x,
y be
Element of
B_6 ;
:: according to LATTICE3:def 11 :: thesis: ex b1 being Element of the carrier of B_6 st
( b1 <= x & b1 <= y & ( for b2 being Element of the carrier of B_6 holds
( not b2 <= x or not b2 <= y or b2 <= b1 ) ) )
A8:
{0 ,1,(3 \ 1),2,(3 \ 2),3} = the
carrier of
B_6
by YELLOW_1:1;
thus
ex
z being
Element of
B_6 st
(
z <= x &
z <= y & ( for
z' being
Element of
B_6 st
z' <= x &
z' <= y holds
z' <= z ) )
:: thesis: verumproof
per cases
( ( x = 0 & y = 0 ) or ( x = 0 & y = 3 \ 1 ) or ( x = 0 & y = 2 ) or ( x = 0 & y = 3 \ 2 ) or ( x = 0 & y = 3 ) or ( x = 3 \ 1 & y = 0 ) or ( x = 3 \ 1 & y = 3 \ 1 ) or ( x = 3 \ 1 & y = 2 ) or ( x = 1 & y = 0 ) or ( x = 1 & y = 1 ) or ( x = 1 & y = 3 \ 1 ) or ( x = 1 & y = 3 \ 2 ) or ( x = 1 & y = 3 ) or ( x = 1 & y = 2 ) or ( y = 1 & x = 0 ) or ( y = 1 & x = 1 ) or ( y = 1 & x = 3 \ 1 ) or ( y = 1 & x = 3 \ 2 ) or ( y = 1 & x = 3 ) or ( y = 1 & x = 2 ) or ( x = 3 \ 1 & y = 3 \ 2 ) or ( x = 3 \ 1 & y = 3 ) or ( x = 2 & y = 0 ) or ( x = 2 & y = 3 \ 1 ) or ( x = 2 & y = 2 ) or ( x = 2 & y = 3 \ 2 ) or ( x = 2 & y = 3 ) or ( x = 3 \ 2 & y = 0 ) or ( x = 3 \ 2 & y = 3 \ 1 ) or ( x = 3 \ 2 & y = 2 ) or ( x = 3 \ 2 & y = 3 \ 2 ) or ( x = 3 \ 2 & y = 3 ) or ( x = 3 & y = 0 ) or ( x = 3 & y = 3 \ 1 ) or ( x = 3 & y = 2 ) or ( x = 3 & y = 3 \ 2 ) or ( x = 3 & y = 3 ) )
by A8, ENUMSET1:def 4;
suppose A9:
(
x = 3
\ 1 &
y = 2 )
;
:: thesis: ex z being Element of B_6 st
( z <= x & z <= y & ( for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= z ) )
0 in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z =
0 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( z <= x & z <= y & ( for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= z ) )
(
z c= x &
z c= y )
by XBOOLE_1:2;
hence
(
z <= x &
z <= y )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= zlet z' be
Element of
B_6 ;
:: thesis: ( z' <= x & z' <= y implies z' <= z )A10:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
z' <= x &
z' <= y )
;
:: thesis: z' <= zthen A11:
(
z' c= 3
\ 1 &
z' c= 2 )
by A9, YELLOW_1:3;
hence
z' <= z
by A00, A10, A12, A13, A14, ENUMSET1:def 4;
:: thesis: verum end; suppose A16:
(
x = 2 &
y = 3
\ 1 )
;
:: thesis: ex z being Element of B_6 st
( z <= x & z <= y & ( for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= z ) )
0 in {0 ,1,(3 \ 1),2,(3 \ 2),3}
by ENUMSET1:def 4;
then reconsider z =
0 as
Element of
B_6 by YELLOW_1:1;
take
z
;
:: thesis: ( z <= x & z <= y & ( for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= z ) )
(
z c= x &
z c= y )
by XBOOLE_1:2;
hence
(
z <= x &
z <= y )
by YELLOW_1:3;
:: thesis: for z' being Element of B_6 st z' <= x & z' <= y holds
z' <= zlet z' be
Element of
B_6 ;
:: thesis: ( z' <= x & z' <= y implies z' <= z )A17:
z' is
Element of
{0 ,1,(3 \ 1),2,(3 \ 2),3}
by YELLOW_1:1;
assume
(
z' <= x &
z' <= y )
;
:: thesis: z' <= zthen A18:
(
z' c= 3
\ 1 &
z' c= 2 )
by A16, YELLOW_1:3;
hence
z' <= z
by A17, A19, A20, A21, A202, ENUMSET1:def 4;
:: thesis: verum end; end;
end;
end;
hence
( B_6 is with_suprema & B_6 is with_infima )
by A1; :: thesis: verum