Theorem hlmod1i 39839

Description: A version of the modular law pmod1i 39831 that holds in a Hilbert lattice. (Contributed by NM, 13-May-2012.)

Hypotheses

Ref	Expression
hlmod.b	⊢ 𝐵 = (Base‘𝐾)
hlmod.l	⊢ ≤ = (le‘𝐾)
hlmod.j	⊢ ∨ = (join‘𝐾)
hlmod.m	⊢ ∧ = (meet‘𝐾)
hlmod.f	⊢ 𝐹 = (pmap‘𝐾)
hlmod.p	⊢ + = (+𝑃‘𝐾)

Assertion

Ref	Expression
hlmod1i	⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌))) → ((𝑋 ∨ 𝑌) ∧ 𝑍) = (𝑋 ∨ (𝑌 ∧ 𝑍))))

Proof of Theorem hlmod1i

Step	Hyp	Ref	Expression
1		hlmod.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		hlmod.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		hllat 39345	. . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
4	3	3ad2ant1 1132	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝐾 ∈ Lat)
5		simp21 1205	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝑋 ∈ 𝐵)
6		simp22 1206	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝑌 ∈ 𝐵)
7		hlmod.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
8	1, 7	latjcl 18497	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∨ 𝑌) ∈ 𝐵)
9	4, 5, 6, 8	syl3anc 1370	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝑋 ∨ 𝑌) ∈ 𝐵)
10		simp23 1207	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝑍 ∈ 𝐵)
11		hlmod.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
12	1, 11	latmcl 18498	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∨ 𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → ((𝑋 ∨ 𝑌) ∧ 𝑍) ∈ 𝐵)
13	4, 9, 10, 12	syl3anc 1370	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝑋 ∨ 𝑌) ∧ 𝑍) ∈ 𝐵)
14	1, 11	latmcl 18498	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 ∧ 𝑍) ∈ 𝐵)
15	4, 6, 10, 14	syl3anc 1370	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝑌 ∧ 𝑍) ∈ 𝐵)
16	1, 7	latjcl 18497	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑌 ∧ 𝑍) ∈ 𝐵) → (𝑋 ∨ (𝑌 ∧ 𝑍)) ∈ 𝐵)
17	4, 5, 15, 16	syl3anc 1370	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝑋 ∨ (𝑌 ∧ 𝑍)) ∈ 𝐵)
18		simp1 1135	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝐾 ∈ HL)
19		eqid 2735	. . . . . . . . 9 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
20		hlmod.f	. . . . . . . . 9 ⊢ 𝐹 = (pmap‘𝐾)
21	1, 19, 20	pmapssat 39742	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ⊆ (Atoms‘𝐾))
22	18, 5, 21	syl2anc 584	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘𝑋) ⊆ (Atoms‘𝐾))
23	1, 19, 20	pmapssat 39742	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) ⊆ (Atoms‘𝐾))
24	18, 6, 23	syl2anc 584	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘𝑌) ⊆ (Atoms‘𝐾))
25		eqid 2735	. . . . . . . . 9 ⊢ (PSubSp‘𝐾) = (PSubSp‘𝐾)
26	1, 25, 20	pmapsub 39751	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑍 ∈ 𝐵) → (𝐹‘𝑍) ∈ (PSubSp‘𝐾))
27	4, 10, 26	syl2anc 584	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘𝑍) ∈ (PSubSp‘𝐾))
28		simp3l 1200	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → 𝑋 ≤ 𝑍)
29	1, 2, 20	pmaple 39744	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 ≤ 𝑍 ↔ (𝐹‘𝑋) ⊆ (𝐹‘𝑍)))
30	18, 5, 10, 29	syl3anc 1370	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝑋 ≤ 𝑍 ↔ (𝐹‘𝑋) ⊆ (𝐹‘𝑍)))
31	28, 30	mpbid 232	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘𝑋) ⊆ (𝐹‘𝑍))
32		hlmod.p	. . . . . . . . 9 ⊢ + = (+𝑃‘𝐾)
33	19, 25, 32	pmod1i 39831	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ ((𝐹‘𝑋) ⊆ (Atoms‘𝐾) ∧ (𝐹‘𝑌) ⊆ (Atoms‘𝐾) ∧ (𝐹‘𝑍) ∈ (PSubSp‘𝐾))) → ((𝐹‘𝑋) ⊆ (𝐹‘𝑍) → (((𝐹‘𝑋) + (𝐹‘𝑌)) ∩ (𝐹‘𝑍)) = ((𝐹‘𝑋) + ((𝐹‘𝑌) ∩ (𝐹‘𝑍)))))
34	33	3impia 1116	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ ((𝐹‘𝑋) ⊆ (Atoms‘𝐾) ∧ (𝐹‘𝑌) ⊆ (Atoms‘𝐾) ∧ (𝐹‘𝑍) ∈ (PSubSp‘𝐾)) ∧ (𝐹‘𝑋) ⊆ (𝐹‘𝑍)) → (((𝐹‘𝑋) + (𝐹‘𝑌)) ∩ (𝐹‘𝑍)) = ((𝐹‘𝑋) + ((𝐹‘𝑌) ∩ (𝐹‘𝑍))))
35	18, 22, 24, 27, 31, 34	syl131anc 1382	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (((𝐹‘𝑋) + (𝐹‘𝑌)) ∩ (𝐹‘𝑍)) = ((𝐹‘𝑋) + ((𝐹‘𝑌) ∩ (𝐹‘𝑍))))
36	1, 11, 19, 20	pmapmeet 39756	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∨ 𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) = ((𝐹‘(𝑋 ∨ 𝑌)) ∩ (𝐹‘𝑍)))
37	18, 9, 10, 36	syl3anc 1370	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) = ((𝐹‘(𝑋 ∨ 𝑌)) ∩ (𝐹‘𝑍)))
38		simp3r 1201	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))
39	38	ineq1d 4227	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝐹‘(𝑋 ∨ 𝑌)) ∩ (𝐹‘𝑍)) = (((𝐹‘𝑋) + (𝐹‘𝑌)) ∩ (𝐹‘𝑍)))
40	37, 39	eqtrd 2775	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) = (((𝐹‘𝑋) + (𝐹‘𝑌)) ∩ (𝐹‘𝑍)))
41	1, 11, 19, 20	pmapmeet 39756	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝐹‘(𝑌 ∧ 𝑍)) = ((𝐹‘𝑌) ∩ (𝐹‘𝑍)))
42	18, 6, 10, 41	syl3anc 1370	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘(𝑌 ∧ 𝑍)) = ((𝐹‘𝑌) ∩ (𝐹‘𝑍)))
43	42	oveq2d 7447	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝐹‘𝑋) + (𝐹‘(𝑌 ∧ 𝑍))) = ((𝐹‘𝑋) + ((𝐹‘𝑌) ∩ (𝐹‘𝑍))))
44	35, 40, 43	3eqtr4d 2785	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) = ((𝐹‘𝑋) + (𝐹‘(𝑌 ∧ 𝑍))))
45	1, 7, 20, 32	pmapjoin 39835	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑌 ∧ 𝑍) ∈ 𝐵) → ((𝐹‘𝑋) + (𝐹‘(𝑌 ∧ 𝑍))) ⊆ (𝐹‘(𝑋 ∨ (𝑌 ∧ 𝑍))))
46	4, 5, 15, 45	syl3anc 1370	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝐹‘𝑋) + (𝐹‘(𝑌 ∧ 𝑍))) ⊆ (𝐹‘(𝑋 ∨ (𝑌 ∧ 𝑍))))
47	44, 46	eqsstrd 4034	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) ⊆ (𝐹‘(𝑋 ∨ (𝑌 ∧ 𝑍))))
48	1, 2, 20	pmaple 39744	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ ((𝑋 ∨ 𝑌) ∧ 𝑍) ∈ 𝐵 ∧ (𝑋 ∨ (𝑌 ∧ 𝑍)) ∈ 𝐵) → (((𝑋 ∨ 𝑌) ∧ 𝑍) ≤ (𝑋 ∨ (𝑌 ∧ 𝑍)) ↔ (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) ⊆ (𝐹‘(𝑋 ∨ (𝑌 ∧ 𝑍)))))
49	18, 13, 17, 48	syl3anc 1370	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (((𝑋 ∨ 𝑌) ∧ 𝑍) ≤ (𝑋 ∨ (𝑌 ∧ 𝑍)) ↔ (𝐹‘((𝑋 ∨ 𝑌) ∧ 𝑍)) ⊆ (𝐹‘(𝑋 ∨ (𝑌 ∧ 𝑍)))))
50	47, 49	mpbird 257	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝑋 ∨ 𝑌) ∧ 𝑍) ≤ (𝑋 ∨ (𝑌 ∧ 𝑍)))
51	1, 2, 7, 11	mod1ile 18551	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 ≤ 𝑍 → (𝑋 ∨ (𝑌 ∧ 𝑍)) ≤ ((𝑋 ∨ 𝑌) ∧ 𝑍)))
52	51	3impia 1116	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ 𝑋 ≤ 𝑍) → (𝑋 ∨ (𝑌 ∧ 𝑍)) ≤ ((𝑋 ∨ 𝑌) ∧ 𝑍))
53	4, 5, 6, 10, 28, 52	syl131anc 1382	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → (𝑋 ∨ (𝑌 ∧ 𝑍)) ≤ ((𝑋 ∨ 𝑌) ∧ 𝑍))
54	1, 2, 4, 13, 17, 50, 53	latasymd 18503	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))) → ((𝑋 ∨ 𝑌) ∧ 𝑍) = (𝑋 ∨ (𝑌 ∧ 𝑍)))
55	54	3expia 1120	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 ≤ 𝑍 ∧ (𝐹‘(𝑋 ∨ 𝑌)) = ((𝐹‘𝑋) + (𝐹‘𝑌))) → ((𝑋 ∨ 𝑌) ∧ 𝑍) = (𝑋 ∨ (𝑌 ∧ 𝑍))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106   ∩ cin 3962   ⊆ wss 3963   class class class wbr 5148  ‘cfv 6563  (class class class)co 7431  Basecbs 17245  lecple 17305  joincjn 18369  meetcmee 18370  Latclat 18489  Atomscatm 39245  HLchlt 39332  PSubSpcpsubsp 39479  pmapcpmap 39480  +_𝑃cpadd 39778

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-iin 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-proset 18352  df-poset 18371  df-plt 18388  df-lub 18404  df-glb 18405  df-join 18406  df-meet 18407  df-p0 18483  df-lat 18490  df-clat 18557  df-oposet 39158  df-ol 39160  df-oml 39161  df-covers 39248  df-ats 39249  df-atl 39280  df-cvlat 39304  df-hlat 39333  df-psubsp 39486  df-pmap 39487  df-padd 39779

This theorem is referenced by:  atmod1i1  39840  atmod1i2  39842  llnmod1i2  39843