Theorem glbelss 18443

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 18442	. . 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 2146  ∀wral 3081  ∃!wreu 3369   ⊆ wss 3906   class class class wbr 5111  dom cdm 5663  ‘cfv 6540  Basecbs 17291  lecple 17339  glbcglb 18388

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-glb 18423

This theorem is used by:  glbcl  18446  glbprop  18447  meetfval  18463  meetdmss  18469  glbsscl  49796