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

Theorem clatpos 18593
Description: A complete lattice is a poset. (Contributed by NM, 8-Sep-2018.)
Assertion
Ref Expression
clatpos (𝐾 ∈ CLat → 𝐾 ∈ Poset)

Proof of Theorem clatpos
StepHypRef Expression
1 eqid 2762 . . 3 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2762 . . 3 (lub‘𝐾) = (lub‘𝐾)
3 eqid 2762 . . 3 (glb‘𝐾) = (glb‘𝐾)
41, 2, 3isclat 18592 . 2 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))))
54simplbi 502 1 (𝐾 ∈ CLat → 𝐾 ∈ Poset)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  𝒫 cpw 4560  dom cdm 5659  cfv 6537  Basecbs 17305  Posetcpo 18399  lubclub 18401  glbcglb 18402  CLatccla 18590
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 2147  ax-9 2155  ax-ext 2734
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-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-dm 5669  df-iota 6493  df-fv 6545  df-clat 18591
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator