Theorem cdlemg31d 40694

Description: Eliminate (𝐹‘𝑃) ≠ 𝑃 from cdlemg31c 40693. 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 40699 versus cdlemg28 40698. (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 1294	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑄 ≤ 𝑊)
2	1	adantr 480	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → ¬ 𝑄 ≤ 𝑊)
3		simpl1 1192	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
4		simp21l 1291	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
5	4	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑃 ∈ 𝐴)
6		simp22l 1293	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
7	6	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑄 ∈ 𝐴)
8		simp23l 1295	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝑣 ∈ 𝐴)
9	8	adantr 480	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑣 ∈ 𝐴)
10		simpl31 1255	. . . . . . 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 40692	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑣 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇)) → 𝑁 ≤ (𝑄 ∨ (𝑅‘𝐹)))
20	3, 5, 7, 9, 10, 19	syl122anc 1381	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ≤ (𝑄 ∨ (𝑅‘𝐹)))
21		simpl21 1252	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
22		simpr 484	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝐹‘𝑃) = 𝑃)
23		eqid 2729	. . . . . . . . . 10 ⊢ (0.‘𝐾) = (0.‘𝐾)
24	11, 23, 14, 15, 16, 17	trl0 40164	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = (0.‘𝐾))
25	3, 21, 10, 22, 24	syl112anc 1376	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑅‘𝐹) = (0.‘𝐾))
26	25	oveq2d 7403	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (𝑅‘𝐹)) = (𝑄 ∨ (0.‘𝐾)))
27		simp1l 1198	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ HL)
28		hlol 39354	. . . . . . . . . 10 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
29	27, 28	syl 17	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ OL)
30	29	adantr 480	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝐾 ∈ OL)
31		eqid 2729	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
32	31, 14	atbase 39282	. . . . . . . . 9 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
33	7, 32	syl 17	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑄 ∈ (Base‘𝐾))
34	31, 12, 23	olj01 39218	. . . . . . . 8 ⊢ ((𝐾 ∈ OL ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑄 ∨ (0.‘𝐾)) = 𝑄)
35	30, 33, 34	syl2anc 584	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (0.‘𝐾)) = 𝑄)
36	26, 35	eqtrd 2764	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑄 ∨ (𝑅‘𝐹)) = 𝑄)
37	20, 36	breqtrd 5133	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ≤ 𝑄)
38		hlatl 39353	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat)
39	27, 38	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → 𝐾 ∈ AtLat)
40	39	adantr 480	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝐾 ∈ AtLat)
41		simpl33 1257	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 ∈ 𝐴)
42	11, 14	atcmp 39304	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑁 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑁 ≤ 𝑄 ↔ 𝑁 = 𝑄))
43	40, 41, 7, 42	syl3anc 1373	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑁 ≤ 𝑄 ↔ 𝑁 = 𝑄))
44	37, 43	mpbid 232	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → 𝑁 = 𝑄)
45	44	breq1d 5117	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → (𝑁 ≤ 𝑊 ↔ 𝑄 ≤ 𝑊))
46	2, 45	mtbird 325	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) = 𝑃) → ¬ 𝑁 ≤ 𝑊)
47		simpl1 1192	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
48		simpl21 1252	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
49		simpl22 1253	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
50		simpl23 1254	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊))
51		simpl31 1255	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝐹 ∈ 𝑇)
52		simpl32 1256	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝑣 ≠ (𝑅‘𝐹))
53		simpr 484	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → (𝐹‘𝑃) ≠ 𝑃)
54		simpl33 1257	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → 𝑁 ∈ 𝐴)
55	11, 12, 13, 14, 15, 16, 17, 18	cdlemg31c 40693	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ (𝐹‘𝑃) ≠ 𝑃 ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)
56	47, 48, 49, 50, 51, 52, 53, 54, 55	syl323anc 1402	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) ∧ (𝐹‘𝑃) ≠ 𝑃) → ¬ 𝑁 ≤ 𝑊)
57	46, 56	pm2.61dane 3012	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925   class class class wbr 5107  ‘cfv 6511  (class class class)co 7387  Basecbs 17179  lecple 17227  joincjn 18272  meetcmee 18273  0.cp0 18382  OLcol 39167  Atomscatm 39256  AtLatcal 39257  HLchlt 39343  LHypclh 39978  LTrncltrn 40095  trLctrl 40152

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-map 8801  df-proset 18255  df-poset 18274  df-plt 18289  df-lub 18305  df-glb 18306  df-join 18307  df-meet 18308  df-p0 18384  df-p1 18385  df-lat 18391  df-clat 18458  df-oposet 39169  df-ol 39171  df-oml 39172  df-covers 39259  df-ats 39260  df-atl 39291  df-cvlat 39315  df-hlat 39344  df-psubsp 39497  df-pmap 39498  df-padd 39790  df-lhyp 39982  df-laut 39983  df-ldil 40098  df-ltrn 40099  df-trl 40153

This theorem is referenced by:  cdlemg33b0  40695  cdlemg33a  40700