Theorem glbelss 18453

Description: A member of the domain of the greatest lower bound function is a subset of the base set. (Contributed by NM, 7-Sep-2018.)

Hypotheses

Ref	Expression
glbs.b	⊢ 𝐵 = (Base‘𝐾)
glbs.l	⊢ ≤ = (le‘𝐾)
glbs.g	⊢ 𝐺 = (glb‘𝐾)
glbs.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
glbs.s	⊢ (𝜑 → 𝑆 ∈ dom 𝐺)

Assertion

Ref	Expression
glbelss	⊢ (𝜑 → 𝑆 ⊆ 𝐵)

Proof of Theorem glbelss

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

Step	Hyp	Ref	Expression
1		glbs.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ dom 𝐺)
2		glbs.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
3		glbs.l	. . . 4 ⊢ ≤ = (le‘𝐾)
4		glbs.g	. . . 4 ⊢ 𝐺 = (glb‘𝐾)
5		biid 264	. . . 4 ⊢ ((∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
6		glbs.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
7	2, 3, 4, 5, 6	glbeldm 18452	. . 3 ⊢ (𝜑 → (𝑆 ∈ dom 𝐺 ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))))
8	1, 7	mpbid 235	. 2 ⊢ (𝜑 → (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))))
9	8	simpld 500	1 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃!wreu 3363   ⊆ wss 3899   class class class wbr 5103  dom cdm 5655  ‘cfv 6533  Basecbs 17301  lecple 17349  glbcglb 18398

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-glb 18433

This theorem is used by:  glbcl  18456  glbprop  18457  meetfval  18473  meetdmss  18479  glbsscl  49887