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 41595

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 41019	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
7	1, 3, 6	syl2anc 596	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ^◡𝐹 ∈ 𝑇)
8	4, 5	ltrnco 41592	. . . . 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 41012	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
13	12	3adant2r 1198	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
14		trlcoabs.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
15		eqid 2760	. . . . 5 ⊢ (meet‘𝐾) = (meet‘𝐾)
16		trlcoabs.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
17	10, 14, 15, 11, 4, 5, 16	trlval2 41036	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
18	1, 9, 13, 17	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
19	18	oveq2d 7429	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ^◡𝐹))) = ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)))
20		simp1l 1216	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL)
21		simp3l 1220	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
22	10, 11, 4, 5	ltrnat 41013	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴)
23	1, 3, 21, 22	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ∈ 𝐴)
24	10, 11, 4, 5	ltrnat 41013	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ (𝐹‘𝑃) ∈ 𝐴) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
25	1, 9, 23, 24	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
26		eqid 2760	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
27	26, 14, 11	hlatjcl 40240	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
28	20, 23, 25, 27	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
29		simp1r 1217	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
30	26, 4	lhpbase 40871	. . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
31	29, 30	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾))
32	10, 14, 11	hlatlej1 40248	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
33	20, 23, 25, 32	syl3anc 1398	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
34	26, 10, 14, 15, 11	atmod3i1 40737	. . 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 41018	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
37	1, 9, 3, 21, 36	syl121anc 1402	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
38		coass 6262	. . . . . . . 8 ⊢ ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = (𝐺 ∘ (^◡𝐹 ∘ 𝐹))
39	26, 4, 5	ltrn1o 40997	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
40	1, 3, 39	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
41		f1ococnv1 6847	. . . . . . . . . . 11 ⊢ (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
42	40, 41	syl 18	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
43	42	coeq2d 5842	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = (𝐺 ∘ ( I ↾ (Base‘𝐾))))
44	26, 4, 5	ltrn1o 40997	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
45	1, 2, 44	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
46		f1of 6817	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
47		fcoi1 6749	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
48	45, 46, 47	3syl 19	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
49	43, 48	eqtrd 2795	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = 𝐺)
50	38, 49	eqtrid 2807	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = 𝐺)
51	50	fveq1d 6880	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = (𝐺‘𝑃))
52	37, 51	eqtr3d 2797	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) = (𝐺‘𝑃))
53	52	oveq2d 7429	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
54		eqid 2760	. . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾)
55	10, 14, 54, 11, 4	lhpjat2 40894	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
56	1, 13, 55	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
57	53, 56	oveq12d 7431	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)))
58		hlol 40234	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
59	20, 58	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ OL)
60	10, 11, 4, 5	ltrnat 41013	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐺‘𝑃) ∈ 𝐴)
61	1, 2, 21, 60	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺‘𝑃) ∈ 𝐴)
62	26, 14, 11	hlatjcl 40240	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ (𝐺‘𝑃) ∈ 𝐴) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
63	20, 23, 61, 62	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
64	26, 15, 54	olm11 40100	. . . 4 ⊢ ((𝐾 ∈ OL ∧ ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
65	59, 63, 64	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
66	57, 65	eqtrd 2795	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
67	19, 35, 66	3eqtrd 2799	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 5549 ^◡ccnv 5654 ↾ cres 5657 ∘ ccom 5659 ⟶wf 6529 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 lecple 17349 joincjn 18399 meetcmee 18400 1.cp1 18510 OLcol 40047 Atomscatm 40136 HLchlt 40223 LHypclh 40857 LTrncltrn 40974 trLctrl 41031

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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-riotaBAD 39826

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 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 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-undef 8271 df-map 8828 df-proset 18382 df-poset 18401 df-plt 18416 df-lub 18432 df-glb 18433 df-join 18434 df-meet 18435 df-p0 18511 df-p1 18512 df-lat 18520 df-clat 18587 df-oposet 40049 df-ol 40051 df-oml 40052 df-covers 40139 df-ats 40140 df-atl 40171 df-cvlat 40195 df-hlat 40224 df-llines 40371 df-lplanes 40372 df-lvols 40373 df-lines 40374 df-psubsp 40376 df-pmap 40377 df-padd 40669 df-lhyp 40861 df-laut 40862 df-ldil 40977 df-ltrn 40978 df-trl 41032

This theorem is used by: cdlemkfid1N 41794

W3C validator