0prjspnrel - Mathbox for Steven Nguyen

	Mathbox for Steven Nguyen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > 0prjspnrel		Structured version Visualization version GIF version

Theorem 0prjspnrel 42116

Description: In the zero-dimensional projective space, all vectors are equivalent to the unit vector. (Contributed by Steven Nguyen, 7-Jun-2023.)

**Hypotheses**
Ref	Expression
0prjspnrel.e	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
0prjspnrel.b	⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
0prjspnrel.x	⊢ · = ( ·_𝑠 ‘𝑊)
0prjspnrel.s	⊢ 𝑆 = (Base‘𝐾)
0prjspnrel.w	⊢ 𝑊 = (𝐾 freeLMod (0...0))
0prjspnrel.1	⊢ 1 = ((𝐾 unitVec (0...0))‘0)

**Assertion**
Ref	Expression
0prjspnrel	⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 ∼ 1 )

Distinct variable groups: 𝑥,𝐵,𝑦 𝑥,𝑋,𝑦,𝑙 𝑥,𝐾,𝑦,𝑙 𝑥, · ,𝑦,𝑙 𝑥, 1 ,𝑦,𝑙 𝑥,𝑆,𝑦,𝑙 Allowed substitution hints: 𝐵(𝑙) ∼ (𝑥,𝑦,𝑙) 𝑊(𝑥,𝑦,𝑙)

Proof of Theorem 0prjspnrel Dummy variables 𝑚 𝑛 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 483	. 2 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
2		0prjspnrel.b	. . . 4 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
3		0prjspnrel.w	. . . 4 ⊢ 𝑊 = (𝐾 freeLMod (0...0))
4		0prjspnrel.1	. . . 4 ⊢ 1 = ((𝐾 unitVec (0...0))‘0)
5	2, 3, 4	0prjspnlem 42112	. . 3 ⊢ (𝐾 ∈ DivRing → 1 ∈ 𝐵)
6	5	adantr 479	. 2 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 1 ∈ 𝐵)
7		ovexd 7451	. . . . . 6 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → (0...0) ∈ V)
8		difss 4124	. . . . . . . . 9 ⊢ ((Base‘𝑊) ∖ {(0_g‘𝑊)}) ⊆ (Base‘𝑊)
9	2, 8	eqsstri 4007	. . . . . . . 8 ⊢ 𝐵 ⊆ (Base‘𝑊)
10	9	sseli 3968	. . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ (Base‘𝑊))
11	10	adantl 480	. . . . . 6 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑊))
12		eqid 2725	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
13		eqid 2725	. . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊)
14	3, 12, 13	frlmbasf 21698	. . . . . 6 ⊢ (((0...0) ∈ V ∧ 𝑋 ∈ (Base‘𝑊)) → 𝑋:(0...0)⟶(Base‘𝐾))
15	7, 11, 14	syl2anc 582	. . . . 5 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋:(0...0)⟶(Base‘𝐾))
16		c0ex 11238	. . . . . . . 8 ⊢ 0 ∈ V
17	16	snid 4660	. . . . . . 7 ⊢ 0 ∈ {0}
18		fz0sn 13633	. . . . . . 7 ⊢ (0...0) = {0}
19	17, 18	eleqtrri 2824	. . . . . 6 ⊢ 0 ∈ (0...0)
20	19	a1i 11	. . . . 5 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 0 ∈ (0...0))
21	15, 20	ffvelcdmd 7090	. . . 4 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → (𝑋‘0) ∈ (Base‘𝐾))
22		sneq 4634	. . . . . . 7 ⊢ (𝑛 = (𝑋‘0) → {𝑛} = {(𝑋‘0)})
23	22	xpeq2d 5702	. . . . . 6 ⊢ (𝑛 = (𝑋‘0) → ((0...0) × {𝑛}) = ((0...0) × {(𝑋‘0)}))
24	23	eqeq2d 2736	. . . . 5 ⊢ (𝑛 = (𝑋‘0) → (𝑋 = ((0...0) × {𝑛}) ↔ 𝑋 = ((0...0) × {(𝑋‘0)})))
25	24	adantl 480	. . . 4 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 = (𝑋‘0)) → (𝑋 = ((0...0) × {𝑛}) ↔ 𝑋 = ((0...0) × {(𝑋‘0)})))
26	3, 12, 13	frlmbasmap 21697	. . . . . 6 ⊢ (((0...0) ∈ V ∧ 𝑋 ∈ (Base‘𝑊)) → 𝑋 ∈ ((Base‘𝐾) ↑_m (0...0)))
27	7, 11, 26	syl2anc 582	. . . . 5 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ ((Base‘𝐾) ↑_m (0...0)))
28		fvex 6905	. . . . . 6 ⊢ (Base‘𝐾) ∈ V
29	18, 28, 16	mapsnconst 8909	. . . . 5 ⊢ (𝑋 ∈ ((Base‘𝐾) ↑_m (0...0)) → 𝑋 = ((0...0) × {(𝑋‘0)}))
30	27, 29	syl 17	. . . 4 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 = ((0...0) × {(𝑋‘0)}))
31	21, 25, 30	rspcedvd 3603	. . 3 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → ∃𝑛 ∈ (Base‘𝐾)𝑋 = ((0...0) × {𝑛}))
32		simprl 769	. . . . 5 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ (𝑛 ∈ (Base‘𝐾) ∧ 𝑋 = ((0...0) × {𝑛}))) → 𝑛 ∈ (Base‘𝐾))
33		0prjspnrel.s	. . . . 5 ⊢ 𝑆 = (Base‘𝐾)
34	32, 33	eleqtrrdi 2836	. . . 4 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ (𝑛 ∈ (Base‘𝐾) ∧ 𝑋 = ((0...0) × {𝑛}))) → 𝑛 ∈ 𝑆)
35		oveq1 7423	. . . . . 6 ⊢ (𝑚 = 𝑛 → (𝑚 · 1 ) = (𝑛 · 1 ))
36	35	eqeq2d 2736	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑋 = (𝑚 · 1 ) ↔ 𝑋 = (𝑛 · 1 )))
37	36	adantl 480	. . . 4 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ (𝑛 ∈ (Base‘𝐾) ∧ 𝑋 = ((0...0) × {𝑛}))) ∧ 𝑚 = 𝑛) → (𝑋 = (𝑚 · 1 ) ↔ 𝑋 = (𝑛 · 1 )))
38		ovexd 7451	. . . . . . . . 9 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (0...0) ∈ V)
39		simpr 483	. . . . . . . . 9 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 𝑛 ∈ (Base‘𝐾))
40	5	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 1 ∈ 𝐵)
41	9, 40	sselid 3970	. . . . . . . . 9 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 1 ∈ (Base‘𝑊))
42		0prjspnrel.x	. . . . . . . . 9 ⊢ · = ( ·_𝑠 ‘𝑊)
43		eqid 2725	. . . . . . . . 9 ⊢ (._r‘𝐾) = (._r‘𝐾)
44	3, 13, 12, 38, 39, 41, 42, 43	frlmvscafval 21704	. . . . . . . 8 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑛 · 1 ) = (((0...0) × {𝑛}) ∘_f (._r‘𝐾) 1 ))
45	3, 12, 13	frlmbasf 21698	. . . . . . . . . . 11 ⊢ (((0...0) ∈ V ∧ 1 ∈ (Base‘𝑊)) → 1 :(0...0)⟶(Base‘𝐾))
46	38, 41, 45	syl2anc 582	. . . . . . . . . 10 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 1 :(0...0)⟶(Base‘𝐾))
47		drngring 20635	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ DivRing → 𝐾 ∈ Ring)
48		eqid 2725	. . . . . . . . . . . . . . 15 ⊢ (1_r‘𝐾) = (1_r‘𝐾)
49	12, 48	ringidcl 20206	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ Ring → (1_r‘𝐾) ∈ (Base‘𝐾))
50	47, 49	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ DivRing → (1_r‘𝐾) ∈ (Base‘𝐾))
51	50	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (1_r‘𝐾) ∈ (Base‘𝐾))
52	51	snssd 4808	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → {(1_r‘𝐾)} ⊆ (Base‘𝐾))
53	4	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝑑 ∈ (0...0) → 1 = ((𝐾 unitVec (0...0))‘0))
54		elfz1eq 13544	. . . . . . . . . . . . . . 15 ⊢ (𝑑 ∈ (0...0) → 𝑑 = 0)
55	53, 54	fveq12d 6899	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ (0...0) → ( 1 ‘𝑑) = (((𝐾 unitVec (0...0))‘0)‘0))
56	55	adantl 480	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → ( 1 ‘𝑑) = (((𝐾 unitVec (0...0))‘0)‘0))
57		eqid 2725	. . . . . . . . . . . . . . 15 ⊢ (𝐾 unitVec (0...0)) = (𝐾 unitVec (0...0))
58		simplll 773	. . . . . . . . . . . . . . 15 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → 𝐾 ∈ DivRing)
59		ovexd 7451	. . . . . . . . . . . . . . 15 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → (0...0) ∈ V)
60	19	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → 0 ∈ (0...0))
61	57, 58, 59, 60, 48	uvcvv1 21727	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → (((𝐾 unitVec (0...0))‘0)‘0) = (1_r‘𝐾))
62		fvex 6905	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 unitVec (0...0))‘0)‘0) ∈ V
63	62	elsn 4639	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 unitVec (0...0))‘0)‘0) ∈ {(1_r‘𝐾)} ↔ (((𝐾 unitVec (0...0))‘0)‘0) = (1_r‘𝐾))
64	61, 63	sylibr 233	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → (((𝐾 unitVec (0...0))‘0)‘0) ∈ {(1_r‘𝐾)})
65	56, 64	eqeltrd 2825	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑑 ∈ (0...0)) → ( 1 ‘𝑑) ∈ {(1_r‘𝐾)})
66	65	ralrimiva 3136	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → ∀𝑑 ∈ (0...0)( 1 ‘𝑑) ∈ {(1_r‘𝐾)})
67		fcdmssb 7127	. . . . . . . . . . 11 ⊢ (({(1_r‘𝐾)} ⊆ (Base‘𝐾) ∧ ∀𝑑 ∈ (0...0)( 1 ‘𝑑) ∈ {(1_r‘𝐾)}) → ( 1 :(0...0)⟶(Base‘𝐾) ↔ 1 :(0...0)⟶{(1_r‘𝐾)}))
68	52, 66, 67	syl2anc 582	. . . . . . . . . 10 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → ( 1 :(0...0)⟶(Base‘𝐾) ↔ 1 :(0...0)⟶{(1_r‘𝐾)}))
69	46, 68	mpbid 231	. . . . . . . . 9 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 1 :(0...0)⟶{(1_r‘𝐾)})
70		vex 3467	. . . . . . . . . 10 ⊢ 𝑛 ∈ V
71	70	a1i 11	. . . . . . . . 9 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 𝑛 ∈ V)
72		elsni 4641	. . . . . . . . . . 11 ⊢ (𝑐 ∈ {(1_r‘𝐾)} → 𝑐 = (1_r‘𝐾))
73	72	oveq2d 7432	. . . . . . . . . 10 ⊢ (𝑐 ∈ {(1_r‘𝐾)} → (𝑛(._r‘𝐾)𝑐) = (𝑛(._r‘𝐾)(1_r‘𝐾)))
74	47	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → 𝐾 ∈ Ring)
75	12, 43, 48	ringridm 20210	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ Ring ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑛(._r‘𝐾)(1_r‘𝐾)) = 𝑛)
76	74, 39, 75	syl2anc 582	. . . . . . . . . 10 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑛(._r‘𝐾)(1_r‘𝐾)) = 𝑛)
77	73, 76	sylan9eqr 2787	. . . . . . . . 9 ⊢ ((((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) ∧ 𝑐 ∈ {(1_r‘𝐾)}) → (𝑛(._r‘𝐾)𝑐) = 𝑛)
78	38, 69, 71, 71, 77	caofid2 7717	. . . . . . . 8 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (((0...0) × {𝑛}) ∘_f (._r‘𝐾) 1 ) = ((0...0) × {𝑛}))
79	44, 78	eqtrd 2765	. . . . . . 7 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑛 · 1 ) = ((0...0) × {𝑛}))
80	79	eqeq2d 2736	. . . . . 6 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑋 = (𝑛 · 1 ) ↔ 𝑋 = ((0...0) × {𝑛})))
81	80	biimprd 247	. . . . 5 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ 𝑛 ∈ (Base‘𝐾)) → (𝑋 = ((0...0) × {𝑛}) → 𝑋 = (𝑛 · 1 )))
82	81	impr 453	. . . 4 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ (𝑛 ∈ (Base‘𝐾) ∧ 𝑋 = ((0...0) × {𝑛}))) → 𝑋 = (𝑛 · 1 ))
83	34, 37, 82	rspcedvd 3603	. . 3 ⊢ (((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) ∧ (𝑛 ∈ (Base‘𝐾) ∧ 𝑋 = ((0...0) × {𝑛}))) → ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 1 ))
84	31, 83	rexlimddv 3151	. 2 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 1 ))
85		0prjspnrel.e	. . 3 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
86	85	prjsprel 42093	. 2 ⊢ (𝑋 ∼ 1 ↔ ((𝑋 ∈ 𝐵 ∧ 1 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 1 )))
87	1, 6, 84, 86	syl21anbrc 1341	1 ⊢ ((𝐾 ∈ DivRing ∧ 𝑋 ∈ 𝐵) → 𝑋 ∼ 1 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3051 ∃wrex 3060 Vcvv 3463 ∖ cdif 3936 ⊆ wss 3939 {csn 4624 class class class wbr 5143 {copab 5205 × cxp 5670 ⟶wf 6539 ‘cfv 6543 (class class class)co 7416 ∘_f cof 7680 ↑_m cmap 8843 0cc0 11138 ...cfz 13516 Basecbs 17179 ._rcmulr 17233 ·_𝑠 cvsca 17236 0_gc0g 17420 1_rcur 20125 Ringcrg 20177 DivRingcdr 20628 freeLMod cfrlm 21684 unitVec cuvc 21720

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7682 df-om 7869 df-1st 7991 df-2nd 7992 df-supp 8164 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-ixp 8915 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-fsupp 9386 df-sup 9465 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-ip 17250 df-tset 17251 df-ple 17252 df-ds 17254 df-hom 17256 df-cco 17257 df-0g 17422 df-prds 17428 df-pws 17430 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18897 df-minusg 18898 df-sbg 18899 df-subg 19082 df-cmn 19741 df-abl 19742 df-mgp 20079 df-rng 20097 df-ur 20126 df-ring 20179 df-oppr 20277 df-dvdsr 20300 df-unit 20301 df-nzr 20456 df-subrg 20512 df-drng 20630 df-lmod 20749 df-lss 20820 df-sra 21062 df-rgmod 21063 df-dsmm 21670 df-frlm 21685 df-uvc 21721

This theorem is referenced by: 0prjspn 42117

W3C validator