Theorem frlmip 22111

Description: The inner product of a free module. (Contributed by Thierry Arnoux, 20-Jun-2019.)

Hypotheses

Ref	Expression
frlmphl.y	⊢ 𝑌 = (𝑅 freeLMod 𝐼)
frlmphl.b	⊢ 𝐵 = (Base‘𝑅)
frlmphl.t	⊢ · = (.r‘𝑅)

Assertion

Ref	Expression
frlmip	⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝑌))

Distinct variable groups:   𝐵,𝑓,𝑔,𝑥   𝑓,𝐼,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑓,𝑉,𝑔,𝑥   𝑓,𝑊,𝑔,𝑥

Allowed substitution hints:   · (𝑥, 𝑓, 𝑔)   𝑌(𝑥, 𝑓, 𝑔)

Proof of Theorem frlmip

Step	Hyp	Ref	Expression
1		frlmphl.y	. . . 4 ⊢ 𝑌 = (𝑅 freeLMod 𝐼)
2		eqid 2763	. . . . . . 7 ⊢ (𝑅 freeLMod 𝐼) = (𝑅 freeLMod 𝐼)
3		eqid 2763	. . . . . . 7 ⊢ (Base‘(𝑅 freeLMod 𝐼)) = (Base‘(𝑅 freeLMod 𝐼))
4	2, 3	frlmpws 22083	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
5	4	ancoms 464	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
6		frlmphl.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
7	6	ressid 17448	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = 𝑅)
8		eqidd 2764	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
9	6	eqimssi 3973	. . . . . . . . . . . 12 ⊢ 𝐵 ⊆ (Base‘𝑅)
10	9	a1i 11	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → 𝐵 ⊆ (Base‘𝑅))
11	8, 10	srasca 21482	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
12	7, 11	eqtr3d 2800	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
13	12	oveq1d 7455	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
14	13	adantl 487	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15		fvex 6918	. . . . . . . . 9 ⊢ ((subringAlg ‘𝑅)‘𝐵) ∈ V
16		rlmval 21493	. . . . . . . . . . . 12 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
17	6	fveq2i 6908	. . . . . . . . . . . 12 ⊢ ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
18	16, 17	eqtr4i 2789	. . . . . . . . . . 11 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
19	18	oveq1i 7450	. . . . . . . . . 10 ⊢ ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20		eqid 2763	. . . . . . . . . 10 ⊢ (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
21	19, 20	pwsval 17683	. . . . . . . . 9 ⊢ ((((subringAlg ‘𝑅)‘𝐵) ∈ V ∧ 𝐼 ∈ 𝑊) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
22	15, 21	mpan 703	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑊 → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
23	22	adantr 486	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
24	14, 23	eqtr4d 2801	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
25	1	fveq2i 6908	. . . . . . 7 ⊢ (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
26	25	a1i 11	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
27	24, 26	oveq12d 7458	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
28	5, 27	eqtr4d 2801	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
29	1, 28	eqtrid 2810	. . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑌 = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
30	29	fveq2d 6909	. 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31		fvex 6918	. . . 4 ⊢ (Base‘𝑌) ∈ V
32		eqid 2763	. . . . 5 ⊢ ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))
33		eqid 2763	. . . . 5 ⊢ (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
34	32, 33	ressip 17542	. . . 4 ⊢ ((Base‘𝑌) ∈ V → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
35	31, 34	ax-mp 5	. . 3 ⊢ (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
36		eqid 2763	. . . . 5 ⊢ (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))
37		simpr 490	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
38		snex 5401	. . . . . . 7 ⊢ {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39		xpexg 7785	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
40	38, 39	mpan2 704	. . . . . 6 ⊢ (𝐼 ∈ 𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
41	40	adantr 486	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42		eqid 2763	. . . . 5 ⊢ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
43	15	snnz 4737	. . . . . 6 ⊢ {((subringAlg ‘𝑅)‘𝐵)} ≠ ∅
44		dmxp 5917	. . . . . 6 ⊢ ({((subringAlg ‘𝑅)‘𝐵)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
45	43, 44	mp1i 14	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
46	36, 37, 41, 42, 45, 33	prdsip 17658	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))))
47	36, 37, 41, 42, 45	prdsbas 17654	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48		eqidd 2764	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
49	9	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → 𝐵 ⊆ (Base‘𝑅))
50	48, 49	srabase 21479	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
51	6	a1i 11	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → 𝐵 = (Base‘𝑅))
52	15	fvconst2 7230	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
53	52	fveq2d 6909	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
54	50, 51, 53	3eqtr4rd 2809	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
55	54	adantl 487	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) ∧ 𝑥 ∈ 𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
56	55	ixpeq2dva 8965	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥 ∈ 𝐼 𝐵)
57	6	fvexi 6919	. . . . . . . 8 ⊢ 𝐵 ∈ V
58		ixpconstg 8959	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝐵 ∈ V) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
59	57, 58	mpan2 704	. . . . . . 7 ⊢ (𝐼 ∈ 𝑊 → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
60	59	adantr 486	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
61	47, 56, 60	3eqtrd 2802	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵 ↑m 𝐼))
62		frlmphl.t	. . . . . . . . . 10 ⊢ · = (.r‘𝑅)
63	52, 49	sraip 21484	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → (.r‘𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
64	62, 63	eqtr2id 2811	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
65	64	oveqd 7457	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑔‘𝑥)))
66	65	mpteq2ia 5203	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))
67	66	oveq2i 7451	. . . . . 6 ⊢ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))
68	67	a1i 11	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))))
69	61, 61, 68	mpoeq123dv 7515	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
70	46, 69	eqtrd 2798	. . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
71	35, 70	eqtr3id 2812	. 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
72	30, 71	eqtr2d 2799	1 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  {csn 4588   ↦ cmpt 5189   × cxp 5653  dom cdm 5655  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442   ↑_m cmap 8872  Xcixp 8950  Basecbs 17413   ↾_s cress 17434  ._rcmulr 17455  Scalarcsca 17457  ·_𝑖cip 17459   Σ_g cgsu 17637  X_scprds 17642   ↑_s cpws 17643  subringAlg csra 21473  ringLModcrglmod 21474   freeLMod cfrlm 22079

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301

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-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-ixp 8951  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-sup 9458  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-fz 13664  df-struct 17351  df-sets 17368  df-slot 17386  df-ndx 17398  df-base 17414  df-ress 17435  df-plusg 17467  df-mulr 17468  df-sca 17470  df-vsca 17471  df-ip 17472  df-tset 17473  df-ple 17474  df-ds 17476  df-hom 17478  df-cco 17479  df-prds 17644  df-pws 17646  df-sra 21475  df-rgmod 21476  df-dsmm 22065  df-frlm 22080

This theorem is used by:  frlmipval  22112  frlmphl  22114