pmodlem2 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmodlem2		Structured version Visualization version GIF version

Theorem pmodlem2 40435

Description: Lemma for pmod1i 40436. (Contributed by NM, 9-Mar-2012.)

**Hypotheses**
Ref	Expression
pmodlem.l	⊢ ≤ = (le‘𝐾)
pmodlem.j	⊢ ∨ = (join‘𝐾)
pmodlem.a	⊢ 𝐴 = (Atoms‘𝐾)
pmodlem.s	⊢ 𝑆 = (PSubSp‘𝐾)
pmodlem.p	⊢ + = (+_𝑃‘𝐾)

**Assertion**
Ref	Expression
pmodlem2	⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))

Proof of Theorem pmodlem2 Dummy variables 𝑞 𝑝 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 488	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑋 = ∅)
2	1	oveq1d 7407	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑋 + 𝑌) = (∅ + 𝑌))
3		simpl1 1204	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝐾 ∈ HL)
4		simpl22 1265	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑌 ⊆ 𝐴)
5		pmodlem.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
6		pmodlem.p	. . . . . . 7 ⊢ + = (+_𝑃‘𝐾)
7	5, 6	padd02 40400	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → (∅ + 𝑌) = 𝑌)
8	3, 4, 7	syl2anc 593	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (∅ + 𝑌) = 𝑌)
9	2, 8	eqtrd 2796	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑋 + 𝑌) = 𝑌)
10	9	ineq1d 4171	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑌 ∩ 𝑍))
11		ssinss1 4197	. . . . 5 ⊢ (𝑌 ⊆ 𝐴 → (𝑌 ∩ 𝑍) ⊆ 𝐴)
12	4, 11	syl 17	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ 𝐴)
13		simpl21 1264	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑋 ⊆ 𝐴)
14	5, 6	sspadd2 40404	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
15	3, 12, 13, 14	syl3anc 1389	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
16	10, 15	eqsstrd 3970	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
17		oveq2 7400	. . . . 5 ⊢ (𝑌 = ∅ → (𝑋 + 𝑌) = (𝑋 + ∅))
18		simp1 1148	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝐾 ∈ HL)
19		simp21 1219	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ⊆ 𝐴)
20	5, 6	padd01 40399	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 + ∅) = 𝑋)
21	18, 19, 20	syl2anc 593	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑋 + ∅) = 𝑋)
22	17, 21	sylan9eqr 2818	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 + 𝑌) = 𝑋)
23	22	ineq1d 4171	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑋 ∩ 𝑍))
24		inss1 4188	. . . 4 ⊢ (𝑋 ∩ 𝑍) ⊆ 𝑋
25		simpl1 1204	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝐾 ∈ HL)
26		simpl21 1264	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑋 ⊆ 𝐴)
27		simpl22 1265	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑌 ⊆ 𝐴)
28	27, 11	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑌 ∩ 𝑍) ⊆ 𝐴)
29	5, 6	sspadd1 40403	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
30	25, 26, 28, 29	syl3anc 1389	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
31	24, 30	sstrid 3947	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
32	23, 31	eqsstrd 3970	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
33		elin 3920	. . . 4 ⊢ (𝑝 ∈ ((𝑋 + 𝑌) ∩ 𝑍) ↔ (𝑝 ∈ (𝑋 + 𝑌) ∧ 𝑝 ∈ 𝑍))
34		simpl1 1204	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝐾 ∈ HL)
35	34	hllatd 39952	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝐾 ∈ Lat)
36		simpl21 1264	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝑋 ⊆ 𝐴)
37		simpl22 1265	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝑌 ⊆ 𝐴)
38		simprl 780	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅))
39		pmodlem.l	. . . . . . . . . 10 ⊢ ≤ = (le‘𝐾)
40		pmodlem.j	. . . . . . . . . 10 ⊢ ∨ = (join‘𝐾)
41	39, 40, 5, 6	elpaddn0 40388	. . . . . . . . 9 ⊢ (((𝐾 ∈ Lat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → (𝑝 ∈ (𝑋 + 𝑌) ↔ (𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟))))
42	35, 36, 37, 38, 41	syl31anc 1391	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑝 ∈ (𝑋 + 𝑌) ↔ (𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟))))
43		simpl1 1204	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝐾 ∈ HL)
44		simpl21 1264	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑋 ⊆ 𝐴)
45		simpl22 1265	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑌 ⊆ 𝐴)
46		simpl23 1266	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑍 ∈ 𝑆)
47		simpl3 1206	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑋 ⊆ 𝑍)
48		simpr1 1207	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ 𝑍)
49		simpr2l 1245	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑞 ∈ 𝑋)
50		simpr2r 1246	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑟 ∈ 𝑌)
51		simpr3 1209	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ≤ (𝑞 ∨ 𝑟))
52		pmodlem.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (PSubSp‘𝐾)
53	39, 40, 5, 52, 6	pmodlem1 40434	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑍 ∈ 𝑆 ∧ 𝑋 ⊆ 𝑍 ∧ 𝑝 ∈ 𝑍) ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌 ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
54	43, 44, 45, 46, 47, 48, 49, 50, 51, 53	syl333anc 1420	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
55	54	3exp2 1367	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑝 ∈ 𝑍 → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
56	55	imp 410	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))))
57	56	rexlimdvv 3217	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
58	57	adantld 494	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → ((𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
59	58	adantrl 726	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → ((𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
60	42, 59	sylbid 242	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑝 ∈ (𝑋 + 𝑌) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
61	60	exp32 424	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) → (𝑝 ∈ 𝑍 → (𝑝 ∈ (𝑋 + 𝑌) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
62	61	com34 91	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) → (𝑝 ∈ (𝑋 + 𝑌) → (𝑝 ∈ 𝑍 → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
63	62	imp4b 425	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑝 ∈ (𝑋 + 𝑌) ∧ 𝑝 ∈ 𝑍) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
64	33, 63	biimtrid 244	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → (𝑝 ∈ ((𝑋 + 𝑌) ∩ 𝑍) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
65	64	ssrdv 3942	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
66	16, 32, 65	pm2.61da2ne 3044	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∃wrex 3085 ∩ cin 3903 ⊆ wss 3904 ∅c0 4285 class class class wbr 5099 ‘cfv 6517 (class class class)co 7392 lecple 17276 joincjn 18326 Latclat 18446 Atomscatm 39851 HLchlt 39938 PSubSpcpsubsp 40084 +_𝑃cpadd 40383

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-1st 7966 df-2nd 7967 df-proset 18309 df-poset 18328 df-plt 18343 df-lub 18359 df-glb 18360 df-join 18361 df-meet 18362 df-p0 18438 df-lat 18447 df-covers 39854 df-ats 39855 df-atl 39886 df-cvlat 39910 df-hlat 39939 df-psubsp 40091 df-padd 40384

This theorem is referenced by: pmod1i 40436

W3C validator