Description: The LUB of a complete lattice subset is the least bound. (Contributed by NM, 19-Oct-2011)
Ref | Expression | ||
---|---|---|---|
Hypotheses | lublem.b | |
|
lublem.l | |
||
lublem.u | |
||
Assertion | lubl | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lublem.b | |
|
2 | lublem.l | |
|
3 | lublem.u | |
|
4 | 1 2 3 | lublem | |
5 | 4 | simprd | |
6 | breq2 | |
|
7 | 6 | ralbidv | |
8 | breq2 | |
|
9 | 7 8 | imbi12d | |
10 | 9 | rspccva | |
11 | 5 10 | stoic3 | |