Theorem glble 17000

Description: The greatest lower bound is the least element. (Contributed by NM, 22-Oct-2011.) (Revised by NM, 7-Sep-2018.)

Hypotheses

Ref	Expression
glbprop.b	⊢ 𝐵 = (Base‘𝐾)
glbprop.l	⊢ ≤ = (le‘𝐾)
glbprop.u	⊢ 𝑈 = (glb‘𝐾)
glbprop.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
glbprop.s	⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
glble.x	⊢ (𝜑 → 𝑋 ∈ 𝑆)

Assertion

Ref	Expression
glble	⊢ (𝜑 → (𝑈‘𝑆) ≤ 𝑋)

Proof of Theorem glble

Dummy variables 𝑧 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		glbprop.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		glbprop.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		glbprop.u	. . . 4 ⊢ 𝑈 = (glb‘𝐾)
4		glbprop.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
5		glbprop.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
6	1, 2, 3, 4, 5	glbprop 16999	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))
7	6	simpld 475	. 2 ⊢ (𝜑 → ∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦)
8		glble.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
9		breq2 4657	. . 3 ⊢ (𝑦 = 𝑋 → ((𝑈‘𝑆) ≤ 𝑦 ↔ (𝑈‘𝑆) ≤ 𝑋))
10	9	rspccva 3308	. 2 ⊢ ((∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ 𝑋 ∈ 𝑆) → (𝑈‘𝑆) ≤ 𝑋)
11	7, 8, 10	syl2anc 693	1 ⊢ (𝜑 → (𝑈‘𝑆) ≤ 𝑋)

Syntax hints:   → wi 4   = wceq 1483   ∈ wcel 1990  ∀wral 2912   class class class wbr 4653  dom cdm 5114  ‘cfv 5888  Basecbs 15857  lecple 15948  glbcglb 16943

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-glb 16975

This theorem is referenced by:  p0le  17043  clatglble  17125