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

Theorem clatglbcl2 18521
Description: Any subset of the base set has a GLB in a complete lattice. (Contributed by NM, 13-Sep-2018.)
Hypotheses
Ref Expression
clatglbcl.b 𝐵 = (Base‘𝐾)
clatglbcl.g 𝐺 = (glb‘𝐾)
Assertion
Ref Expression
clatglbcl2 ((𝐾 ∈ CLat ∧ 𝑆𝐵) → 𝑆 ∈ dom 𝐺)

Proof of Theorem clatglbcl2
StepHypRef Expression
1 clatglbcl.b . . . . . 6 𝐵 = (Base‘𝐾)
21fvexi 6900 . . . . 5 𝐵 ∈ V
32elpw2 5314 . . . 4 (𝑆 ∈ 𝒫 𝐵𝑆𝐵)
43biimpri 228 . . 3 (𝑆𝐵𝑆 ∈ 𝒫 𝐵)
54adantl 481 . 2 ((𝐾 ∈ CLat ∧ 𝑆𝐵) → 𝑆 ∈ 𝒫 𝐵)
6 eqid 2734 . . . . 5 (lub‘𝐾) = (lub‘𝐾)
7 clatglbcl.g . . . . 5 𝐺 = (glb‘𝐾)
81, 6, 7isclat 18515 . . . 4 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))
9 simprr 772 . . . 4 ((𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)) → dom 𝐺 = 𝒫 𝐵)
108, 9sylbi 217 . . 3 (𝐾 ∈ CLat → dom 𝐺 = 𝒫 𝐵)
1110adantr 480 . 2 ((𝐾 ∈ CLat ∧ 𝑆𝐵) → dom 𝐺 = 𝒫 𝐵)
125, 11eleqtrrd 2836 1 ((𝐾 ∈ CLat ∧ 𝑆𝐵) → 𝑆 ∈ dom 𝐺)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  wss 3931  𝒫 cpw 4580  dom cdm 5665  cfv 6541  Basecbs 17230  Posetcpo 18324  lubclub 18326  glbcglb 18327  CLatccla 18513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706  ax-sep 5276  ax-nul 5286
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ne 2932  df-rab 3420  df-v 3465  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-br 5124  df-dm 5675  df-iota 6494  df-fv 6549  df-clat 18514
This theorem is referenced by:  isglbd  18524  clatglb  18531  clatglble  18532  glbconN  39353
  Copyright terms: Public domain W3C validator