Theorem cdlemg31d 41160

Description: Eliminate (𝐹‘𝑃) ≠ 𝑃 from cdlemg31c 41159. TODO: Prove directly. TODO: do we need to eliminate (𝐹‘𝑃) ≠ 𝑃? It might be better to do this all at once at the end. See also cdlemg29 41165 versus cdlemg28 41164. (Contributed by NM, 29-May-2013.)

Hypotheses

Ref	Expression
cdlemg12.l	⊢ ≤ = (le‘𝐾)
cdlemg12.j	⊢ ∨ = (join‘𝐾)
cdlemg12.m	⊢ ∧ = (meet‘𝐾)
cdlemg12.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg12.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg12.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg12b.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemg31.n	⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))

Assertion

Ref	Expression
cdlemg31d	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)

Proof of Theorem cdlemg31d

Step	Hyp	Ref	Expression
1		simp22r 1295	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑄 ≤ 𝑊)
2	1	adantr 480	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → ¬ 𝑄 ≤ 𝑊)
3		simpl1 1193	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4		simp21l 1292	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
5	4	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑃 ∈ 𝐴)
6		simp22l 1294	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
7	6	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑄 ∈ 𝐴)
8		simp23l 1296	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑣 ∈ 𝐴)
9	8	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑣 ∈ 𝐴)
10		simpl31 1256	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝐹 ∈ 𝑇)
11		cdlemg12.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
12		cdlemg12.j	. . . . . . . 8 ⊢ ∨ = (join‘𝐾)
13		cdlemg12.m	. . . . . . . 8 ⊢ ∧ = (meet‘𝐾)
14		cdlemg12.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
15		cdlemg12.h	. . . . . . . 8 ⊢ 𝐻 = (LHyp‘𝐾)
16		cdlemg12.t	. . . . . . . 8 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
17		cdlemg12b.r	. . . . . . . 8 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
18		cdlemg31.n	. . . . . . . 8 ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))
19	11, 12, 13, 14, 15, 16, 17, 18	cdlemg31b 41158	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑣 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇)) → 𝑁 ≤ (𝑄 ∨ (𝑅‘𝐹)))
20	3, 5, 7, 9, 10, 19	syl122anc 1382	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ≤ (𝑄 ∨ (𝑅‘𝐹)))
21		simpl21 1253	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
22		simpr 484	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝐹‘𝑃) = 𝑃)
23		eqid 2737	. . . . . . . . . 10 ⊢ (0.‘𝐾) = (0.‘𝐾)
24	11, 23, 14, 15, 16, 17	trl0 40630	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = (0.‘𝐾))
25	3, 21, 10, 22, 24	syl112anc 1377	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑅‘𝐹) = (0.‘𝐾))
26	25	oveq2d 7376	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (𝑅‘𝐹)) = (𝑄 ∨ (0.‘𝐾)))
27		simp1l 1199	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ HL)
28		hlol 39821	. . . . . . . . . 10 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
29	27, 28	syl 17	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ OL)
30	29	adantr 480	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝐾 ∈ OL)
31		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
32	31, 14	atbase 39749	. . . . . . . . 9 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
33	7, 32	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑄 ∈ (Base‘𝐾))
34	31, 12, 23	olj01 39685	. . . . . . . 8 ⊢ ((𝐾 ∈ OL ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑄 ∨ (0.‘𝐾)) = 𝑄)
35	30, 33, 34	syl2anc 585	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (0.‘𝐾)) = 𝑄)
36	26, 35	eqtrd 2772	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (𝑅‘𝐹)) = 𝑄)
37	20, 36	breqtrd 5112	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ≤ 𝑄)
38		hlatl 39820	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat)
39	27, 38	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ AtLat)
40	39	adantr 480	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝐾 ∈ AtLat)
41		simpl33 1258	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ∈ 𝐴)
42	11, 14	atcmp 39771	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑁 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑁 ≤ 𝑄 ↔ 𝑁 = 𝑄))
43	40, 41, 7, 42	syl3anc 1374	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑁 ≤ 𝑄 ↔ 𝑁 = 𝑄))
44	37, 43	mpbid 232	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 = 𝑄)
45	44	breq1d 5096	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑁 ≤ 𝑊 ↔ 𝑄 ≤ 𝑊))
46	2, 45	mtbird 325	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → ¬ 𝑁 ≤ 𝑊)
47		simpl1 1193	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
48		simpl21 1253	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
49		simpl22 1254	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
50		simpl23 1255	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊))
51		simpl31 1256	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝐹 ∈ 𝑇)
52		simpl32 1257	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝑣 ≠ (𝑅‘𝐹))
53		simpr 484	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝐹‘𝑃) ≠ 𝑃)
54		simpl33 1258	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝑁 ∈ 𝐴)
55	11, 12, 13, 14, 15, 16, 17, 18	cdlemg31c 41159	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ (𝐹‘𝑃) ≠ 𝑃 ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)
56	47, 48, 49, 50, 51, 52, 53, 54, 55	syl323anc 1403	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → ¬ 𝑁 ≤ 𝑊)
57	46, 56	pm2.61dane 3020	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933   class class class wbr 5086  ‘cfv 6492  (class class class)co 7360  Basecbs 17170  lecple 17218  joincjn 18268  meetcmee 18269  0.cp0 18378  OLcol 39634  Atomscatm 39723  AtLatcal 39724  HLchlt 39810  LHypclh 40444  LTrncltrn 40561  trLctrl 40618

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8768  df-proset 18251  df-poset 18270  df-plt 18285  df-lub 18301  df-glb 18302  df-join 18303  df-meet 18304  df-p0 18380  df-p1 18381  df-lat 18389  df-clat 18456  df-oposet 39636  df-ol 39638  df-oml 39639  df-covers 39726  df-ats 39727  df-atl 39758  df-cvlat 39782  df-hlat 39811  df-psubsp 39963  df-pmap 39964  df-padd 40256  df-lhyp 40448  df-laut 40449  df-ldil 40564  df-ltrn 40565  df-trl 40619

This theorem is referenced by:  cdlemg33b0  41161  cdlemg33a  41166