Theorem lncmp 39740

Description: If two lines are comparable, they are equal. (Contributed by NM, 30-Apr-2012.)

Hypotheses

Ref	Expression
lncmp.b	⊢ 𝐵 = (Base‘𝐾)
lncmp.l	⊢ ≤ = (le‘𝐾)
lncmp.n	⊢ 𝑁 = (Lines‘𝐾)
lncmp.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
lncmp	⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))

Proof of Theorem lncmp

Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplrl 776	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → (𝑀‘𝑋) ∈ 𝑁)
2		simpll1 1212	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → 𝐾 ∈ HL)
3		simpll2 1213	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → 𝑋 ∈ 𝐵)
4		lncmp.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
5		eqid 2740	. . . . . . 7 ⊢ (join‘𝐾) = (join‘𝐾)
6		eqid 2740	. . . . . . 7 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
7		lncmp.n	. . . . . . 7 ⊢ 𝑁 = (Lines‘𝐾)
8		lncmp.m	. . . . . . 7 ⊢ 𝑀 = (pmap‘𝐾)
9	4, 5, 6, 7, 8	isline3 39733	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞))))
10	2, 3, 9	syl2anc 583	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → ((𝑀‘𝑋) ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞))))
11	1, 10	mpbid 232	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))
12		simp3rr 1247	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = (𝑝(join‘𝐾)𝑞))
13		simp1l1 1266	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ HL)
14		simp1l3 1268	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌 ∈ 𝐵)
15		simp1rr 1239	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → (𝑀‘𝑌) ∈ 𝑁)
16		simp3ll 1244	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ∈ (Atoms‘𝐾))
17		simp3lr 1245	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ∈ (Atoms‘𝐾))
18		simp3rl 1246	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ≠ 𝑞)
19		lncmp.l	. . . . . . . . . 10 ⊢ ≤ = (le‘𝐾)
20	13	hllatd 39320	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝐾 ∈ Lat)
21	4, 6	atbase 39245	. . . . . . . . . . 11 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
22	16, 21	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ∈ 𝐵)
23		simp1l2 1267	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 ∈ 𝐵)
24	19, 5, 6	hlatlej1 39331	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑝 ≤ (𝑝(join‘𝐾)𝑞))
25	13, 16, 17, 24	syl3anc 1371	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ≤ (𝑝(join‘𝐾)𝑞))
26	25, 12	breqtrrd 5194	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ≤ 𝑋)
27		simp2 1137	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 ≤ 𝑌)
28	4, 19, 20, 22, 23, 14, 26, 27	lattrd 18516	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑝 ≤ 𝑌)
29	4, 6	atbase 39245	. . . . . . . . . . 11 ⊢ (𝑞 ∈ (Atoms‘𝐾) → 𝑞 ∈ 𝐵)
30	17, 29	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ∈ 𝐵)
31	19, 5, 6	hlatlej2 39332	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → 𝑞 ≤ (𝑝(join‘𝐾)𝑞))
32	13, 16, 17, 31	syl3anc 1371	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ≤ (𝑝(join‘𝐾)𝑞))
33	32, 12	breqtrrd 5194	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ≤ 𝑋)
34	4, 19, 20, 30, 23, 14, 33, 27	lattrd 18516	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑞 ≤ 𝑌)
35	4, 19, 5, 6, 7, 8	lneq2at 39735	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵 ∧ (𝑀‘𝑌) ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾) ∧ 𝑝 ≠ 𝑞) ∧ (𝑝 ≤ 𝑌 ∧ 𝑞 ≤ 𝑌)) → 𝑌 = (𝑝(join‘𝐾)𝑞))
36	13, 14, 15, 16, 17, 18, 28, 34, 35	syl332anc 1401	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑌 = (𝑝(join‘𝐾)𝑞))
37	12, 36	eqtr4d 2783	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌 ∧ ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)))) → 𝑋 = 𝑌)
38	37	3expia 1121	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → (((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞))) → 𝑋 = 𝑌))
39	38	expd 415	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → ((𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌)))
40	39	rexlimdvv 3218	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → (∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝(join‘𝐾)𝑞)) → 𝑋 = 𝑌))
41	11, 40	mpd 15	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) ∧ 𝑋 ≤ 𝑌) → 𝑋 = 𝑌)
42	41	ex 412	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → (𝑋 ≤ 𝑌 → 𝑋 = 𝑌))
43		simpl1 1191	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → 𝐾 ∈ HL)
44	43	hllatd 39320	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → 𝐾 ∈ Lat)
45		simpl2 1192	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → 𝑋 ∈ 𝐵)
46	4, 19	latref 18511	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋)
47	44, 45, 46	syl2anc 583	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → 𝑋 ≤ 𝑋)
48		breq2 5170	. . 3 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌))
49	47, 48	syl5ibcom 245	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌))
50	42, 49	impbid 212	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝑀‘𝑋) ∈ 𝑁 ∧ (𝑀‘𝑌) ∈ 𝑁)) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∃wrex 3076   class class class wbr 5166  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  lecple 17318  joincjn 18381  Latclat 18501  Atomscatm 39219  HLchlt 39306  Linesclines 39451  pmapcpmap 39454

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-proset 18365  df-poset 18383  df-plt 18400  df-lub 18416  df-glb 18417  df-join 18418  df-meet 18419  df-p0 18495  df-lat 18502  df-clat 18569  df-oposet 39132  df-ol 39134  df-oml 39135  df-covers 39222  df-ats 39223  df-atl 39254  df-cvlat 39278  df-hlat 39307  df-lines 39458  df-pmap 39461

This theorem is referenced by:  2lnat  39741