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 42045

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 41469	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ^◡𝐹 ∈ 𝑇)
7	1, 3, 6	syl2anc 596	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ^◡𝐹 ∈ 𝑇)
8	4, 5	ltrnco 42042	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ ^◡𝐹 ∈ 𝑇) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
9	1, 2, 7, 8	syl3anc 1399	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ^◡𝐹) ∈ 𝑇)
10		trlcoabs.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
11		trlcoabs.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11, 4, 5	ltrnel 41462	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
13	12	3adant2r 1198	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊))
14		trlcoabs.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
15		eqid 2763	. . . . 5 ⊢ (meet‘𝐾) = (meet‘𝐾)
16		trlcoabs.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
17	10, 14, 15, 11, 4, 5, 16	trlval2 41486	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
18	1, 9, 13, 17	syl3anc 1399	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐺 ∘ ^◡𝐹)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊))
19	18	oveq2d 7467	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ^◡𝐹))) = ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)))
20		simp1l 1216	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL)
21		simp3l 1220	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
22	10, 11, 4, 5	ltrnat 41463	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐹‘𝑃) ∈ 𝐴)
23	1, 3, 21, 22	syl3anc 1399	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ∈ 𝐴)
24	10, 11, 4, 5	ltrnat 41463	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ (𝐹‘𝑃) ∈ 𝐴) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
25	1, 9, 23, 24	syl3anc 1399	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴)
26		eqid 2763	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
27	26, 14, 11	hlatjcl 40690	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
28	20, 23, 25, 27	syl3anc 1399	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾))
29		simp1r 1217	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
30	26, 4	lhpbase 41321	. . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
31	29, 30	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾))
32	10, 14, 11	hlatlej1 40698	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) ∈ 𝐴) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
33	20, 23, 25, 32	syl3anc 1399	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))))
34	26, 10, 14, 15, 11	atmod3i1 41187	. . 3 ⊢ ((𝐾 ∈ HL ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ (𝐹‘𝑃) ≤ ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))) → ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)))
35	20, 23, 28, 31, 33, 34	syl131anc 1411	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)𝑊)) = (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)))
36	10, 11, 4, 5	ltrncoval 41468	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐺 ∘ ^◡𝐹) ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
37	1, 9, 3, 21, 36	syl121anc 1403	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))
38		coass 6290	. . . . . . . 8 ⊢ ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = (𝐺 ∘ (^◡𝐹 ∘ 𝐹))
39	26, 4, 5	ltrn1o 41447	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
40	1, 3, 39	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
41		f1ococnv1 6885	. . . . . . . . . . 11 ⊢ (𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
42	40, 41	syl 18	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (^◡𝐹 ∘ 𝐹) = ( I ↾ (Base‘𝐾)))
43	42	coeq2d 5851	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = (𝐺 ∘ ( I ↾ (Base‘𝐾))))
44	26, 4, 5	ltrn1o 41447	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
45	1, 2, 44	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
46		f1of 6854	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾))
47		fcoi1 6786	. . . . . . . . . 10 ⊢ (𝐺:(Base‘𝐾)⟶(Base‘𝐾) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
48	45, 46, 47	3syl 19	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ ( I ↾ (Base‘𝐾))) = 𝐺)
49	43, 48	eqtrd 2798	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺 ∘ (^◡𝐹 ∘ 𝐹)) = 𝐺)
50	38, 49	eqtrid 2810	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹) ∘ 𝐹) = 𝐺)
51	50	fveq1d 6918	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐺 ∘ ^◡𝐹) ∘ 𝐹)‘𝑃) = (𝐺‘𝑃))
52	37, 51	eqtr3d 2800	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)) = (𝐺‘𝑃))
53	52	oveq2d 7467	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
54		eqid 2763	. . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾)
55	10, 14, 54, 11, 4	lhpjat2 41344	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝐹‘𝑃) ∈ 𝐴 ∧ ¬ (𝐹‘𝑃) ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
56	1, 13, 55	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ 𝑊) = (1.‘𝐾))
57	53, 56	oveq12d 7469	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)))
58		hlol 40684	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OL)
59	20, 58	syl 18	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ OL)
60	10, 11, 4, 5	ltrnat 41463	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → (𝐺‘𝑃) ∈ 𝐴)
61	1, 2, 21, 60	syl3anc 1399	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐺‘𝑃) ∈ 𝐴)
62	26, 14, 11	hlatjcl 40690	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑃) ∈ 𝐴 ∧ (𝐺‘𝑃) ∈ 𝐴) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
63	20, 23, 61, 62	syl3anc 1399	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
64	26, 15, 54	olm11 40550	. . . 4 ⊢ ((𝐾 ∈ OL ∧ ((𝐹‘𝑃) ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
65	59, 63, 64	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ (𝐺‘𝑃))(meet‘𝐾)(1.‘𝐾)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
66	57, 65	eqtrd 2798	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹‘𝑃) ∨ ((𝐺 ∘ ^◡𝐹)‘(𝐹‘𝑃)))(meet‘𝐾)((𝐹‘𝑃) ∨ 𝑊)) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
67	19, 35, 66	3eqtrd 2802	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 2147 class class class wbr 5108 I cid 5552 ^◡ccnv 5657 ↾ cres 5660 ∘ ccom 5662 ⟶wf 6562 ⟶1-1ontowf1o 6565 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 lecple 17479 joincjn 18535 meetcmee 18536 1.cp1 18646 OLcol 40497 Atomscatm 40586 HLchlt 40673 LHypclh 41307 LTrncltrn 41424 trLctrl 41481

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-riotaBAD 40276

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-undef 8328 df-map 8887 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-p0 18647 df-p1 18648 df-lat 18656 df-clat 18723 df-oposet 40499 df-ol 40501 df-oml 40502 df-covers 40589 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-llines 40821 df-lplanes 40822 df-lvols 40823 df-lines 40824 df-psubsp 40826 df-pmap 40827 df-padd 41119 df-lhyp 41311 df-laut 41312 df-ldil 41427 df-ltrn 41428 df-trl 41482

This theorem is used by: cdlemkfid1N 42244

W3C validator