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 18451

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

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3911 class class class wbr 5102 ‘cfv 6499 Basecbs 17155 lecple 17203 glbcglb 18247 CLatccla 18433

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-glb 18282 df-clat 18434

This theorem is referenced by: clatleglb 18453

W3C validator