cdlemg42 - Mathbox for Norm Megill

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

Theorem cdlemg42 36017

Description: Part of proof of Lemma G of [Crawley] p. 116, first line of third paragraph on p. 117. (Contributed by NM, 3-Jun-2013.)

**Hypotheses**
Ref	Expression
cdlemg42.l	⊢ ≤ = (le‘𝐾)
cdlemg42.j	⊢ ∨ = (join‘𝐾)
cdlemg42.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg42.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg42.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg42.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
cdlemg42	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ¬ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃)))

**Proof of Theorem cdlemg42**
Step	Hyp	Ref	Expression
1		simp33 1099	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝑅‘𝐹) ≠ (𝑅‘𝐺))
2		simpl1l 1112	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝐾 ∈ HL)
3		simp31l 1184	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → 𝑃 ∈ 𝐴)
4	3	adantr 481	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝑃 ∈ 𝐴)
5		simp1 1061	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6		simp2l 1087	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → 𝐹 ∈ 𝑇)
7		cdlemg42.l	. . . . . . . . . . . 12 ⊢ ≤ = (le‘𝐾)
8		cdlemg42.a	. . . . . . . . . . . 12 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdlemg42.h	. . . . . . . . . . . 12 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdlemg42.t	. . . . . . . . . . . 12 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11	7, 8, 9, 10	ltrnat 35426	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴)
12	5, 6, 3, 11	syl3anc 1326	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝐹‘𝑃) ∈ 𝐴)
13	12	adantr 481	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐹‘𝑃) ∈ 𝐴)
14		cdlemg42.j	. . . . . . . . . 10 ⊢ ∨ = (join‘𝐾)
15	7, 14, 8	hlatlej1 34661	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ (𝐹‘𝑃) ∈ 𝐴) → 𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)))
16	2, 4, 13, 15	syl3anc 1326	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)))
17		simpr 477	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃)))
18		hllat 34650	. . . . . . . . . 10 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
19	2, 18	syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝐾 ∈ Lat)
20		eqid 2622	. . . . . . . . . . 11 ⊢ (Base‘𝐾) = (Base‘𝐾)
21	20, 8	atbase 34576	. . . . . . . . . 10 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
22	4, 21	syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝑃 ∈ (Base‘𝐾))
23		simp2r 1088	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → 𝐺 ∈ 𝑇)
24	7, 8, 9, 10	ltrnat 35426	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐺‘𝑃) ∈ 𝐴)
25	5, 23, 3, 24	syl3anc 1326	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝐺‘𝑃) ∈ 𝐴)
26	25	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐺‘𝑃) ∈ 𝐴)
27	20, 8	atbase 34576	. . . . . . . . . 10 ⊢ ((𝐺‘𝑃) ∈ 𝐴 → (𝐺‘𝑃) ∈ (Base‘𝐾))
28	26, 27	syl 17	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐺‘𝑃) ∈ (Base‘𝐾))
29	20, 14, 8	hlatjcl 34653	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ (𝐹‘𝑃) ∈ 𝐴) → (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾))
30	2, 4, 13, 29	syl3anc 1326	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾))
31	20, 7, 14	latjle12 17062	. . . . . . . . 9 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ (𝐺‘𝑃) ∈ (Base‘𝐾) ∧ (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) ↔ (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ (𝐹‘𝑃))))
32	19, 22, 28, 30, 31	syl13anc 1328	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → ((𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) ↔ (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ (𝐹‘𝑃))))
33	16, 17, 32	mpbi2and 956	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ (𝐹‘𝑃)))
34		simpl32 1143	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐺‘𝑃) ≠ 𝑃)
35	34	necomd 2849	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝑃 ≠ (𝐺‘𝑃))
36	7, 14, 8	ps-1 34763	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ (𝐺‘𝑃) ∈ 𝐴 ∧ 𝑃 ≠ (𝐺‘𝑃)) ∧ (𝑃 ∈ 𝐴 ∧ (𝐹‘𝑃) ∈ 𝐴)) → ((𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ (𝐹‘𝑃)) ↔ (𝑃 ∨ (𝐺‘𝑃)) = (𝑃 ∨ (𝐹‘𝑃))))
37	2, 4, 26, 35, 4, 13, 36	syl132anc 1344	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → ((𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ (𝐹‘𝑃)) ↔ (𝑃 ∨ (𝐺‘𝑃)) = (𝑃 ∨ (𝐹‘𝑃))))
38	33, 37	mpbid 222	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑃 ∨ (𝐺‘𝑃)) = (𝑃 ∨ (𝐹‘𝑃)))
39	38	oveq1d 6665	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → ((𝑃 ∨ (𝐺‘𝑃))(meet‘𝐾)𝑊) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊))
40		simpl1 1064	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
41		simpl2r 1115	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝐺 ∈ 𝑇)
42		simpl31 1142	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
43		eqid 2622	. . . . . . 7 ⊢ (meet‘𝐾) = (meet‘𝐾)
44		cdlemg42.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
45	7, 14, 43, 8, 9, 10, 44	trlval2 35450	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐺) = ((𝑃 ∨ (𝐺‘𝑃))(meet‘𝐾)𝑊))
46	40, 41, 42, 45	syl3anc 1326	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑅‘𝐺) = ((𝑃 ∨ (𝐺‘𝑃))(meet‘𝐾)𝑊))
47		simpl2l 1114	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → 𝐹 ∈ 𝑇)
48	7, 14, 43, 8, 9, 10, 44	trlval2 35450	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊))
49	40, 47, 42, 48	syl3anc 1326	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑅‘𝐹) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊))
50	39, 46, 49	3eqtr4rd 2667	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))) → (𝑅‘𝐹) = (𝑅‘𝐺))
51	50	ex 450	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ((𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃)) → (𝑅‘𝐹) = (𝑅‘𝐺)))
52	51	necon3ad 2807	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ((𝑅‘𝐹) ≠ (𝑅‘𝐺) → ¬ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃))))
53	1, 52	mpd 15	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ¬ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 lecple 15948 joincjn 16944 meetcmee 16945 Latclat 17045 Atomscatm 34550 HLchlt 34637 LHypclh 35270 LTrncltrn 35387 trLctrl 35445

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-map 7859 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-lat 17046 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-lhyp 35274 df-laut 35275 df-ldil 35390 df-ltrn 35391 df-trl 35446

This theorem is referenced by: cdlemg43 36018

W3C validator