cznrng - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > cznrng		Structured version Visualization version GIF version

Theorem cznrng 49327

Description: The ring constructed from a ℤ/nℤ structure by replacing the (multiplicative) ring operation by a constant operation is a non-unital ring. (Contributed by AV, 17-Feb-2020.)

**Hypotheses**
Ref	Expression
cznrng.y	⊢ 𝑌 = (ℤ/nℤ‘𝑁)
cznrng.b	⊢ 𝐵 = (Base‘𝑌)
cznrng.x	⊢ 𝑋 = (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)
cznrng.0	⊢ 0 = (0_g‘𝑌)

**Assertion**
Ref	Expression
cznrng	⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑋 ∈ Rng)

Distinct variable groups: 𝑥,𝐵,𝑦 𝑥,𝐶,𝑦 𝑥,𝑁,𝑦 𝑥,𝑋 𝑥,𝑌,𝑦 𝑥, 0 ,𝑦 Allowed substitution hint: 𝑋(𝑦)

Proof of Theorem cznrng Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnnn0 12606	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
2		cznrng.y	. . . . . . 7 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
3	2	zncrng 21843	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 ∈ CRing)
4	1, 3	syl 18	. . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ CRing)
5		crngring 20465	. . . . . 6 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
6		cznrng.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑌)
7		cznrng.0	. . . . . . . 8 ⊢ 0 = (0_g‘𝑌)
8	6, 7	ring0cl 20489	. . . . . . 7 ⊢ (𝑌 ∈ Ring → 0 ∈ 𝐵)
9		eleq1a 2856	. . . . . . 7 ⊢ ( 0 ∈ 𝐵 → (𝐶 = 0 → 𝐶 ∈ 𝐵))
10	8, 9	syl 18	. . . . . 6 ⊢ (𝑌 ∈ Ring → (𝐶 = 0 → 𝐶 ∈ 𝐵))
11	5, 10	syl 18	. . . . 5 ⊢ (𝑌 ∈ CRing → (𝐶 = 0 → 𝐶 ∈ 𝐵))
12	4, 11	syl 18	. . . 4 ⊢ (𝑁 ∈ ℕ → (𝐶 = 0 → 𝐶 ∈ 𝐵))
13	12	imp 412	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝐶 ∈ 𝐵)
14		cznrng.x	. . . . . 6 ⊢ 𝑋 = (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)
15	2, 6, 14	cznabel 49326	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
16	15	adantlr 728	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
17		eqid 2761	. . . . . 6 ⊢ (mulGrp‘𝑋) = (mulGrp‘𝑋)
18	2, 6, 14	cznrnglem 49325	. . . . . 6 ⊢ 𝐵 = (Base‘𝑋)
19	17, 18	mgpbas 20358	. . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑋))
20	14	fveq2i 6886	. . . . . . 7 ⊢ (mulGrp‘𝑋) = (mulGrp‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
21	2	fvexi 6897	. . . . . . . 8 ⊢ 𝑌 ∈ V
22	6	fvexi 6897	. . . . . . . . 9 ⊢ 𝐵 ∈ V
23	22, 22	mpoex 8090	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V
24		mulridx 17459	. . . . . . . . 9 ⊢ ._r = Slot (._r‘ndx)
25	24	setsid 17378	. . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)))
26	21, 23, 25	mp2an 705	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
27	20, 26	mgpplusg 20357	. . . . . 6 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (+_g‘(mulGrp‘𝑋))
28	27	eqcomi 2770	. . . . 5 ⊢ (+_g‘(mulGrp‘𝑋)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)
29		ne0i 4287	. . . . . 6 ⊢ (𝐶 ∈ 𝐵 → 𝐵 ≠ ∅)
30	29	adantl 487	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐵 ≠ ∅)
31		simpr 490	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ 𝐵)
32	19, 28, 30, 31	copissgrp 49234	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (mulGrp‘𝑋) ∈ Smgrp)
33		oveq1 7425	. . . . . . . . 9 ⊢ (𝐶 = 0 → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
34	33	ad3antlr 744	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
35	4, 5	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Ring)
36		ringmnd 20463	. . . . . . . . . . . . 13 ⊢ (𝑌 ∈ Ring → 𝑌 ∈ Mnd)
37	35, 36	syl 18	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Mnd)
38	37	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑌 ∈ Mnd)
39	38	anim1i 627	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
40	39	adantr 486	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
41		eqid 2761	. . . . . . . . . 10 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
42	6, 41, 7	mndlid 18937	. . . . . . . . 9 ⊢ ((𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
43	40, 42	syl 18	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
44	34, 43	eqtrd 2796	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = 𝐶)
45		eqidd 2762	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶))
46		eqidd 2762	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑏)) → 𝐶 = 𝐶)
47		simpr1 1213	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
48		simpr2 1214	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
49	31	adantr 486	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
50	45, 46, 47, 48, 49	ovmpod 7570	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏) = 𝐶)
51		eqidd 2762	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
52		simpr3 1215	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑐 ∈ 𝐵)
53	45, 51, 47, 52, 49	ovmpod 7570	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
54	50, 53	oveq12d 7436	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
55		eqidd 2762	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = (𝑏(+_g‘𝑌)𝑐))) → 𝐶 = 𝐶)
56	35	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑌 ∈ Ring)
57	6, 41	ringacl 20500	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
58	56, 48, 52, 57	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
59	45, 55, 47, 58, 49	ovmpod 7570	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = 𝐶)
60	44, 54, 59	3eqtr4rd 2807	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
61		eqidd 2762	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑏 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
62	45, 61, 48, 52, 49	ovmpod 7570	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
63	53, 62	oveq12d 7436	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
64		eqidd 2762	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = (𝑎(+_g‘𝑌)𝑏) ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
65	6, 41	ringacl 20500	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
66	56, 47, 48, 65	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
67	45, 64, 66, 52, 49	ovmpod 7570	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
68	44, 63, 67	3eqtr4rd 2807	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
69	60, 68	jca 521	. . . . 5 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
70	69	ralrimivvva 3209	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
71	16, 32, 70	3jca 1146	. . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
72	13, 71	mpdan 700	. 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
73		plusgid 17448	. . . . 5 ⊢ +_g = Slot (+_g‘ndx)
74		plusgndxnmulrndx 17461	. . . . 5 ⊢ (+_g‘ndx) ≠ (._r‘ndx)
75	73, 74	setsnid 17379	. . . 4 ⊢ (+_g‘𝑌) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
76	14	fveq2i 6886	. . . 4 ⊢ (+_g‘𝑋) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
77	75, 76	eqtr4i 2787	. . 3 ⊢ (+_g‘𝑌) = (+_g‘𝑋)
78	14	eqcomi 2770	. . . . 5 ⊢ (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩) = 𝑋
79	78	fveq2i 6886	. . . 4 ⊢ (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)) = (._r‘𝑋)
80	26, 79	eqtri 2784	. . 3 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘𝑋)
81	18, 17, 77, 80	isrng 20369	. 2 ⊢ (𝑋 ∈ Rng ↔ (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
82	72, 81	sylibr 237	1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑋 ∈ Rng)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 Vcvv 3451 ∅c0 4279 ⟨cop 4590 ‘cfv 6537 (class class class)co 7418 ∈ cmpo 7420 ℕcn 12328 ℕ₀cn0 12599 sSet csts 17334 ndxcnx 17364 Basecbs 17380 +_gcplusg 17421 ._rcmulr 17422 0_gc0g 17603 Smgrpcsgrp 18900 Mndcmnd 18916 Abelcabl 19988 mulGrpcmgp 20353 Rngcrng 20367 Ringcrg 20452 CRingccrg 20453 ℤ/nℤczn 21801

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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-addf 11272

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-tpos 8236 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-ec 8712 df-qs 8716 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-inf 9428 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-dec 12808 df-uz 12959 df-fz 13633 df-struct 17318 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-ress 17402 df-plusg 17434 df-mulr 17435 df-starv 17436 df-sca 17437 df-vsca 17438 df-ip 17439 df-tset 17440 df-ple 17441 df-ds 17443 df-unif 17444 df-0g 17605 df-imas 17673 df-qus 17674 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-grp 19140 df-minusg 19141 df-sbg 19142 df-subg 19326 df-nsg 19327 df-eqg 19328 df-cmn 19989 df-abl 19990 df-mgp 20354 df-rng 20368 df-ur 20401 df-ring 20454 df-cring 20455 df-oppr 20560 df-subrng 20791 df-subrg 20815 df-lmod 21130 df-lss 21200 df-lsp 21240 df-sra 21441 df-rgmod 21442 df-lidl 21479 df-rsp 21480 df-2idl 21536 df-cnfld 21672 df-zring 21746 df-zn 21805

This theorem is used by: (None)

W3C validator