Metamath Proof Explorer


Theorem chlubi

Description: Hilbert lattice join is the least upper bound of two elements. (Contributed by NM, 11-Jun-2004) (New usage is discouraged.)

Ref Expression
Hypotheses ch0le.1 ⊢ A ∈ C ℋ
chjcl.2 ⊢ B ∈ C ℋ
chlub.1 ⊢ C ∈ C ℋ
Assertion chlubi ⊢ A ⊆ C ∧ B ⊆ C ↔ A ∨ ℋ B ⊆ C

Proof

Step Hyp Ref Expression
1 ch0le.1 ⊢ A ∈ C ℋ
2 chjcl.2 ⊢ B ∈ C ℋ
3 chlub.1 ⊢ C ∈ C ℋ
4 1 chshii ⊢ A ∈ S ℋ
5 2 chshii ⊢ B ∈ S ℋ
6 4 5 3 shlubi ⊢ A ⊆ C ∧ B ⊆ C ↔ A ∨ ℋ B ⊆ C