This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.
Metamath Proof Explorer
Description: Hilbert lattice join is the least upper bound of two elements.
(Contributed by NM, 12-Jun-2004) (New usage is discouraged.)
|
|
Ref |
Expression |
|
Assertion |
chlub |
|
Proof
| Step |
Hyp |
Ref |
Expression |
| 1 |
|
chsh |
|
| 2 |
|
chsh |
|
| 3 |
|
shlub |
|
| 4 |
2 3
|
syl3an2 |
|
| 5 |
1 4
|
syl3an1 |
|