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 39534

Description: Lemma for lhpexle2 39535. (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 1188	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		lhpex1.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		lhpex1.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
4		lhpex1.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
5	2, 3, 4	lhpexle1 39533	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋))
6	1, 5	syl 17	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋))
7		simp3l 1198	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≤ 𝑊)
8		simp3r 1199	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≠ 𝑋)
9		simp2 1134	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑋 = 𝑌)
10	8, 9	neeqtrd 3000	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → 𝑝 ≠ 𝑌)
11	7, 8, 10	3jca 1125	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌 ∧ (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
12	11	3expia 1118	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ((𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
13	12	reximdv 3160	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → (∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
14	6, 13	mpd 15	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 = 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
15		simpl1l 1221	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝐾 ∈ HL)
16		simpl2l 1223	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝐴)
17		simpl3l 1225	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝐴)
18		simpr 483	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
19		eqid 2725	. . . . 5 ⊢ (join‘𝐾) = (join‘𝐾)
20	2, 19, 3	hlsupr 38911	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))
21	15, 16, 17, 18, 20	syl31anc 1370	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))
22		eqid 2725	. . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾)
23		simpl1l 1221	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝐾 ∈ HL)
24	23	hllatd 38888	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝐾 ∈ Lat)
25		simprlr 778	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ∈ 𝐴)
26	22, 3	atbase 38813	. . . . . . . . 9 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ (Base‘𝐾))
27	25, 26	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ∈ (Base‘𝐾))
28		simpl2l 1223	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ∈ 𝐴)
29		simpl3l 1225	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ∈ 𝐴)
30	22, 19, 3	hlatjcl 38891	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋(join‘𝐾)𝑌) ∈ (Base‘𝐾))
31	23, 28, 29, 30	syl3anc 1368	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑋(join‘𝐾)𝑌) ∈ (Base‘𝐾))
32		simpl1r 1222	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑊 ∈ 𝐻)
33	22, 4	lhpbase 39523	. . . . . . . . 9 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
34	32, 33	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑊 ∈ (Base‘𝐾))
35		simprr3 1220	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≤ (𝑋(join‘𝐾)𝑌))
36		simpl2r 1224	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ≤ 𝑊)
37		simpl3r 1226	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ≤ 𝑊)
38	22, 3	atbase 38813	. . . . . . . . . . 11 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ (Base‘𝐾))
39	28, 38	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑋 ∈ (Base‘𝐾))
40	22, 3	atbase 38813	. . . . . . . . . . 11 ⊢ (𝑌 ∈ 𝐴 → 𝑌 ∈ (Base‘𝐾))
41	29, 40	syl 17	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑌 ∈ (Base‘𝐾))
42	22, 2, 19	latjle12 18436	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾))) → ((𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊) ↔ (𝑋(join‘𝐾)𝑌) ≤ 𝑊))
43	24, 39, 41, 34, 42	syl13anc 1369	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → ((𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊) ↔ (𝑋(join‘𝐾)𝑌) ≤ 𝑊))
44	36, 37, 43	mpbi2and 710	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑋(join‘𝐾)𝑌) ≤ 𝑊)
45	22, 2, 24, 27, 31, 34, 35, 44	lattrd 18432	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≤ 𝑊)
46		simprr1 1218	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≠ 𝑋)
47		simprr2 1219	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → 𝑝 ≠ 𝑌)
48	45, 46, 47	3jca 1125	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ ((𝑋 ≠ 𝑌 ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)))) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
49	48	exp44 436	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) → (𝑋 ≠ 𝑌 → (𝑝 ∈ 𝐴 → ((𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))))
50	49	imp31 416	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) ∧ 𝑝 ∈ 𝐴) → ((𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
51	50	reximdva 3158	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → (∃𝑝 ∈ 𝐴 (𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌 ∧ 𝑝 ≤ (𝑋(join‘𝐾)𝑌)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌)))
52	21, 51	mpd 15	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≠ 𝑌) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))
53	14, 52	pm2.61dane 3019	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝑝 ≠ 𝑋 ∧ 𝑝 ≠ 𝑌))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∃wrex 3060 class class class wbr 5144 ‘cfv 6543 (class class class)co 7413 Basecbs 17174 lecple 17234 joincjn 18297 Latclat 18417 Atomscatm 38787 HLchlt 38874 LHypclh 39509

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5281 ax-sep 5295 ax-nul 5302 ax-pow 5360 ax-pr 5424 ax-un 7735

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4320 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4905 df-iun 4994 df-br 5145 df-opab 5207 df-mpt 5228 df-id 5571 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7369 df-ov 7416 df-oprab 7417 df-proset 18281 df-poset 18299 df-plt 18316 df-lub 18332 df-glb 18333 df-join 18334 df-meet 18335 df-p0 18411 df-p1 18412 df-lat 18418 df-clat 18485 df-oposet 38700 df-ol 38702 df-oml 38703 df-covers 38790 df-ats 38791 df-atl 38822 df-cvlat 38846 df-hlat 38875 df-lhyp 39513

This theorem is referenced by: lhpexle2 39535

W3C validator