| 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 2769 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 2 | eqid 2769 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | eqid 2769 | . . 3 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 4 | 1, 2, 3 | isdlat 18578 | . 2 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(meet‘𝐾)(𝑦(join‘𝐾)𝑧)) = ((𝑥(meet‘𝐾)𝑦)(join‘𝐾)(𝑥(meet‘𝐾)𝑧)))) |
| 5 | 4 | simplbi 501 | 1 ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 joincjn 18367 meetcmee 18368 Latclat 18487 DLatcdlat 18576 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-nul 5271 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-ov 7414 df-dlat 18577 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |