| 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 2763 | . . 3 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 2 | eqid 2763 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | eqid 2763 | . . 3 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 4 | 1, 2, 3 | isdlat 18746 | . 2 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(meet‘𝐾)(𝑦(join‘𝐾)𝑧)) = ((𝑥(meet‘𝐾)𝑦)(join‘𝐾)(𝑥(meet‘𝐾)𝑧)))) |
| 5 | 4 | simplbi 502 | 1 ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 joincjn 18535 meetcmee 18536 Latclat 18655 DLatcdlat 18744 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-nul 5266 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-iota 6520 df-fv 6574 df-ov 7454 df-dlat 18745 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |