Theorem cvrat3 39934

Description: A condition implying that a certain lattice element is an atom. Part of Lemma 3.2.20 of [PtakPulmannova] p. 68. (atcvat3i 32485 analog.) (Contributed by NM, 30-Nov-2011.)

Hypotheses

Ref	Expression
cvrat3.b	⊢ 𝐵 = (Base‘𝐾)
cvrat3.l	⊢ ≤ = (le‘𝐾)
cvrat3.j	⊢ ∨ = (join‘𝐾)
cvrat3.m	⊢ ∧ = (meet‘𝐾)
cvrat3.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
cvrat3	⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))

Proof of Theorem cvrat3

Step	Hyp	Ref	Expression
1		cvrat3.b	. . . . . . . . . . . 12 ⊢ 𝐵 = (Base‘𝐾)
2		cvrat3.l	. . . . . . . . . . . 12 ⊢ ≤ = (le‘𝐾)
3		cvrat3.j	. . . . . . . . . . . 12 ⊢ ∨ = (join‘𝐾)
4		eqid 2739	. . . . . . . . . . . 12 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
5		cvrat3.a	. . . . . . . . . . . 12 ⊢ 𝐴 = (Atoms‘𝐾)
6	1, 2, 3, 4, 5	cvr1 39902	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (¬ 𝑄 ≤ 𝑋 ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄)))
7	6	3adant3r2 1190	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (¬ 𝑄 ≤ 𝑋 ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄)))
8	7	biimpa 477	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ ¬ 𝑄 ≤ 𝑋) → 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄))
9	8	adantrr 723	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ (¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄))) → 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄))
10		hllat 39855	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
11	10	adantr 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝐾 ∈ Lat)
12		simpr2 1202	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
13	1, 5	atbase 39781	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
14	12, 13	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑃 ∈ 𝐵)
15		simpr3 1203	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
16	1, 5	atbase 39781	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
17	15, 16	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ∈ 𝐵)
18	1, 3	latjcom 18404	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
19	11, 14, 17, 18	syl3anc 1379	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃))
20	19	oveq2d 7372	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) = (𝑋 ∨ (𝑄 ∨ 𝑃)))
21		simpr1 1201	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑋 ∈ 𝐵)
22	1, 3	latjass 18440	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵)) → ((𝑋 ∨ 𝑄) ∨ 𝑃) = (𝑋 ∨ (𝑄 ∨ 𝑃)))
23	11, 21, 17, 14, 22	syl13anc 1380	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ∨ 𝑄) ∨ 𝑃) = (𝑋 ∨ (𝑄 ∨ 𝑃)))
24	20, 23	eqtr4d 2777	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) = ((𝑋 ∨ 𝑄) ∨ 𝑃))
25	24	adantr 481	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) = ((𝑋 ∨ 𝑄) ∨ 𝑃))
26	1, 3	latjcl 18396	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑋 ∨ 𝑄) ∈ 𝐵)
27	11, 21, 17, 26	syl3anc 1379	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∨ 𝑄) ∈ 𝐵)
28	1, 2, 3	latjlej2 18411	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ 𝐵 ∧ (𝑋 ∨ 𝑄) ∈ 𝐵 ∧ (𝑋 ∨ 𝑄) ∈ 𝐵)) → (𝑃 ≤ (𝑋 ∨ 𝑄) → ((𝑋 ∨ 𝑄) ∨ 𝑃) ≤ ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄))))
29	11, 14, 27, 27, 28	syl13anc 1380	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑃 ≤ (𝑋 ∨ 𝑄) → ((𝑋 ∨ 𝑄) ∨ 𝑃) ≤ ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄))))
30	29	imp 407	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ((𝑋 ∨ 𝑄) ∨ 𝑃) ≤ ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄)))
31	25, 30	eqbrtrd 5094	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) ≤ ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄)))
32	1, 3	latjidm 18419	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∨ 𝑄) ∈ 𝐵) → ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄)) = (𝑋 ∨ 𝑄))
33	11, 27, 32	syl2anc 590	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄)) = (𝑋 ∨ 𝑄))
34	33	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ((𝑋 ∨ 𝑄) ∨ (𝑋 ∨ 𝑄)) = (𝑋 ∨ 𝑄))
35	31, 34	breqtrd 5098	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) ≤ (𝑋 ∨ 𝑄))
36		simpl 483	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝐾 ∈ HL)
37	2, 3, 5	hlatlej2 39868	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 𝑄 ≤ (𝑃 ∨ 𝑄))
38	36, 12, 15, 37	syl3anc 1379	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → 𝑄 ≤ (𝑃 ∨ 𝑄))
39	1, 3	latjcl 18396	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 ∨ 𝑄) ∈ 𝐵)
40	11, 14, 17, 39	syl3anc 1379	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ 𝐵)
41	1, 2, 3	latjlej2 18411	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Lat ∧ (𝑄 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (𝑄 ≤ (𝑃 ∨ 𝑄) → (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄))))
42	11, 17, 40, 21, 41	syl13anc 1380	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑄) → (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄))))
43	38, 42	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄)))
44	43	adantr 481	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄)))
45	1, 3	latjcl 18396	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵) → (𝑋 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵)
46	11, 21, 40, 45	syl3anc 1379	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵)
47	1, 2	latasymb 18399	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵 ∧ (𝑋 ∨ 𝑄) ∈ 𝐵) → (((𝑋 ∨ (𝑃 ∨ 𝑄)) ≤ (𝑋 ∨ 𝑄) ∧ (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄))) ↔ (𝑋 ∨ (𝑃 ∨ 𝑄)) = (𝑋 ∨ 𝑄)))
48	11, 46, 27, 47	syl3anc 1379	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (((𝑋 ∨ (𝑃 ∨ 𝑄)) ≤ (𝑋 ∨ 𝑄) ∧ (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄))) ↔ (𝑋 ∨ (𝑃 ∨ 𝑄)) = (𝑋 ∨ 𝑄)))
49	48	adantr 481	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (((𝑋 ∨ (𝑃 ∨ 𝑄)) ≤ (𝑋 ∨ 𝑄) ∧ (𝑋 ∨ 𝑄) ≤ (𝑋 ∨ (𝑃 ∨ 𝑄))) ↔ (𝑋 ∨ (𝑃 ∨ 𝑄)) = (𝑋 ∨ 𝑄)))
50	35, 44, 49	mpbi2and 718	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∨ (𝑃 ∨ 𝑄)) = (𝑋 ∨ 𝑄))
51	50	breq2d 5084	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄)) ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄)))
52	51	adantrl 722	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ (¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄))) → (𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄)) ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ 𝑄)))
53	9, 52	mpbird 258	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ (¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄))) → 𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄)))
54	53	ex 413	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → 𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄))))
55		cvrat3.m	. . . . . . . 8 ⊢ ∧ = (meet‘𝐾)
56	1, 3, 55, 4	cvrexch 39912	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵) → ((𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄) ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄))))
57	36, 21, 40, 56	syl3anc 1379	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄) ↔ 𝑋( ⋖ ‘𝐾)(𝑋 ∨ (𝑃 ∨ 𝑄))))
58	54, 57	sylibrd 260	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄)))
59	58	adantr 481	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄) → ((¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄)))
60	1, 55	latmcl 18397	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐵)
61	11, 21, 40, 60	syl3anc 1379	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐵)
62	1, 3, 4, 5	cvrat2 39921	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ ((𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄))) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴)
63	62	3expia 1127	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ ((𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑃 ≠ 𝑄 ∧ (𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))
64	36, 61, 12, 15, 63	syl13anc 1380	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑃 ≠ 𝑄 ∧ (𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))
65	64	expdimp 453	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄) → ((𝑋 ∧ (𝑃 ∨ 𝑄))( ⋖ ‘𝐾)(𝑃 ∨ 𝑄) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))
66	59, 65	syld 47	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄) → ((¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))
67	66	exp4b 431	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (𝑃 ≠ 𝑄 → (¬ 𝑄 ≤ 𝑋 → (𝑃 ≤ (𝑋 ∨ 𝑄) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))))
68	67	3impd 1355	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → (𝑋 ∧ (𝑃 ∨ 𝑄)) ∈ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119   ≠ wne 2934   class class class wbr 5072  ‘cfv 6485  (class class class)co 7356  Basecbs 17170  lecple 17218  joincjn 18268  meetcmee 18269  Latclat 18388   ⋖ ccvr 39754  Atomscatm 39755  HLchlt 39842

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-proset 18251  df-poset 18270  df-plt 18285  df-lub 18301  df-glb 18302  df-join 18303  df-meet 18304  df-p0 18380  df-lat 18389  df-clat 18456  df-oposet 39668  df-ol 39670  df-oml 39671  df-covers 39758  df-ats 39759  df-atl 39790  df-cvlat 39814  df-hlat 39843

This theorem is referenced by:  cvrat4  39935  2atjm  39937  1cvrat  39968  2llnma1b  40278