Theorem frlmip 21937

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 21909	. . . . . 6 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
5	4	ancoms 463	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
6		frlmphl.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
7	6	ressid 17308	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = 𝑅)
8		eqidd 2764	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
9	6	eqimssi 3997	. . . . . . . . . . . 12 ⊢ 𝐵 ⊆ (Base‘𝑅)
10	9	a1i 11	. . . . . . . . . . 11 ⊢ (𝑅 ∈ 𝑉 → 𝐵 ⊆ (Base‘𝑅))
11	8, 10	srasca 21310	. . . . . . . . . 10 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
12	7, 11	eqtr3d 2800	. . . . . . . . 9 ⊢ (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
13	12	oveq1d 7425	. . . . . . . 8 ⊢ (𝑅 ∈ 𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
14	13	adantl 486	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15		fvex 6894	. . . . . . . . 9 ⊢ ((subringAlg ‘𝑅)‘𝐵) ∈ V
16		rlmval 21321	. . . . . . . . . . . 12 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
17	6	fveq2i 6884	. . . . . . . . . . . 12 ⊢ ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
18	16, 17	eqtr4i 2789	. . . . . . . . . . 11 ⊢ (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
19	18	oveq1i 7420	. . . . . . . . . 10 ⊢ ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20		eqid 2763	. . . . . . . . . 10 ⊢ (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
21	19, 20	pwsval 17543	. . . . . . . . 9 ⊢ ((((subringAlg ‘𝑅)‘𝐵) ∈ V ∧ 𝐼 ∈ 𝑊) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
22	15, 21	mpan 702	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑊 → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
23	22	adantr 485	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
24	14, 23	eqtr4d 2801	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
25	1	fveq2i 6884	. . . . . . 7 ⊢ (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
26	25	a1i 11	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
27	24, 26	oveq12d 7428	. . . . 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 6885	. 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31		fvex 6894	. . . 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 17402	. . . 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 489	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
38		snex 5410	. . . . . . 7 ⊢ {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39		xpexg 7745	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
40	38, 39	mpan2 703	. . . . . 6 ⊢ (𝐼 ∈ 𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
41	40	adantr 485	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42		eqid 2763	. . . . 5 ⊢ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
43	15	snnz 4742	. . . . . 6 ⊢ {((subringAlg ‘𝑅)‘𝐵)} ≠ ∅
44		dmxp 5919	. . . . . 6 ⊢ ({((subringAlg ‘𝑅)‘𝐵)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
45	43, 44	mp1i 14	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
46	36, 37, 41, 42, 45, 33	prdsip 17518	. . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))))
47	36, 37, 41, 42, 45	prdsbas 17514	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48		eqidd 2764	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
49	9	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → 𝐵 ⊆ (Base‘𝑅))
50	48, 49	srabase 21307	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
51	6	a1i 11	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → 𝐵 = (Base‘𝑅))
52	15	fvconst2 7202	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
53	52	fveq2d 6885	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
54	50, 51, 53	3eqtr4rd 2809	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
55	54	adantl 486	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) ∧ 𝑥 ∈ 𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
56	55	ixpeq2dva 8906	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥 ∈ 𝐼 𝐵)
57	6	fvexi 6895	. . . . . . . 8 ⊢ 𝐵 ∈ V
58		ixpconstg 8900	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝐵 ∈ V) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
59	57, 58	mpan2 703	. . . . . . 7 ⊢ (𝐼 ∈ 𝑊 → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
60	59	adantr 485	. . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
61	47, 56, 60	3eqtrd 2802	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵 ↑m 𝐼))
62		frlmphl.t	. . . . . . . . . 10 ⊢ · = (.r‘𝑅)
63	52, 49	sraip 21312	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐼 → (.r‘𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
64	62, 63	eqtr2id 2811	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
65	64	oveqd 7427	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 → ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑔‘𝑥)))
66	65	mpteq2ia 5206	. . . . . . 7 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))
67	66	oveq2i 7421	. . . . . 6 ⊢ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))
68	67	a1i 11	. . . . 5 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)))) = (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))))
69	61, 61, 68	mpoeq123dv 7485	. . . 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 400   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  Vcvv 3455   ⊆ wss 3905  ∅c0 4286  {csn 4589   ↦ cmpt 5192   × cxp 5659  dom cdm 5661  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412   ↑_m cmap 8820  Xcixp 8891  Basecbs 17273   ↾_s cress 17294  ._rcmulr 17315  Scalarcsca 17317  ·_𝑖cip 17319   Σ_g cgsu 17497  X_scprds 17502   ↑_s cpws 17503  subringAlg csra 21301  ringLModcrglmod 21302   freeLMod cfrlm 21905

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-ixp 8892  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-nn 12238  df-2 12307  df-3 12308  df-4 12309  df-5 12310  df-6 12311  df-7 12312  df-8 12313  df-9 12314  df-n0 12509  df-z 12596  df-dec 12716  df-uz 12867  df-fz 13540  df-struct 17211  df-sets 17228  df-slot 17246  df-ndx 17258  df-base 17274  df-ress 17295  df-plusg 17327  df-mulr 17328  df-sca 17330  df-vsca 17331  df-ip 17332  df-tset 17333  df-ple 17334  df-ds 17336  df-hom 17338  df-cco 17339  df-prds 17504  df-pws 17506  df-sra 21303  df-rgmod 21304  df-dsmm 21891  df-frlm 21906

This theorem is used by:  frlmipval  21938  frlmphl  21940