trlcoabs2N - Mathbox for Norm Megill

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

Theorem trlcoabs2N 41759

Description: Absorption of the trace of a composition. (Contributed by NM, 29-Jul-2013.) (New usage is discouraged.)

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

**Assertion**
Ref	Expression
trlcoabs2N	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ^◡𝐹))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))

**Proof of Theorem trlcoabs2N**
Step	Hyp	Ref	Expression
1		simp1 1154	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp2r 1219	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
3		simp2l 1218	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
4		trlcoabs.h	. . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾)
5		trlcoabs.t	. . . . . . 7 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
6	4, 5	ltrncnv 41183	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
7	1, 3, 6	syl2anc 596	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ^◡𝐹 ∈ 𝑇)
8	4, 5	ltrnco 41756	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ ^◡𝐹 ∈ 𝑇) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
9	1, 2, 7, 8	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
10		trlcoabs.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
11		trlcoabs.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11, 4, 5	ltrnel 41176	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
13	12	3adant2r 1198	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
14		trlcoabs.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
15		eqid 2761	. . . . 5 ⊢ (meet‘𝐾) = (meet‘𝐾)
16		trlcoabs.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
17	10, 14, 15, 11, 4, 5, 16	trlval2 41200	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
18	1, 9, 13, 17	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
19	18	oveq2d 7434	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ^◡𝐹))) = ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)))
20		simp1l 1216	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL)
21		simp3l 1220	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
22	10, 11, 4, 5	ltrnat 41177	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴)
23	1, 3, 21, 22	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ∈ 𝐴)
24	10, 11, 4, 5	ltrnat 41177	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ (𝐹‘𝑃) ∈ 𝐴) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
25	1, 9, 23, 24	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
26		eqid 2761	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
27	26, 14, 11	hlatjcl 40404	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
28	20, 23, 25, 27	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
29		simp1r 1217	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
30	26, 4	lhpbase 41035	. . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
31	29, 30	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾))
32	10, 14, 11	hlatlej1 40412	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
33	20, 23, 25, 32	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
34	26, 10, 14, 15, 11	atmod3i1 40901	. . 3 ⊢ ((𝐾 ∈ HL ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))) → ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)))
35	20, 23, 28, 31, 33, 34	syl131anc 1410	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)))
36	10, 11, 4, 5	ltrncoval 41182	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
37	1, 9, 3, 21, 36	syl121anc 1402	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
38		coass 6266	. . . . . . . 8 ⊢ ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = (𝐺 ∘ (^◡𝐹 ∘ 𝐹))
39	26, 4, 5	ltrn1o 41161	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
40	1, 3, 39	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
41		f1ococnv1 6852	. . . . . . . . . . 11 ⊢ (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
42	40, 41	syl 18	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
43	42	coeq2d 5840	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = (𝐺 ∘ ( I ↾ (Base‘𝐾))))
44	26, 4, 5	ltrn1o 41161	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
45	1, 2, 44	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
46		f1of 6822	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
47		fcoi1 6754	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
48	45, 46, 47	3syl 19	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
49	43, 48	eqtrd 2796	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = 𝐺)
50	38, 49	eqtrid 2808	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = 𝐺)
51	50	fveq1d 6885	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = (𝐺‘𝑃))
52	37, 51	eqtr3d 2798	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) = (𝐺‘𝑃))
53	52	oveq2d 7434	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
54		eqid 2761	. . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾)
55	10, 14, 54, 11, 4	lhpjat2 41058	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
56	1, 13, 55	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
57	53, 56	oveq12d 7436	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)))
58		hlol 40398	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
59	20, 58	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ OL)
60	10, 11, 4, 5	ltrnat 41177	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐺‘𝑃) ∈ 𝐴)
61	1, 2, 21, 60	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺‘𝑃) ∈ 𝐴)
62	26, 14, 11	hlatjcl 40404	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ (𝐺‘𝑃) ∈ 𝐴) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
63	20, 23, 61, 62	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
64	26, 15, 54	olm11 40264	. . . 4 ⊢ ((𝐾 ∈ OL ∧ ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
65	59, 63, 64	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
66	57, 65	eqtrd 2796	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
67	19, 35, 66	3eqtrd 2800	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ^◡𝐹))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 I cid 5545 ^◡ccnv 5650 ↾ cres 5653 ∘ ccom 5655 ⟶wf 6533 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7418 Basecbs 17380 lecple 17428 joincjn 18478 meetcmee 18479 1.cp1 18589 OLcol 40211 Atomscatm 40300 HLchlt 40387 LHypclh 41021 LTrncltrn 41138 trLctrl 41195

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-riotaBAD 39990

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-undef 8283 df-map 8842 df-proset 18461 df-poset 18480 df-plt 18495 df-lub 18511 df-glb 18512 df-join 18513 df-meet 18514 df-p0 18590 df-p1 18591 df-lat 18599 df-clat 18666 df-oposet 40213 df-ol 40215 df-oml 40216 df-covers 40303 df-ats 40304 df-atl 40335 df-cvlat 40359 df-hlat 40388 df-llines 40535 df-lplanes 40536 df-lvols 40537 df-lines 40538 df-psubsp 40540 df-pmap 40541 df-padd 40833 df-lhyp 41025 df-laut 41026 df-ldil 41141 df-ltrn 41142 df-trl 41196

This theorem is used by: cdlemkfid1N 41958

W3C validator