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 41170

Description: Lemma for pmod1i 41171. (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 7466	. . . . 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 41135	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → (∅ + 𝑌) = 𝑌)
8	3, 4, 7	syl2anc 596	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (∅ + 𝑌) = 𝑌)
9	2, 8	eqtrd 2798	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑋 + 𝑌) = 𝑌)
10	9	ineq1d 4119	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑌 ∩ 𝑍))
11		ssinss1 4145	. . . . 5 ⊢ (𝑌 ⊆ 𝐴 → (𝑌 ∩ 𝑍) ⊆ 𝐴)
12	4, 11	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ 𝐴)
13		simpl21 1270	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → 𝑋 ⊆ 𝐴)
14	5, 6	sspadd2 41139	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
15	3, 12, 13, 14	syl3anc 1399	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → (𝑌 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
16	10, 15	eqsstrd 3947	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑋 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
17		oveq2 7459	. . . . 5 ⊢ (𝑌 = ∅ → (𝑋 + 𝑌) = (𝑋 + ∅))
18		simp1 1154	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝐾 ∈ HL)
19		simp21 1225	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → 𝑋 ⊆ 𝐴)
20	5, 6	padd01 41134	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 + ∅) = 𝑋)
21	18, 19, 20	syl2anc 596	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑋 + ∅) = 𝑋)
22	17, 21	sylan9eqr 2820	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 + 𝑌) = 𝑋)
23	22	ineq1d 4119	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) = (𝑋 ∩ 𝑍))
24		inss1 4136	. . . 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 41138	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ (𝑌 ∩ 𝑍) ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
30	25, 26, 28, 29	syl3anc 1399	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → 𝑋 ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
31	24, 30	sstrid 3924	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → (𝑋 ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
32	23, 31	eqsstrd 3947	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑌 = ∅) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
33		elin 4096	. . . 4 ⊢ (𝑝 ∈ ((𝑋 + 𝑌) ∩ 𝑍) ↔ (𝑝 ∈ (𝑋 + 𝑌) ∧ 𝑝 ∈ 𝑍))
34		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ ((𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅) ∧ 𝑝 ∈ 𝑍)) → 𝐾 ∈ HL)
35	34	hllatd 40687	. . . . . . . . 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 41123	. . . . . . . . 9 ⊢ (((𝐾 ∈ Lat ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → (𝑝 ∈ (𝑋 + 𝑌) ↔ (𝑝 ∈ 𝐴 ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟))))
42	35, 36, 37, 38, 41	syl31anc 1401	. . . . . . . 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 41169	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ∧ (𝑍 ∈ 𝑆 ∧ 𝑋 ⊆ 𝑍 ∧ 𝑝 ∈ 𝑍) ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌 ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
54	43, 44, 45, 46, 47, 48, 49, 50, 51, 53	syl333anc 1430	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑝 ∈ 𝑍 ∧ (𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) ∧ 𝑝 ≤ (𝑞 ∨ 𝑟))) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))
55	54	3exp2 1373	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) → (𝑝 ∈ 𝑍 → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍))))))
56	55	imp 412	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ 𝑝 ∈ 𝑍) → ((𝑞 ∈ 𝑋 ∧ 𝑟 ∈ 𝑌) → (𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ (𝑋 + (𝑌 ∩ 𝑍)))))
57	56	rexlimdvv 3222	. . . . . . . . . 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 3919	. 2 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ⊆ 𝑍) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑋 + 𝑌) ∩ 𝑍) ⊆ (𝑋 + (𝑌 ∩ 𝑍)))
66	16, 32, 65	pm2.61da2ne 3047	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 2147 ≠ wne 2959 ∃wrex 3090 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 lecple 17479 joincjn 18535 Latclat 18655 Atomscatm 40586 HLchlt 40673 PSubSpcpsubsp 40819 +_𝑃cpadd 41118

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-p0 18647 df-lat 18656 df-covers 40589 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-psubsp 40826 df-padd 41119

This theorem is used by: pmod1i 41171

W3C validator