Metamath Proof Explorer


Theorem lubl

Description: The LUB of a complete lattice subset is the least bound. (Contributed by NM, 19-Oct-2011)

Ref Expression
Hypotheses lublem.b ⊢ B = Base K
lublem.l ⊢ ≤ ˙ = ≤ K
lublem.u ⊢ U = lub ⁡ K
Assertion lubl ⊢ K ∈ CLat ∧ S ⊆ B ∧ X ∈ B → ∀ y ∈ S y ≤ ˙ X → U ⁡ S ≤ ˙ X

Proof

Step Hyp Ref Expression
1 lublem.b ⊢ B = Base K
2 lublem.l ⊢ ≤ ˙ = ≤ K
3 lublem.u ⊢ U = lub ⁡ K
4 1 2 3 lublem ⊢ K ∈ CLat ∧ S ⊆ B → ∀ y ∈ S y ≤ ˙ U ⁡ S ∧ ∀ z ∈ B ∀ y ∈ S y ≤ ˙ z → U ⁡ S ≤ ˙ z
5 4 simprd ⊢ K ∈ CLat ∧ S ⊆ B → ∀ z ∈ B ∀ y ∈ S y ≤ ˙ z → U ⁡ S ≤ ˙ z
6 breq2 ⊢ z = X → y ≤ ˙ z ↔ y ≤ ˙ X
7 6 ralbidv ⊢ z = X → ∀ y ∈ S y ≤ ˙ z ↔ ∀ y ∈ S y ≤ ˙ X
8 breq2 ⊢ z = X → U ⁡ S ≤ ˙ z ↔ U ⁡ S ≤ ˙ X
9 7 8 imbi12d ⊢ z = X → ∀ y ∈ S y ≤ ˙ z → U ⁡ S ≤ ˙ z ↔ ∀ y ∈ S y ≤ ˙ X → U ⁡ S ≤ ˙ X
10 9 rspccva ⊢ ∀ z ∈ B ∀ y ∈ S y ≤ ˙ z → U ⁡ S ≤ ˙ z ∧ X ∈ B → ∀ y ∈ S y ≤ ˙ X → U ⁡ S ≤ ˙ X
11 5 10 stoic3 ⊢ K ∈ CLat ∧ S ⊆ B ∧ X ∈ B → ∀ y ∈ S y ≤ ˙ X → U ⁡ S ≤ ˙ X