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

Theorem clatpos 17110
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 2622 . . 3 (Base‘𝐾) = (Base‘𝐾)
2 eqid 2622 . . 3 (lub‘𝐾) = (lub‘𝐾)
3 eqid 2622 . . 3 (glb‘𝐾) = (glb‘𝐾)
41, 2, 3isclat 17109 . 2 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom (lub‘𝐾) = 𝒫 (Base‘𝐾) ∧ dom (glb‘𝐾) = 𝒫 (Base‘𝐾))))
54simplbi 476 1 (𝐾 ∈ CLat → 𝐾 ∈ Poset)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  𝒫 cpw 4158  dom cdm 5114  cfv 5888  Basecbs 15857  Posetcpo 16940  lubclub 16942  glbcglb 16943  CLatccla 17107
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-dm 5124  df-iota 5851  df-fv 5896  df-clat 17108
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator