let L be non empty LattStr ; :: thesis: ( L is Lattice-like iff ( L is meet-Associative & L is join-Associative & L is meet-Absorbing & L is join-absorbing ) )
A1:
( L is Lattice-like implies ( L is meet-Associative & L is join-Associative & L is meet-Absorbing & L is join-absorbing ) )
proof
assume A2:
L is
Lattice-like
;
:: thesis: ( L is meet-Associative & L is join-Associative & L is meet-Absorbing & L is join-absorbing )
then A3:
(
L is
meet-absorbing &
L is
join-absorbing )
;
A4:
(
L is
meet-associative &
L is
meet-commutative &
L is
join-associative &
L is
join-commutative )
by A2;
A5:
for
x,
y,
z being
Element of
L holds
x "\/" (y "\/" z) = y "\/" (x "\/" z)
A6:
for
x,
y,
z being
Element of
L holds
x "/\" (y "/\" z) = y "/\" (x "/\" z)
for
x,
y being
Element of
L holds
x "\/" (x "/\" y) = x
hence
(
L is
meet-Associative &
L is
join-Associative &
L is
meet-Absorbing &
L is
join-absorbing )
by A2, A5, A6, Def1, Def2, Def3;
:: thesis: verum
end;
( L is meet-Associative & L is join-Associative & L is meet-Absorbing & L is join-absorbing implies L is Lattice-like )
hence
( L is Lattice-like iff ( L is meet-Associative & L is join-Associative & L is meet-Absorbing & L is join-absorbing ) )
by A1; :: thesis: verum