Theorem dlatmjdi 18614

Description: In a distributive lattice, meets distribute over joins. (Contributed by Stefan O'Rear, 30-Jan-2015.)

Hypotheses

Ref	Expression
isdlat.b	⊢ 𝐵 = (Base‘𝐾)
isdlat.j	⊢ ∨ = (join‘𝐾)
isdlat.m	⊢ ∧ = (meet‘𝐾)

Assertion

Ref	Expression
dlatmjdi	⊢ ((𝐾 ∈ DLat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ∧ (𝑌 ∨ 𝑍)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑍)))

Proof of Theorem dlatmjdi

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

Step	Hyp	Ref	Expression
1		isdlat.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		isdlat.j	. . . 4 ⊢ ∨ = (join‘𝐾)
3		isdlat.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
4	1, 2, 3	isdlat 18613	. . 3 ⊢ (𝐾 ∈ DLat ↔ (𝐾 ∈ Lat ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ∧ (𝑦 ∨ 𝑧)) = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ 𝑧))))
5	4	simprbi 503	. 2 ⊢ (𝐾 ∈ DLat → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ∧ (𝑦 ∨ 𝑧)) = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ 𝑧)))
6		oveq1 7421	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∧ (𝑦 ∨ 𝑧)) = (𝑋 ∧ (𝑦 ∨ 𝑧)))
7		oveq1 7421	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ∧ 𝑦) = (𝑋 ∧ 𝑦))
8		oveq1 7421	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 ∧ 𝑧) = (𝑋 ∧ 𝑧))
9	7, 8	oveq12d 7432	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ 𝑧)) = ((𝑋 ∧ 𝑦) ∨ (𝑋 ∧ 𝑧)))
10	6, 9	eqeq12d 2776	. . 3 ⊢ (𝑥 = 𝑋 → ((𝑥 ∧ (𝑦 ∨ 𝑧)) = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ 𝑧)) ↔ (𝑋 ∧ (𝑦 ∨ 𝑧)) = ((𝑋 ∧ 𝑦) ∨ (𝑋 ∧ 𝑧))))
11		oveq1 7421	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑦 ∨ 𝑧) = (𝑌 ∨ 𝑧))
12	11	oveq2d 7430	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋 ∧ (𝑦 ∨ 𝑧)) = (𝑋 ∧ (𝑌 ∨ 𝑧)))
13		oveq2 7422	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑋 ∧ 𝑦) = (𝑋 ∧ 𝑌))
14	13	oveq1d 7429	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝑋 ∧ 𝑦) ∨ (𝑋 ∧ 𝑧)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑧)))
15	12, 14	eqeq12d 2776	. . 3 ⊢ (𝑦 = 𝑌 → ((𝑋 ∧ (𝑦 ∨ 𝑧)) = ((𝑋 ∧ 𝑦) ∨ (𝑋 ∧ 𝑧)) ↔ (𝑋 ∧ (𝑌 ∨ 𝑧)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑧))))
16		oveq2 7422	. . . . 5 ⊢ (𝑧 = 𝑍 → (𝑌 ∨ 𝑧) = (𝑌 ∨ 𝑍))
17	16	oveq2d 7430	. . . 4 ⊢ (𝑧 = 𝑍 → (𝑋 ∧ (𝑌 ∨ 𝑧)) = (𝑋 ∧ (𝑌 ∨ 𝑍)))
18		oveq2 7422	. . . . 5 ⊢ (𝑧 = 𝑍 → (𝑋 ∧ 𝑧) = (𝑋 ∧ 𝑍))
19	18	oveq2d 7430	. . . 4 ⊢ (𝑧 = 𝑍 → ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑧)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑍)))
20	17, 19	eqeq12d 2776	. . 3 ⊢ (𝑧 = 𝑍 → ((𝑋 ∧ (𝑌 ∨ 𝑧)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑧)) ↔ (𝑋 ∧ (𝑌 ∨ 𝑍)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑍))))
21	10, 15, 20	rspc3v 3592	. 2 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝑥 ∧ (𝑦 ∨ 𝑧)) = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ 𝑧)) → (𝑋 ∧ (𝑌 ∨ 𝑍)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑍))))
22	5, 21	mpan9 516	1 ⊢ ((𝐾 ∈ DLat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ∧ (𝑌 ∨ 𝑍)) = ((𝑋 ∧ 𝑌) ∨ (𝑋 ∧ 𝑍)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  joincjn 18402  meetcmee 18403  Latclat 18522  DLatcdlat 18611

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 2147  ax-9 2155  ax-ext 2732  ax-nul 5263

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 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541  df-ov 7417  df-dlat 18612

This theorem is used by:  dlatjmdi  18617