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 40654

Description: Lemma for pmod1i 40655. (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 490	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑋 = ∅)
2	1	oveq1d 7431	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑋 + 𝑌) = (∅ + 𝑌))
3		simpl1 1210	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝐾 ∈ HL)
4		simpl22 1271	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑌 ⊆ 𝐴)
5		pmodlem.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
6		pmodlem.p	. . . . . . 7 ⊢ + = (+_𝑃‘𝐾)
7	5, 6	padd02 40619	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → (∅ + 𝑌) = 𝑌)
8	3, 4, 7	syl2anc 596	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (∅ + 𝑌) = 𝑌)
9	2, 8	eqtrd 2800	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑋 + 𝑌) = 𝑌)
10	9	ineq1d 4172	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑌 ∩ 𝑍))
11		ssinss1 4198	. . . . 5 ⊢ (𝑌 ⊆ 𝐴 → (𝑌 ∩ 𝑍) ⊆ 𝐴)
12	4, 11	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ 𝐴)
13		simpl21 1270	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑋 ⊆ 𝐴)
14	5, 6	sspadd2 40623	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
15	3, 12, 13, 14	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
16	10, 15	eqsstrd 3972	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
17		oveq2 7424	. . . . 5 ⊢ (𝑌 = ∅ → (𝑋 + 𝑌) = (𝑋 + ∅))
18		simp1 1154	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝐾 ∈ HL)
19		simp21 1225	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ⊆ 𝐴)
20	5, 6	padd01 40618	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 + ∅) = 𝑋)
21	18, 19, 20	syl2anc 596	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑋 + ∅) = 𝑋)
22	17, 21	sylan9eqr 2822	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 + 𝑌) = 𝑋)
23	22	ineq1d 4172	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑋 ∩ 𝑍))
24		inss1 4189	. . . 4 ⊢ (𝑋 ∩ 𝑍) ⊆ 𝑋
25		simpl1 1210	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝐾 ∈ HL)
26		simpl21 1270	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑋 ⊆ 𝐴)
27		simpl22 1271	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑌 ⊆ 𝐴)
28	27, 11	syl 18	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑌 ∩ 𝑍) ⊆ 𝐴)
29	5, 6	sspadd1 40622	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
30	25, 26, 28, 29	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
31	24, 30	sstrid 3949	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
32	23, 31	eqsstrd 3972	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
33		elin 3922	. . . 4 ⊢ (𝑝 ∈ ((𝑋 + 𝑌) ∩ 𝑍) ↔ (𝑝 ∈ (𝑋 + 𝑌) ∧ 𝑝 ∈ 𝑍))
34		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝐾 ∈ HL)
35	34	hllatd 40171	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝐾 ∈ Lat)
36		simpl21 1270	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝑋 ⊆ 𝐴)
37		simpl22 1271	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝑌 ⊆ 𝐴)
38		simprl 783	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅))
39		pmodlem.l	. . . . . . . . . 10 ⊢ ≤ = (le‘𝐾)
40		pmodlem.j	. . . . . . . . . 10 ⊢ ∨ = (join‘𝐾)
41	39, 40, 5, 6	elpaddn0 40607	. . . . . . . . 9 ⊢ (((𝐾 ∈ Lat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → (𝑝 ∈ (𝑋 + 𝑌) ↔ (𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟))))
42	35, 36, 37, 38, 41	syl31anc 1400	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑝 ∈ (𝑋 + 𝑌) ↔ (𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟))))
43		simpl1 1210	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝐾 ∈ HL)
44		simpl21 1270	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑋 ⊆ 𝐴)
45		simpl22 1271	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑌 ⊆ 𝐴)
46		simpl23 1272	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑍 ∈ 𝑆)
47		simpl3 1212	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑋 ⊆ 𝑍)
48		simpr1 1213	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ 𝑍)
49		simpr2l 1251	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑞 ∈ 𝑋)
50		simpr2r 1252	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑟 ∈ 𝑌)
51		simpr3 1215	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ≤ (𝑞 ∨ 𝑟))
52		pmodlem.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (PSubSp‘𝐾)
53	39, 40, 5, 52, 6	pmodlem1 40653	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑍 ∈ 𝑆 ∧ 𝑋 ⊆ 𝑍 ∧ 𝑝 ∈ 𝑍) ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌 ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
54	43, 44, 45, 46, 47, 48, 49, 50, 51, 53	syl333anc 1429	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
55	54	3exp2 1373	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑝 ∈ 𝑍 → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
56	55	imp 412	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))))
57	56	rexlimdvv 3223	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
58	57	adantld 496	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → ((𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
59	58	adantrl 729	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → ((𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
60	42, 59	sylbid 243	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → (𝑝 ∈ (𝑋 + 𝑌) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
61	60	exp32 426	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) → (𝑝 ∈ 𝑍 → (𝑝 ∈ (𝑋 + 𝑌) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
62	61	com34 92	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) → (𝑝 ∈ (𝑋 + 𝑌) → (𝑝 ∈ 𝑍 → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
63	62	imp4b 427	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑝 ∈ (𝑋 + 𝑌) ∧ 𝑝 ∈ 𝑍) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
64	33, 63	biimtrid 245	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → (𝑝 ∈ ((𝑋 + 𝑌) ∩ 𝑍) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))
65	64	ssrdv 3944	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
66	16, 32, 65	pm2.61da2ne 3048	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ∃wrex 3091 ∩ cin 3905 ⊆ wss 3906 ∅c0 4286 class class class wbr 5111 ‘cfv 6540 (class class class)co 7416 lecple 17334 joincjn 18384 Latclat 18504 Atomscatm 40070 HLchlt 40157 PSubSpcpsubsp 40303 +_𝑃cpadd 40602

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-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738

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-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-proset 18367 df-poset 18386 df-plt 18401 df-lub 18417 df-glb 18418 df-join 18419 df-meet 18420 df-p0 18496 df-lat 18505 df-covers 40073 df-ats 40074 df-atl 40105 df-cvlat 40129 df-hlat 40158 df-psubsp 40310 df-padd 40603

This theorem is used by: pmod1i 40655

W3C validator