| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dlatl | Structured version Visualization version GIF version | ||
| Description: A distributive lattice is a lattice. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
| Ref | Expression |
|---|---|
| dlatl | ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 2 | eqid 2737 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | eqid 2737 | . . 3 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 4 | 1, 2, 3 | isdlat 18482 | . 2 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(meet‘𝐾)(𝑦(join‘𝐾)𝑧)) = ((𝑥(meet‘𝐾)𝑦)(join‘𝐾)(𝑥(meet‘𝐾)𝑧)))) |
| 5 | 4 | simplbi 496 | 1 ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ‘cfv 6493 (class class class)co 7361 Basecbs 17173 joincjn 18271 meetcmee 18272 Latclat 18391 DLatcdlat 18480 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-nul 5242 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-iota 6449 df-fv 6501 df-ov 7364 df-dlat 18481 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |