clatglb - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > clatglb		Structured version Visualization version GIF version

Theorem clatglb 18572

Description: Properties of greatest lower bound of a complete lattice. (Contributed by NM, 5-Dec-2011.)

**Hypotheses**
Ref	Expression
clatglb.b	⊢ 𝐵 = (Base‘𝐾)
clatglb.l	⊢ ≤ = (le‘𝐾)
clatglb.g	⊢ 𝐺 = (glb‘𝐾)

**Assertion**
Ref	Expression
clatglb	⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → (∀𝑦 ∈ 𝑆 (𝐺‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝐺‘𝑆))))

Distinct variable groups: 𝑦,𝑧,𝐵 𝑦,𝐺,𝑧 𝑦,𝐾,𝑧 𝑦, ≤ ,𝑧 𝑦,𝑆,𝑧

**Proof of Theorem clatglb**
Step	Hyp	Ref	Expression
1		clatglb.b	. 2 ⊢ 𝐵 = (Base‘𝐾)
2		clatglb.l	. 2 ⊢ ≤ = (le‘𝐾)
3		clatglb.g	. 2 ⊢ 𝐺 = (glb‘𝐾)
4		simpl 487	. 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → 𝐾 ∈ CLat)
5	1, 3	clatglbcl2 18562	. 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → 𝑆 ∈ dom 𝐺)
6	1, 2, 3, 4, 5	glbprop 18425	1 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → (∀𝑦 ∈ 𝑆 (𝐺‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝐺‘𝑆))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 class class class wbr 5113 ‘cfv 6537 Basecbs 17269 lecple 17317 glbcglb 18366 CLatccla 18554

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-glb 18401 df-clat 18555

This theorem is referenced by: clatleglb 18574

W3C validator