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

Theorem isclat 17702
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 6656 . . . . . 6 (𝑙 = 𝐾 → (lub‘𝑙) = (lub‘𝐾))
2 isclat.u . . . . . 6 𝑈 = (lub‘𝐾)
31, 2syl6eqr 2874 . . . . 5 (𝑙 = 𝐾 → (lub‘𝑙) = 𝑈)
43dmeqd 5760 . . . 4 (𝑙 = 𝐾 → dom (lub‘𝑙) = dom 𝑈)
5 fveq2 6656 . . . . . 6 (𝑙 = 𝐾 → (Base‘𝑙) = (Base‘𝐾))
6 isclat.b . . . . . 6 𝐵 = (Base‘𝐾)
75, 6syl6eqr 2874 . . . . 5 (𝑙 = 𝐾 → (Base‘𝑙) = 𝐵)
87pweqd 4544 . . . 4 (𝑙 = 𝐾 → 𝒫 (Base‘𝑙) = 𝒫 𝐵)
94, 8eqeq12d 2837 . . 3 (𝑙 = 𝐾 → (dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ↔ dom 𝑈 = 𝒫 𝐵))
10 fveq2 6656 . . . . . 6 (𝑙 = 𝐾 → (glb‘𝑙) = (glb‘𝐾))
11 isclat.g . . . . . 6 𝐺 = (glb‘𝐾)
1210, 11syl6eqr 2874 . . . . 5 (𝑙 = 𝐾 → (glb‘𝑙) = 𝐺)
1312dmeqd 5760 . . . 4 (𝑙 = 𝐾 → dom (glb‘𝑙) = dom 𝐺)
1413, 8eqeq12d 2837 . . 3 (𝑙 = 𝐾 → (dom (glb‘𝑙) = 𝒫 (Base‘𝑙) ↔ dom 𝐺 = 𝒫 𝐵))
159, 14anbi12d 632 . 2 (𝑙 = 𝐾 → ((dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ∧ dom (glb‘𝑙) = 𝒫 (Base‘𝑙)) ↔ (dom 𝑈 = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))
16 df-clat 17701 . 2 CLat = {𝑙 ∈ Poset ∣ (dom (lub‘𝑙) = 𝒫 (Base‘𝑙) ∧ dom (glb‘𝑙) = 𝒫 (Base‘𝑙))}
1715, 16elrab2 3674 1 (𝐾 ∈ CLat ↔ (𝐾 ∈ Poset ∧ (dom 𝑈 = 𝒫 𝐵 ∧ dom 𝐺 = 𝒫 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398   = wceq 1537  wcel 2114  𝒫 cpw 4525  dom cdm 5541  cfv 6341  Basecbs 16466  Posetcpo 17533  lubclub 17535  glbcglb 17536  CLatccla 17700
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3488  df-dif 3927  df-un 3929  df-in 3931  df-ss 3940  df-nul 4280  df-if 4454  df-pw 4527  df-sn 4554  df-pr 4556  df-op 4560  df-uni 4825  df-br 5053  df-dm 5551  df-iota 6300  df-fv 6349  df-clat 17701
This theorem is referenced by:  clatpos  17703  clatlem  17704  clatlubcl2  17706  clatglbcl2  17708  clatl  17709  oduclatb  17737  xrsclat  30674
  Copyright terms: Public domain W3C validator