Theorem exatleN 40461

Description: A condition for an atom to be less than or equal to a lattice element. Part of proof of Lemma A in [Crawley] p. 112. (Contributed by NM, 28-Apr-2012.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
exatleN	⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 ↔ 𝑅 = 𝑃))

Proof of Theorem exatleN

Step	Hyp	Ref	Expression
1		simpl32 1274	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑄 ≤ 𝑋)
2		atomle.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
3		atomle.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
4		simp11l 1303	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ HL)
5	4	hllatd 40421	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ Lat)
6		simp122 1325	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐴)
7		atomle.a	. . . . . . . . 9 ⊢ 𝐴 = (Atoms‘𝐾)
8	2, 7	atbase 40346	. . . . . . . 8 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
9	6, 8	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐵)
10		simp121 1324	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐴)
11	2, 7	atbase 40346	. . . . . . . . 9 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
12	10, 11	syl 18	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐵)
13		simp123 1326	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐴)
14	2, 7	atbase 40346	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ 𝐵)
15	13, 14	syl 18	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐵)
16		atomle.j	. . . . . . . . 9 ⊢ ∨ = (join‘𝐾)
17	2, 16	latjcl 18613	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵) → (𝑃 ∨ 𝑅) ∈ 𝐵)
18	5, 12, 15, 17	syl3anc 1398	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ∈ 𝐵)
19		simp11r 1304	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑋 ∈ 𝐵)
20	13, 6, 10	3jca 1146	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
21		simp2 1155	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≠ 𝑃)
22	4, 20, 21	3jca 1146	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃))
23		simp133 1329	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ (𝑃 ∨ 𝑄))
24	3, 16, 7	hlatexch1 40452	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ (𝑃 ∨ 𝑄) → 𝑄 ≤ (𝑃 ∨ 𝑅)))
25	22, 23, 24	sylc 66	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ (𝑃 ∨ 𝑅))
26		simp131 1327	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ≤ 𝑋)
27		simp3 1156	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ 𝑋)
28	2, 3, 16	latjle12 18624	. . . . . . . . 9 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
29	5, 12, 15, 19, 28	syl13anc 1399	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
30	26, 27, 29	mpbi2and 725	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ≤ 𝑋)
31	2, 3, 5, 9, 18, 19, 25, 30	lattrd 18620	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ 𝑋)
32	31	3expia 1139	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ 𝑋 → 𝑄 ≤ 𝑋))
33	1, 32	mtod 201	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑅 ≤ 𝑋)
34	33	ex 418	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≠ 𝑃 → ¬ 𝑅 ≤ 𝑋))
35	34	necon4ad 2975	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 → 𝑅 = 𝑃))
36		simp31 1228	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ≤ 𝑋)
37		breq1 5106	. . 3 ⊢ (𝑅 = 𝑃 → (𝑅 ≤ 𝑋 ↔ 𝑃 ≤ 𝑋))
38	36, 37	syl5ibrcom 250	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 = 𝑃 → 𝑅 ≤ 𝑋))
39	35, 38	impbid 215	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 ↔ 𝑅 = 𝑃))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  Latclat 18605  Atomscatm 40320  HLchlt 40407

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-proset 18468  df-poset 18487  df-plt 18502  df-lub 18518  df-glb 18519  df-join 18520  df-meet 18521  df-p0 18597  df-lat 18606  df-covers 40323  df-ats 40324  df-atl 40355  df-cvlat 40379  df-hlat 40408

This theorem is used by:  cdlema2N  40849