Theorem exatleN 35212

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 1328	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑄 ≤ 𝑋)
2		atomle.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
3		atomle.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
4		simp11l 1368	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ HL)
5		hllat 35172	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
6	4, 5	syl 17	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝐾 ∈ Lat)
7		simp122 1390	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐴)
8		atomle.a	. . . . . . . . 9 ⊢ 𝐴 = (Atoms‘𝐾)
9	2, 8	atbase 35098	. . . . . . . 8 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
10	7, 9	syl 17	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ∈ 𝐵)
11		simp121 1389	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐴)
12	2, 8	atbase 35098	. . . . . . . . 9 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
13	11, 12	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ∈ 𝐵)
14		simp123 1391	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐴)
15	2, 8	atbase 35098	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ 𝐵)
16	14, 15	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ∈ 𝐵)
17		atomle.j	. . . . . . . . 9 ⊢ ∨ = (join‘𝐾)
18	2, 17	latjcl 17259	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵) → (𝑃 ∨ 𝑅) ∈ 𝐵)
19	6, 13, 16, 18	syl3anc 1476	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ∈ 𝐵)
20		simp11r 1369	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑋 ∈ 𝐵)
21	14, 7, 11	3jca 1122	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴))
22		simp2 1131	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≠ 𝑃)
23	4, 21, 22	3jca 1122	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃))
24		simp133 1394	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ (𝑃 ∨ 𝑄))
25	3, 17, 8	hlatexch1 35203	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ (𝑃 ∨ 𝑄) → 𝑄 ≤ (𝑃 ∨ 𝑅)))
26	23, 24, 25	sylc 65	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ (𝑃 ∨ 𝑅))
27		simp131 1392	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑃 ≤ 𝑋)
28		simp3 1132	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑅 ≤ 𝑋)
29	2, 3, 17	latjle12 17270	. . . . . . . . 9 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ 𝐵 ∧ 𝑅 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
30	6, 13, 16, 20, 29	syl13anc 1478	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → ((𝑃 ≤ 𝑋 ∧ 𝑅 ≤ 𝑋) ↔ (𝑃 ∨ 𝑅) ≤ 𝑋))
31	27, 28, 30	mpbi2and 691	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → (𝑃 ∨ 𝑅) ≤ 𝑋)
32	2, 3, 6, 10, 19, 20, 26, 31	lattrd 17266	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃 ∧ 𝑅 ≤ 𝑋) → 𝑄 ≤ 𝑋)
33	32	3expia 1114	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → (𝑅 ≤ 𝑋 → 𝑄 ≤ 𝑋))
34	1, 33	mtod 189	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) ∧ 𝑅 ≠ 𝑃) → ¬ 𝑅 ≤ 𝑋)
35	34	ex 397	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≠ 𝑃 → ¬ 𝑅 ≤ 𝑋))
36	35	necon4ad 2962	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 → 𝑅 = 𝑃))
37		simp31 1251	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → 𝑃 ≤ 𝑋)
38		breq1 4789	. . 3 ⊢ (𝑅 = 𝑃 → (𝑅 ≤ 𝑋 ↔ 𝑃 ≤ 𝑋))
39	37, 38	syl5ibrcom 237	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 = 𝑃 → 𝑅 ≤ 𝑋))
40	36, 39	impbid 202	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑃 ≤ 𝑋 ∧ ¬ 𝑄 ≤ 𝑋 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ≤ 𝑋 ↔ 𝑅 = 𝑃))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 382   ∧ w3a 1071   = wceq 1631   ∈ wcel 2145   ≠ wne 2943   class class class wbr 4786  ‘cfv 6031  (class class class)co 6793  Basecbs 16064  lecple 16156  joincjn 17152  Latclat 17253  Atomscatm 35072  HLchlt 35159

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4904  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-riota 6754  df-ov 6796  df-oprab 6797  df-preset 17136  df-poset 17154  df-plt 17166  df-lub 17182  df-glb 17183  df-join 17184  df-meet 17185  df-p0 17247  df-lat 17254  df-covers 35075  df-ats 35076  df-atl 35107  df-cvlat 35131  df-hlat 35160

This theorem is referenced by:  cdlema2N  35600