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

Theorem isclat 17109
Description: The predicate "is a complete lattice." (Contributed by NM, 18-Oct-2012.) (Revised by NM, 12-Sep-2018.)
Hypotheses
Ref Expression
isclat.b 𝐵 = (Base‘𝐾)
isclat.u 𝑈 = (lub‘𝐾)
isclat.g 𝐺 = (glb‘𝐾)
Assertion
Ref Expression
isclat (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom 𝑈 = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))

Proof of Theorem isclat
Dummy variable 𝑙 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6191 . . . . . 6 (𝑙 = 𝐾 → (lub‘𝑙) = (lub‘𝐾))
2 isclat.u . . . . . 6 𝑈 = (lub‘𝐾)
31, 2syl6eqr 2674 . . . . 5 (𝑙 = 𝐾 → (lub‘𝑙) = 𝑈)
43dmeqd 5326 . . . 4 (𝑙 = 𝐾 → dom (lub‘𝑙) = dom 𝑈)
5 fveq2 6191 . . . . . 6 (𝑙 = 𝐾 → (Base‘𝑙) = (Base‘𝐾))
6 isclat.b . . . . . 6 𝐵 = (Base‘𝐾)
75, 6syl6eqr 2674 . . . . 5 (𝑙 = 𝐾 → (Base‘𝑙) = 𝐵)
87pweqd 4163 . . . 4 (𝑙 = 𝐾 → 𝒫 (Base‘𝑙) = 𝒫 𝐵)
94, 8eqeq12d 2637 . . 3 (𝑙 = 𝐾 → (dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ↔ dom 𝑈 = 𝒫 𝐵))
10 fveq2 6191 . . . . . 6 (𝑙 = 𝐾 → (glb‘𝑙) = (glb‘𝐾))
11 isclat.g . . . . . 6 𝐺 = (glb‘𝐾)
1210, 11syl6eqr 2674 . . . . 5 (𝑙 = 𝐾 → (glb‘𝑙) = 𝐺)
1312dmeqd 5326 . . . 4 (𝑙 = 𝐾 → dom (glb‘𝑙) = dom 𝐺)
1413, 8eqeq12d 2637 . . 3 (𝑙 = 𝐾 → (dom (glb‘𝑙) = 𝒫 (Base‘𝑙) ↔ dom 𝐺 = 𝒫 𝐵))
159, 14anbi12d 747 . 2 (𝑙 = 𝐾 → ((dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ∧ dom (glb‘𝑙) = 𝒫 (Base‘𝑙)) ↔ (dom 𝑈 = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))
16 df-clat 17108 . 2 CLat = {𝑙 ∈ Poset ∣ (dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ∧ dom (glb‘𝑙) = 𝒫 (Base‘𝑙))}
1715, 16elrab2 3366 1 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom 𝑈 = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 196  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:  clatpos  17110  clatlem  17111  clatlubcl2  17113  clatglbcl2  17115  clatl  17116  oduclatb  17144  xrsclat  29680
  Copyright terms: Public domain W3C validator