lhpexle2lem - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lhpexle2lem		Structured version Visualization version GIF version

Theorem lhpexle2lem 39406

Description: Lemma for lhpexle2 39407. (Contributed by NM, 19-Jun-2013.)

**Hypotheses**
Ref	Expression
lhpex1.l	⊢ ≤ = (le‘𝐾)
lhpex1.a	⊢ 𝐴 = (Atoms‘𝐾)
lhpex1.h	⊢ 𝐻 = (LHyp‘𝐾)

**Assertion**
Ref	Expression
lhpexle2lem	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))

Distinct variable groups: ≤ ,𝑝 𝐴,𝑝 𝐻,𝑝 𝐾,𝑝 𝑊,𝑝 𝑋,𝑝 𝑌,𝑝

**Proof of Theorem lhpexle2lem**
Step	Hyp	Ref	Expression
1		simpl1 1189	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		lhpex1.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		lhpex1.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
4		lhpex1.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5	2, 3, 4	lhpexle1 39405	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋))
6	1, 5	syl 17	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋))
7		simp3l 1199	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≤ 𝑊)
8		simp3r 1200	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≠ 𝑋)
9		simp2 1135	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑋 = 𝑌)
10	8, 9	neeqtrd 3005	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≠ 𝑌)
11	7, 8, 10	3jca 1126	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
12	11	3expia 1119	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ((𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
13	12	reximdv 3165	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → (∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
14	6, 13	mpd 15	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
15		simpl1l 1222	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝐾 ∈ HL)
16		simpl2l 1224	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴)
17		simpl3l 1226	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴)
18		simpr 484	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
19		eqid 2727	. . . . 5 ⊢ (join‘𝐾) = (join‘𝐾)
20	2, 19, 3	hlsupr 38783	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))
21	15, 16, 17, 18, 20	syl31anc 1371	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))
22		eqid 2727	. . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾)
23		simpl1l 1222	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝐾 ∈ HL)
24	23	hllatd 38760	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝐾 ∈ Lat)
25		simprlr 779	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ∈ 𝐴)
26	22, 3	atbase 38685	. . . . . . . . 9 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ (Base‘𝐾))
27	25, 26	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ∈ (Base‘𝐾))
28		simpl2l 1224	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ∈ 𝐴)
29		simpl3l 1226	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ∈ 𝐴)
30	22, 19, 3	hlatjcl 38763	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋(join‘𝐾)𝑌) ∈ (Base‘𝐾))
31	23, 28, 29, 30	syl3anc 1369	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑋(join‘𝐾)𝑌) ∈ (Base‘𝐾))
32		simpl1r 1223	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑊 ∈ 𝐻)
33	22, 4	lhpbase 39395	. . . . . . . . 9 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
34	32, 33	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑊 ∈ (Base‘𝐾))
35		simprr3 1221	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≤ (𝑋(join‘𝐾)𝑌))
36		simpl2r 1225	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ≤ 𝑊)
37		simpl3r 1227	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ≤ 𝑊)
38	22, 3	atbase 38685	. . . . . . . . . . 11 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ (Base‘𝐾))
39	28, 38	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ∈ (Base‘𝐾))
40	22, 3	atbase 38685	. . . . . . . . . . 11 ⊢ (𝑌 ∈ 𝐴 → 𝑌 ∈ (Base‘𝐾))
41	29, 40	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ∈ (Base‘𝐾))
42	22, 2, 19	latjle12 18427	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾))) → ((𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊) ↔ (𝑋(join‘𝐾)𝑌) ≤ 𝑊))
43	24, 39, 41, 34, 42	syl13anc 1370	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → ((𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊) ↔ (𝑋(join‘𝐾)𝑌) ≤ 𝑊))
44	36, 37, 43	mpbi2and 711	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑋(join‘𝐾)𝑌) ≤ 𝑊)
45	22, 2, 24, 27, 31, 34, 35, 44	lattrd 18423	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≤ 𝑊)
46		simprr1 1219	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≠ 𝑋)
47		simprr2 1220	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≠ 𝑌)
48	45, 46, 47	3jca 1126	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
49	48	exp44 437	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≠ 𝑌 → (𝑝 ∈ 𝐴 → ((𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))))
50	49	imp31 417	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) ∧ 𝑝 ∈ 𝐴) → ((𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
51	50	reximdva 3163	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → (∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
52	21, 51	mpd 15	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
53	14, 52	pm2.61dane 3024	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 ∃wrex 3065 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 Basecbs 17165 lecple 17225 joincjn 18288 Latclat 18408 Atomscatm 38659 HLchlt 38746 LHypclh 39381

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-proset 18272 df-poset 18290 df-plt 18307 df-lub 18323 df-glb 18324 df-join 18325 df-meet 18326 df-p0 18402 df-p1 18403 df-lat 18409 df-clat 18476 df-oposet 38572 df-ol 38574 df-oml 38575 df-covers 38662 df-ats 38663 df-atl 38694 df-cvlat 38718 df-hlat 38747 df-lhyp 39385

This theorem is referenced by: lhpexle2 39407

W3C validator