smadiadetlem4 - Metamath Proof Explorer

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

Theorem smadiadetlem4 22178

Description: Lemma 4 for smadiadet 22179. (Contributed by AV, 31-Jan-2019.)

**Hypotheses**
Ref	Expression
marep01ma.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
marep01ma.b	⊢ 𝐵 = (Base‘𝐴)
marep01ma.r	⊢ 𝑅 ∈ CRing
marep01ma.0	⊢ 0 = (0_g‘𝑅)
marep01ma.1	⊢ 1 = (1_r‘𝑅)
smadiadetlem.p	⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
smadiadetlem.g	⊢ 𝐺 = (mulGrp‘𝑅)
madetminlem.y	⊢ 𝑌 = (ℤRHom‘𝑅)
madetminlem.s	⊢ 𝑆 = (pmSgn‘𝑁)
madetminlem.t	⊢ · = (._r‘𝑅)
smadiadetlem.w	⊢ 𝑊 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
smadiadetlem.z	⊢ 𝑍 = (pmSgn‘(𝑁 ∖ {𝐾}))

**Assertion**
Ref	Expression
smadiadetlem4	⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝑅 Σ_g (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛))))))) = (𝑅 Σ_g (𝑝 ∈ 𝑊 ↦ (((𝑌 ∘ 𝑍)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))))

Distinct variable groups: 𝑖,𝑗,𝑛,𝐵 𝑖,𝑞,𝐾,𝑗,𝑛 𝑖,𝑀,𝑗,𝑛 𝑖,𝑁,𝑗,𝑛 𝑃,𝑖,𝑗,𝑛,𝑞 𝑅,𝑖,𝑗,𝑛 1 ,𝑖,𝑗,𝑛 0 ,𝑖,𝑗,𝑛 𝑛,𝐺,𝑝 𝐵,𝑝 𝐾,𝑝 𝑀,𝑝 𝑁,𝑝 𝑃,𝑝 𝑅,𝑝,𝑖,𝑗 𝑞,𝑝 𝑛,𝑊,𝑝 𝐺,𝑝 𝑌,𝑝 𝑍,𝑝 𝑖,𝐺,𝑗 Allowed substitution hints: 𝐴(𝑖,𝑗,𝑛,𝑞,𝑝) 𝐵(𝑞) 𝑅(𝑞) 𝑆(𝑖,𝑗,𝑛,𝑞,𝑝) · (𝑖,𝑗,𝑛,𝑞,𝑝) 1 (𝑞,𝑝) 𝐺(𝑞) 𝑀(𝑞) 𝑁(𝑞) 𝑊(𝑖,𝑗,𝑞) 𝑌(𝑖,𝑗,𝑛,𝑞) 0 (𝑞,𝑝) 𝑍(𝑖,𝑗,𝑛,𝑞)

**Proof of Theorem smadiadetlem4**
Step	Hyp	Ref	Expression
1		marep01ma.r	. . . . . . . . 9 ⊢ 𝑅 ∈ CRing
2		smadiadetlem.g	. . . . . . . . . 10 ⊢ 𝐺 = (mulGrp‘𝑅)
3	2	crngmgp 20066	. . . . . . . . 9 ⊢ (𝑅 ∈ CRing → 𝐺 ∈ CMnd)
4	1, 3	mp1i 13	. . . . . . . 8 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → 𝐺 ∈ CMnd)
5		marep01ma.a	. . . . . . . . . . 11 ⊢ 𝐴 = (𝑁 Mat 𝑅)
6		marep01ma.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝐴)
7	5, 6	matrcl 21919	. . . . . . . . . 10 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
8	7	simpld 495	. . . . . . . . 9 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin)
9	8	adantr 481	. . . . . . . 8 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → 𝑁 ∈ Fin)
10	4, 9	jca 512	. . . . . . 7 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝐺 ∈ CMnd ∧ 𝑁 ∈ Fin))
11	10	adantr 481	. . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝐺 ∈ CMnd ∧ 𝑁 ∈ Fin))
12		simprl 769	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑖 ∈ 𝑁)
13		simprr 771	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑗 ∈ 𝑁)
14	6	eleq2i 2825	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ 𝐵 ↔ 𝑀 ∈ (Base‘𝐴))
15	14	biimpi 215	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ (Base‘𝐴))
16	15	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → 𝑀 ∈ (Base‘𝐴))
17	16	adantr 481	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → 𝑀 ∈ (Base‘𝐴))
18		eqid 2732	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑅)
19	5, 18	matecl 21934	. . . . . . . . . . 11 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁 ∧ 𝑀 ∈ (Base‘𝐴)) → (𝑖𝑀𝑗) ∈ (Base‘𝑅))
20	12, 13, 17, 19	syl3anc 1371	. . . . . . . . . 10 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ (Base‘𝑅))
21	2, 18	mgpbas 19995	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝐺)
22	20, 21	eleqtrdi 2843	. . . . . . . . 9 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ (𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁)) → (𝑖𝑀𝑗) ∈ (Base‘𝐺))
23	22	ralrimivva 3200	. . . . . . . 8 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) ∈ (Base‘𝐺))
24	23	adantr 481	. . . . . . 7 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) ∈ (Base‘𝐺))
25		crngring 20070	. . . . . . . . 9 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
26		marep01ma.0	. . . . . . . . . 10 ⊢ 0 = (0_g‘𝑅)
27	18, 26	ring0cl 20086	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅))
28	1, 25, 27	mp2b 10	. . . . . . . 8 ⊢ 0 ∈ (Base‘𝑅)
29	28, 21	eleqtri 2831	. . . . . . 7 ⊢ 0 ∈ (Base‘𝐺)
30	24, 29	jctir 521	. . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) ∈ (Base‘𝐺) ∧ 0 ∈ (Base‘𝐺)))
31		simpr 485	. . . . . . 7 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → 𝐾 ∈ 𝑁)
32	31	adantr 481	. . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → 𝐾 ∈ 𝑁)
33		simpr 485	. . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾})
34		smadiadetlem.p	. . . . . . 7 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
35		eqid 2732	. . . . . . 7 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}
36		marep01ma.1	. . . . . . . 8 ⊢ 1 = (1_r‘𝑅)
37	2, 36	ringidval 20008	. . . . . . 7 ⊢ 1 = (0_g‘𝐺)
38		eqid 2732	. . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺)
39	34, 35, 37, 38	gsummatr01 22168	. . . . . 6 ⊢ (((𝐺 ∈ CMnd ∧ 𝑁 ∈ Fin) ∧ (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖𝑀𝑗) ∈ (Base‘𝐺) ∧ 0 ∈ (Base‘𝐺)) ∧ (𝐾 ∈ 𝑁 ∧ 𝐾 ∈ 𝑁 ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾})) → (𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛)))) = (𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛)))))
40	11, 30, 32, 32, 33, 39	syl113anc 1382	. . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛)))) = (𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛)))))
41	40	oveq2d 7427	. . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) ∧ 𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛))))) = (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))
42	41	mpteq2dva 5248	. . 3 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛)))))) = (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛)))))))
43	42	oveq2d 7427	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝑅 Σ_g (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛))))))) = (𝑅 Σ_g (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))))
44		madetminlem.y	. . 3 ⊢ 𝑌 = (ℤRHom‘𝑅)
45		madetminlem.s	. . 3 ⊢ 𝑆 = (pmSgn‘𝑁)
46		madetminlem.t	. . 3 ⊢ · = (._r‘𝑅)
47		smadiadetlem.w	. . 3 ⊢ 𝑊 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
48		smadiadetlem.z	. . 3 ⊢ 𝑍 = (pmSgn‘(𝑁 ∖ {𝐾}))
49	5, 6, 1, 26, 36, 34, 2, 44, 45, 46, 47, 48	smadiadetlem3 22177	. 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝑅 Σ_g (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))) = (𝑅 Σ_g (𝑝 ∈ 𝑊 ↦ (((𝑌 ∘ 𝑍)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))))
50	43, 49	eqtrd 2772	1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁) → (𝑅 Σ_g (𝑝 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} ↦ (((𝑌 ∘ 𝑆)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐾, 1 , 0 ), (𝑖𝑀𝑗)))(𝑝‘𝑛))))))) = (𝑅 Σ_g (𝑝 ∈ 𝑊 ↦ (((𝑌 ∘ 𝑍)‘𝑝)(._r‘𝑅)(𝐺 Σ_g (𝑛 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑛(𝑖 ∈ (𝑁 ∖ {𝐾}), 𝑗 ∈ (𝑁 ∖ {𝐾}) ↦ (𝑖𝑀𝑗))(𝑝‘𝑛))))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 {crab 3432 Vcvv 3474 ∖ cdif 3945 ifcif 4528 {csn 4628 ↦ cmpt 5231 ∘ ccom 5680 ‘cfv 6543 (class class class)co 7411 ∈ cmpo 7413 Fincfn 8941 Basecbs 17146 ._rcmulr 17200 0_gc0g 17387 Σ_g cgsu 17388 SymGrpcsymg 19236 pmSgncpsgn 19359 CMndccmn 19650 mulGrpcmgp 19989 1_rcur 20006 Ringcrg 20058 CRingccrg 20059 ℤRHomczrh 21055 Mat cmat 21914

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-addf 11191 ax-mulf 11192

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-xor 1510 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 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-ot 4637 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 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-se 5632 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 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-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7672 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-tpos 8213 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-er 8705 df-map 8824 df-pm 8825 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-sup 9439 df-oi 9507 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-div 11874 df-nn 12215 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12475 df-xnn0 12547 df-z 12561 df-dec 12680 df-uz 12825 df-rp 12977 df-fz 13487 df-fzo 13630 df-seq 13969 df-exp 14030 df-hash 14293 df-word 14467 df-lsw 14515 df-concat 14523 df-s1 14548 df-substr 14593 df-pfx 14623 df-splice 14702 df-reverse 14711 df-s2 14801 df-struct 17082 df-sets 17099 df-slot 17117 df-ndx 17129 df-base 17147 df-ress 17176 df-plusg 17212 df-mulr 17213 df-starv 17214 df-sca 17215 df-vsca 17216 df-ip 17217 df-tset 17218 df-ple 17219 df-ds 17221 df-unif 17222 df-hom 17223 df-cco 17224 df-0g 17389 df-gsum 17390 df-prds 17395 df-pws 17397 df-mre 17532 df-mrc 17533 df-acs 17535 df-mgm 18563 df-sgrp 18612 df-mnd 18628 df-mhm 18673 df-submnd 18674 df-efmnd 18752 df-grp 18824 df-minusg 18825 df-mulg 18953 df-subg 19005 df-ghm 19092 df-gim 19135 df-cntz 19183 df-oppg 19212 df-symg 19237 df-pmtr 19312 df-psgn 19361 df-cmn 19652 df-abl 19653 df-mgp 19990 df-ur 20007 df-ring 20060 df-cring 20061 df-rnghom 20255 df-subrg 20321 df-sra 20791 df-rgmod 20792 df-cnfld 20951 df-zring 21024 df-zrh 21059 df-dsmm 21293 df-frlm 21308 df-mat 21915

This theorem is referenced by: smadiadet 22179

W3C validator