Theorem dlatl 18606

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 2765	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2765	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
3		eqid 2765	. . 3 ⊢ (meet‘𝐾) = (meet‘𝐾)
4	1, 2, 3	isdlat 18604	. 2 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)∀𝑧 ∈ (Base‘𝐾)(𝑥(meet‘𝐾)(𝑦(join‘𝐾)𝑧)) = ((𝑥(meet‘𝐾)𝑦)(join‘𝐾)(𝑥(meet‘𝐾)𝑧))))
5	4	simplbi 502	1 ⊢ (𝐾 ∈ DLat → 𝐾 ∈ Lat)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7419  Basecbs 17295  joincjn 18393  meetcmee 18394  Latclat 18513  DLatcdlat 18602

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-nul 5271

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-dlat 18603

This theorem is used by: (None)