Theorem dlatl 18132

Description: A distributive lattice is a lattice. (Contributed by Stefan O'Rear, 30-Jan-2015.)

Assertion

Ref	Expression
dlatl	⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat)

Proof of Theorem dlatl

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2739	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2739	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
3		eqid 2739	. . 3 ⊢ (meet‘𝐾) = (meet‘𝐾)
4	1, 2, 3	isdlat 18130	. 2 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(meet‘𝐾)(𝑦(join‘𝐾)𝑧)) = ((𝑥(meet‘𝐾)𝑦)(join‘𝐾)(𝑥(meet‘𝐾)𝑧))))
5	4	simplbi 501	1 ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat)

Syntax hints:   → wi 4   = wceq 1543   ∈ wcel 2112  ∀wral 3064  ‘cfv 6415  (class class class)co 7252  Basecbs 16815  joincjn 17919  meetcmee 17920  Latclat 18039  DLatcdlat 18128

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2710  ax-nul 5223

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2818  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3425  df-sbc 3713  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4255  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-iota 6373  df-fv 6423  df-ov 7255  df-dlat 18129

This theorem is referenced by: (None)