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 18422

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 482	. 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → 𝐾 ∈ CLat)
5	1, 3	clatglbcl2 18412	. 2 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → 𝑆 ∈ dom 𝐺)
6	1, 2, 3, 4, 5	glbprop 18275	1 ⊢ ((𝐾 ∈ CLat ∧ 𝑆 ⊆ 𝐵) → (∀𝑦 ∈ 𝑆 (𝐺‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝐺‘𝑆))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ⊆ wss 3897 class class class wbr 5089 ‘cfv 6481 Basecbs 17120 lecple 17168 glbcglb 18216 CLatccla 18404

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-glb 18251 df-clat 18405

This theorem is referenced by: clatleglb 18424

W3C validator