imasvsca - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > imasvsca		Structured version Visualization version GIF version

Theorem imasvsca 17463

Description: The scalar multiplication operation of an image structure. (Contributed by Mario Carneiro, 23-Feb-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.)

**Hypotheses**
Ref	Expression
imasbas.u	⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
imasbas.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imasbas.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasbas.r	⊢ (𝜑 → 𝑅 ∈ 𝑍)
imassca.g	⊢ 𝐺 = (Scalar‘𝑅)
imasvsca.k	⊢ 𝐾 = (Base‘𝐺)
imasvsca.q	⊢ · = ( ·_𝑠 ‘𝑅)
imasvsca.s	⊢ ∙ = ( ·_𝑠 ‘𝑈)

**Assertion**
Ref	Expression
imasvsca	⊢ (𝜑 → ∙ = ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))))

Distinct variable groups: 𝑞,𝑝,𝑥,𝐹 𝑅,𝑝,𝑞,𝑥 𝑥,𝑈 𝑥,𝐵 𝜑,𝑝,𝑞,𝑥 𝐾,𝑝,𝑥 𝑉,𝑝,𝑞 Allowed substitution hints: 𝐵(𝑞,𝑝) ∙ (𝑥,𝑞,𝑝) · (𝑥,𝑞,𝑝) 𝑈(𝑞,𝑝) 𝐺(𝑥,𝑞,𝑝) 𝐾(𝑞) 𝑉(𝑥) 𝑍(𝑥,𝑞,𝑝)

Proof of Theorem imasvsca Dummy variables 𝑢 𝑣 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasbas.u	. . 3 ⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
2		imasbas.v	. . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		eqid 2733	. . 3 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
4		eqid 2733	. . 3 ⊢ (._r‘𝑅) = (._r‘𝑅)
5		eqid 2733	. . 3 ⊢ (Scalar‘𝑅) = (Scalar‘𝑅)
6		imasvsca.k	. . . 4 ⊢ 𝐾 = (Base‘𝐺)
7		imassca.g	. . . . 5 ⊢ 𝐺 = (Scalar‘𝑅)
8	7	fveq2i 6892	. . . 4 ⊢ (Base‘𝐺) = (Base‘(Scalar‘𝑅))
9	6, 8	eqtri 2761	. . 3 ⊢ 𝐾 = (Base‘(Scalar‘𝑅))
10		imasvsca.q	. . 3 ⊢ · = ( ·_𝑠 ‘𝑅)
11		eqid 2733	. . 3 ⊢ (·_𝑖‘𝑅) = (·_𝑖‘𝑅)
12		eqid 2733	. . 3 ⊢ (TopOpen‘𝑅) = (TopOpen‘𝑅)
13		eqid 2733	. . 3 ⊢ (dist‘𝑅) = (dist‘𝑅)
14		eqid 2733	. . 3 ⊢ (le‘𝑅) = (le‘𝑅)
15		imasbas.f	. . . 4 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
16		imasbas.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑍)
17		eqid 2733	. . . 4 ⊢ (+_g‘𝑈) = (+_g‘𝑈)
18	1, 2, 15, 16, 3, 17	imasplusg 17460	. . 3 ⊢ (𝜑 → (+_g‘𝑈) = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝(+_g‘𝑅)𝑞))⟩})
19		eqid 2733	. . . 4 ⊢ (._r‘𝑈) = (._r‘𝑈)
20	1, 2, 15, 16, 4, 19	imasmulr 17461	. . 3 ⊢ (𝜑 → (._r‘𝑈) = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝(._r‘𝑅)𝑞))⟩})
21		eqidd 2734	. . 3 ⊢ (𝜑 → ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) = ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))))
22		eqidd 2734	. . 3 ⊢ (𝜑 → ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩} = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩})
23		eqidd 2734	. . 3 ⊢ (𝜑 → ((TopOpen‘𝑅) qTop 𝐹) = ((TopOpen‘𝑅) qTop 𝐹))
24		eqid 2733	. . . 4 ⊢ (dist‘𝑈) = (dist‘𝑈)
25	1, 2, 15, 16, 13, 24	imasds 17456	. . 3 ⊢ (𝜑 → (dist‘𝑈) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ inf(∪ 𝑢 ∈ ℕ ran (𝑧 ∈ {𝑤 ∈ ((𝑉 × 𝑉) ↑_m (1...𝑢)) ∣ ((𝐹‘(1^st ‘(𝑤‘1))) = 𝑥 ∧ (𝐹‘(2^nd ‘(𝑤‘𝑢))) = 𝑦 ∧ ∀𝑣 ∈ (1...(𝑢 − 1))(𝐹‘(2^nd ‘(𝑤‘𝑣))) = (𝐹‘(1^st ‘(𝑤‘(𝑣 + 1)))))} ↦ (ℝ^_𝑠 Σ_g ((dist‘𝑅) ∘ 𝑧))), ℝ^, < )))
26		eqidd 2734	. . 3 ⊢ (𝜑 → ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹) = ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹))
27	1, 2, 3, 4, 5, 9, 10, 11, 12, 13, 14, 18, 20, 21, 22, 23, 25, 26, 15, 16	imasval 17454	. 2 ⊢ (𝜑 → 𝑈 = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩}))
28		eqid 2733	. . 3 ⊢ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩}) = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩})
29	28	imasvalstr 17394	. 2 ⊢ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩}) Struct ⟨1, ;12⟩
30		vscaid 17262	. 2 ⊢ ·_𝑠 = Slot ( ·_𝑠 ‘ndx)
31		snsstp2 4820	. . 3 ⊢ {⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩} ⊆ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}
32		ssun2 4173	. . . 4 ⊢ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩} ⊆ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩})
33		ssun1 4172	. . . 4 ⊢ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩})
34	32, 33	sstri 3991	. . 3 ⊢ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩})
35	31, 34	sstri 3991	. 2 ⊢ {⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+_g‘ndx), (+_g‘𝑈)⟩, ⟨(._r‘ndx), (._r‘𝑈)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑅)⟩, ⟨( ·_𝑠 ‘ndx), ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞)))⟩, ⟨(·_𝑖‘ndx), ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝑝(·_𝑖‘𝑅)𝑞)⟩}⟩}) ∪ {⟨(TopSet‘ndx), ((TopOpen‘𝑅) qTop 𝐹)⟩, ⟨(le‘ndx), ((𝐹 ∘ (le‘𝑅)) ∘ ^◡𝐹)⟩, ⟨(dist‘ndx), (dist‘𝑈)⟩})
36		fvex 6902	. . . 4 ⊢ (Base‘𝑅) ∈ V
37	2, 36	eqeltrdi 2842	. . 3 ⊢ (𝜑 → 𝑉 ∈ V)
38	6	fvexi 6903	. . . . 5 ⊢ 𝐾 ∈ V
39		snex 5431	. . . . 5 ⊢ {(𝐹‘𝑞)} ∈ V
40	38, 39	mpoex 8063	. . . 4 ⊢ (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) ∈ V
41	40	rgenw 3066	. . 3 ⊢ ∀𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) ∈ V
42		iunexg 7947	. . 3 ⊢ ((𝑉 ∈ V ∧ ∀𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) ∈ V) → ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) ∈ V)
43	37, 41, 42	sylancl 587	. 2 ⊢ (𝜑 → ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))) ∈ V)
44		imasvsca.s	. 2 ⊢ ∙ = ( ·_𝑠 ‘𝑈)
45	27, 29, 30, 35, 43, 44	strfv3 17135	1 ⊢ (𝜑 → ∙ = ∪ 𝑞 ∈ 𝑉 (𝑝 ∈ 𝐾, 𝑥 ∈ {(𝐹‘𝑞)} ↦ (𝐹‘(𝑝 · 𝑞))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 ∪ cun 3946 {csn 4628 {ctp 4632 ⟨cop 4634 ∪ ciun 4997 ^◡ccnv 5675 ∘ ccom 5680 –onto→wfo 6539 ‘cfv 6541 (class class class)co 7406 ∈ cmpo 7408 1c1 11108 2c2 12264 cdc 12674 ndxcnx 17123 Basecbs 17141 +_gcplusg 17194 ._rcmulr 17195 Scalarcsca 17197 ·_𝑠 cvsca 17198 ·_𝑖cip 17199 TopSetcts 17200 lecple 17201 distcds 17203 TopOpenctopn 17364 qTop cqtop 17446 “_s cimas 17447

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-sup 9434 df-inf 9435 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-9 12279 df-n0 12470 df-z 12556 df-dec 12675 df-uz 12820 df-fz 13482 df-struct 17077 df-slot 17112 df-ndx 17124 df-base 17142 df-plusg 17207 df-mulr 17208 df-sca 17210 df-vsca 17211 df-ip 17212 df-tset 17213 df-ple 17214 df-ds 17216 df-imas 17451

This theorem is referenced by: imasip 17464 imastset 17465 imasle 17466 imasvscafn 17480 imasvscaval 17481 imasvscaf 17482

W3C validator