Theorem frlmip 21990

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 2762	. . . . . . 7 ⊢ (𝑅 freeLMod 𝐼) = (𝑅 freeLMod 𝐼)
3		eqid 2762	. . . . . . 7 ⊢ (Base‘(𝑅 freeLMod 𝐼)) = (Base‘(𝑅 freeLMod 𝐼))
4	2, 3	frlmpws 21962	. . . . . 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 17338	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = 𝑅)
8		eqidd 2763	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
9	6	eqimssi 3994	. . . . . . . . . . . 12 ⊢ 𝐵 ⊆ (Base‘𝑅)
10	9	a1i 11	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → 𝐵 ⊆ (Base‘𝑅))
11	8, 10	srasca 21363	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
12	7, 11	eqtr3d 2799	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
13	12	oveq1d 7431	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
14	13	adantl 487	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15		fvex 6895	. . . . . . . . 9 ⊢ ((subringAlg ‘𝑅)‘𝐵) ∈ V
16		rlmval 21374	. . . . . . . . . . . 12 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
17	6	fveq2i 6885	. . . . . . . . . . . 12 ⊢ ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
18	16, 17	eqtr4i 2788	. . . . . . . . . . 11 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
19	18	oveq1i 7426	. . . . . . . . . 10 ⊢ ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20		eqid 2762	. . . . . . . . . 10 ⊢ (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
21	19, 20	pwsval 17573	. . . . . . . . 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 2800	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
25	1	fveq2i 6885	. . . . . . 7 ⊢ (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
26	25	a1i 11	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
27	24, 26	oveq12d 7434	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
28	5, 27	eqtr4d 2800	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
29	1, 28	eqtrid 2809	. . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑌 = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
30	29	fveq2d 6886	. 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31		fvex 6895	. . . 4 ⊢ (Base‘𝑌) ∈ V
32		eqid 2762	. . . . 5 ⊢ ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))
33		eqid 2762	. . . . 5 ⊢ (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
34	32, 33	ressip 17432	. . . 4 ⊢ ((Base‘𝑌) ∈ V → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
35	31, 34	ax-mp 5	. . 3 ⊢ (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
36		eqid 2762	. . . . 5 ⊢ (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))
37		simpr 490	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
38		snex 5408	. . . . . . 7 ⊢ {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39		xpexg 7752	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
40	38, 39	mpan2 704	. . . . . 6 ⊢ (𝐼 ∈ 𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
41	40	adantr 486	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42		eqid 2762	. . . . 5 ⊢ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
43	15	snnz 4740	. . . . . 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 17548	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))))
47	36, 37, 41, 42, 45	prdsbas 17544	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48		eqidd 2763	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
49	9	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → 𝐵 ⊆ (Base‘𝑅))
50	48, 49	srabase 21360	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
51	6	a1i 11	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → 𝐵 = (Base‘𝑅))
52	15	fvconst2 7206	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
53	52	fveq2d 6886	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
54	50, 51, 53	3eqtr4rd 2808	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
55	54	adantl 487	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) ∧ 𝑥 ∈ 𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
56	55	ixpeq2dva 8922	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥 ∈ 𝐼 𝐵)
57	6	fvexi 6896	. . . . . . . 8 ⊢ 𝐵 ∈ V
58		ixpconstg 8916	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝐵 ∈ V) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
59	57, 58	mpan2 704	. . . . . . 7 ⊢ (𝐼 ∈ 𝑊 → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
60	59	adantr 486	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
61	47, 56, 60	3eqtrd 2801	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵 ↑m 𝐼))
62		frlmphl.t	. . . . . . . . . 10 ⊢ · = (.r‘𝑅)
63	52, 49	sraip 21365	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → (.r‘𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
64	62, 63	eqtr2id 2810	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
65	64	oveqd 7433	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑔‘𝑥)))
66	65	mpteq2ia 5204	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))
67	66	oveq2i 7427	. . . . . 6 ⊢ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))
68	67	a1i 11	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))))
69	61, 61, 68	mpoeq123dv 7491	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
70	46, 69	eqtrd 2797	. . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
71	35, 70	eqtr3id 2811	. 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
72	30, 71	eqtr2d 2798	1 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  {csn 4587   ↦ cmpt 5190   × cxp 5657  dom cdm 5659  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418   ↑_m cmap 8829  Xcixp 8907  Basecbs 17303   ↾_s cress 17324  ._rcmulr 17345  Scalarcsca 17347  ·_𝑖cip 17349   Σ_g cgsu 17527  X_scprds 17532   ↑_s cpws 17533  subringAlg csra 21354  ringLModcrglmod 21355   freeLMod cfrlm 21958

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-er 8699  df-map 8831  df-ixp 8908  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-sup 9415  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-nn 12259  df-2 12328  df-3 12329  df-4 12330  df-5 12331  df-6 12332  df-7 12333  df-8 12334  df-9 12335  df-n0 12530  df-z 12617  df-dec 12738  df-uz 12889  df-fz 13562  df-struct 17241  df-sets 17258  df-slot 17276  df-ndx 17288  df-base 17304  df-ress 17325  df-plusg 17357  df-mulr 17358  df-sca 17360  df-vsca 17361  df-ip 17362  df-tset 17363  df-ple 17364  df-ds 17366  df-hom 17368  df-cco 17369  df-prds 17534  df-pws 17536  df-sra 21356  df-rgmod 21357  df-dsmm 21944  df-frlm 21959

This theorem is used by:  frlmipval  21991  frlmphl  21993