Theorem cdleme32f 41105

Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 20-Feb-2013.)

Hypotheses

Ref	Expression
cdleme32.b	⊢ 𝐵 = (Base‘𝐾)
cdleme32.l	⊢ ≤ = (le‘𝐾)
cdleme32.j	⊢ ∨ = (join‘𝐾)
cdleme32.m	⊢ ∧ = (meet‘𝐾)
cdleme32.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme32.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme32.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme32.c	⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme32.d	⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme32.e	⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdleme32.i	⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸))
cdleme32.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
cdleme32.o	⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
cdleme32.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))

Assertion

Ref	Expression
cdleme32f	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐹‘𝑋) ≤ (𝐹‘𝑌))

Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝑦,𝐶   𝐷,𝑠,𝑦,𝑧   𝑦,𝐸   𝐻,𝑠,𝑡   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝑁,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑋,𝑠,𝑡,𝑥,𝑧   𝑦,𝐻   𝑦,𝐾   𝑦,𝑌   𝑧,𝐻   𝑧,𝐾   𝑌,𝑠,𝑡,𝑥,𝑧

Allowed substitution hints:   𝐶(𝑥,𝑧,𝑡,𝑠)   𝐷(𝑥,𝑡)   𝐸(𝑥,𝑧,𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐻(𝑥)   𝐼(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐾(𝑥)   𝑁(𝑦,𝑡,𝑠)   𝑂(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑋(𝑦)

Proof of Theorem cdleme32f

Step	Hyp	Ref	Expression
1		simp11 1220	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp21r 1308	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → 𝑌 ∈ 𝐵)
3		simp23r 1312	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → ¬ 𝑌 ≤ 𝑊)
4		cdleme32.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
5		cdleme32.l	. . . 4 ⊢ ≤ = (le‘𝐾)
6		cdleme32.j	. . . 4 ⊢ ∨ = (join‘𝐾)
7		cdleme32.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
8		cdleme32.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdleme32.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
10	4, 5, 6, 7, 8, 9	lhpmcvr2 40683	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑌 ∈ 𝐵 ∧ ¬ 𝑌 ≤ 𝑊)) → ∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))
11	1, 2, 3, 10	syl12anc 849	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → ∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))
12		nfv 1941	. . 3 ⊢ Ⅎ𝑠(((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌)
13		cdleme32.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
14		nfcv 2931	. . . . . . 7 ⊢ Ⅎ𝑠𝐵
15		nfv 1941	. . . . . . . 8 ⊢ Ⅎ𝑠(𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊)
16		cdleme32.o	. . . . . . . . 9 ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
17		nfra1 3295	. . . . . . . . . 10 ⊢ Ⅎ𝑠∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))
18	17, 14	nfriota 7377	. . . . . . . . 9 ⊢ Ⅎ𝑠(℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
19	16, 18	nfcxfr 2929	. . . . . . . 8 ⊢ Ⅎ𝑠𝑂
20		nfcv 2931	. . . . . . . 8 ⊢ Ⅎ𝑠𝑥
21	15, 19, 20	nfif 4520	. . . . . . 7 ⊢ Ⅎ𝑠if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥)
22	14, 21	nfmpt 5210	. . . . . 6 ⊢ Ⅎ𝑠(𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
23	13, 22	nfcxfr 2929	. . . . 5 ⊢ Ⅎ𝑠𝐹
24		nfcv 2931	. . . . 5 ⊢ Ⅎ𝑠𝑋
25	23, 24	nffv 6889	. . . 4 ⊢ Ⅎ𝑠(𝐹‘𝑋)
26		nfcv 2931	. . . 4 ⊢ Ⅎ𝑠 ≤
27		nfcv 2931	. . . . 5 ⊢ Ⅎ𝑠𝑌
28	23, 27	nffv 6889	. . . 4 ⊢ Ⅎ𝑠(𝐹‘𝑌)
29	25, 26, 28	nfbr 5159	. . 3 ⊢ Ⅎ𝑠(𝐹‘𝑋) ≤ (𝐹‘𝑌)
30		simpl1 1208	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
31		simpl2 1209	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)))
32		simprl 782	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → 𝑠 ∈ 𝐴)
33		simprrl 792	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → ¬ 𝑠 ≤ 𝑊)
34	32, 33	jca 520	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊))
35		simprrr 793	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌)
36		simpl3 1210	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → 𝑋 ≤ 𝑌)
37		cdleme32.u	. . . . . 6 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
38		cdleme32.c	. . . . . 6 ⊢ 𝐶 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
39		cdleme32.d	. . . . . 6 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
40		cdleme32.e	. . . . . 6 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
41		cdleme32.i	. . . . . 6 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸))
42		cdleme32.n	. . . . . 6 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
43	4, 5, 6, 7, 8, 9, 37, 38, 39, 40, 41, 42, 16, 13	cdleme32e 41104	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌 ∧ 𝑋 ≤ 𝑌)) → (𝐹‘𝑋) ≤ (𝐹‘𝑌))
44	30, 31, 34, 35, 36, 43	syl113anc 1407	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌))) → (𝐹‘𝑋) ≤ (𝐹‘𝑌))
45	44	exp32 425	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝑠 ∈ 𝐴 → ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌) → (𝐹‘𝑋) ≤ (𝐹‘𝑌))))
46	12, 29, 45	rexlimd 3278	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (∃𝑠 ∈ 𝐴 (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑌 ∧ 𝑊)) = 𝑌) → (𝐹‘𝑋) ≤ (𝐹‘𝑌)))
47	11, 46	mpd 16	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑌 ≤ 𝑊)) ∧ 𝑋 ≤ 𝑌) → (𝐹‘𝑋) ≤ (𝐹‘𝑌))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ≠ wne 2964  ∀wral 3085  ∃wrex 3095  ifcif 4489   class class class wbr 5110   ↦ cmpt 5193  ‘cfv 6533  ℩crio 7364  (class class class)co 7408  Basecbs 17265  lecple 17313  joincjn 18363  meetcmee 18364  Atomscatm 39922  HLchlt 40009  LHypclh 40643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-riotaBAD 39612

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-iin 4960  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7982  df-2nd 7983  df-undef 8265  df-proset 18346  df-poset 18365  df-plt 18380  df-lub 18396  df-glb 18397  df-join 18398  df-meet 18399  df-p0 18475  df-p1 18476  df-lat 18484  df-clat 18551  df-oposet 39835  df-ol 39837  df-oml 39838  df-covers 39925  df-ats 39926  df-atl 39957  df-cvlat 39981  df-hlat 40010  df-llines 40157  df-lplanes 40158  df-lvols 40159  df-lines 40160  df-psubsp 40162  df-pmap 40163  df-padd 40455  df-lhyp 40647

This theorem is referenced by:  cdleme32le  41106