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

Theorem dlatl 17195
Description: A distributive lattice is a lattice. (Contributed by Stefan O'Rear, 30-Jan-2015.)
Assertion
Ref Expression
dlatl  |-  ( K  e. DLat  ->  K  e.  Lat )

Proof of Theorem dlatl
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2622 . . 3  |-  ( Base `  K )  =  (
Base `  K )
2 eqid 2622 . . 3  |-  ( join `  K )  =  (
join `  K )
3 eqid 2622 . . 3  |-  ( meet `  K )  =  (
meet `  K )
41, 2, 3isdlat 17193 . 2  |-  ( K  e. DLat 
<->  ( K  e.  Lat  /\ 
A. x  e.  (
Base `  K ) A. y  e.  ( Base `  K ) A. z  e.  ( Base `  K ) ( x ( meet `  K
) ( y (
join `  K )
z ) )  =  ( ( x (
meet `  K )
y ) ( join `  K ) ( x ( meet `  K
) z ) ) ) )
54simplbi 476 1  |-  ( K  e. DLat  ->  K  e.  Lat )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1483    e. wcel 1990   A.wral 2912   ` cfv 5888  (class class class)co 6650   Basecbs 15857   joincjn 16944   meetcmee 16945   Latclat 17045  DLatcdlat 17191
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  ax-nul 4789
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-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-dlat 17192
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator