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 46901

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 12479	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
2		cznrng.y	. . . . . . 7 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
3	2	zncrng 21100	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 ∈ CRing)
4	1, 3	syl 17	. . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ CRing)
5		crngring 20068	. . . . . 6 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
6		cznrng.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑌)
7		cznrng.0	. . . . . . . 8 ⊢ 0 = (0_g‘𝑌)
8	6, 7	ring0cl 20084	. . . . . . 7 ⊢ (𝑌 ∈ Ring → 0 ∈ 𝐵)
9		eleq1a 2829	. . . . . . 7 ⊢ ( 0 ∈ 𝐵 → (𝐶 = 0 → 𝐶 ∈ 𝐵))
10	8, 9	syl 17	. . . . . 6 ⊢ (𝑌 ∈ Ring → (𝐶 = 0 → 𝐶 ∈ 𝐵))
11	5, 10	syl 17	. . . . 5 ⊢ (𝑌 ∈ CRing → (𝐶 = 0 → 𝐶 ∈ 𝐵))
12	4, 11	syl 17	. . . 4 ⊢ (𝑁 ∈ ℕ → (𝐶 = 0 → 𝐶 ∈ 𝐵))
13	12	imp 408	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝐶 ∈ 𝐵)
14		cznrng.x	. . . . . 6 ⊢ 𝑋 = (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)
15	2, 6, 14	cznabel 46900	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
16	15	adantlr 714	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
17		eqid 2733	. . . . . 6 ⊢ (mulGrp‘𝑋) = (mulGrp‘𝑋)
18	2, 6, 14	cznrnglem 46899	. . . . . 6 ⊢ 𝐵 = (Base‘𝑋)
19	17, 18	mgpbas 19993	. . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑋))
20	14	fveq2i 6895	. . . . . . 7 ⊢ (mulGrp‘𝑋) = (mulGrp‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
21	2	fvexi 6906	. . . . . . . 8 ⊢ 𝑌 ∈ V
22	6	fvexi 6906	. . . . . . . . 9 ⊢ 𝐵 ∈ V
23	22, 22	mpoex 8066	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V
24		mulridx 17239	. . . . . . . . 9 ⊢ ._r = Slot (._r‘ndx)
25	24	setsid 17141	. . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)))
26	21, 23, 25	mp2an 691	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
27	20, 26	mgpplusg 19991	. . . . . 6 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (+_g‘(mulGrp‘𝑋))
28	27	eqcomi 2742	. . . . 5 ⊢ (+_g‘(mulGrp‘𝑋)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)
29		ne0i 4335	. . . . . 6 ⊢ (𝐶 ∈ 𝐵 → 𝐵 ≠ ∅)
30	29	adantl 483	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐵 ≠ ∅)
31		simpr 486	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ 𝐵)
32	19, 28, 30, 31	copissgrp 46626	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (mulGrp‘𝑋) ∈ Smgrp)
33		oveq1 7416	. . . . . . . . 9 ⊢ (𝐶 = 0 → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
34	33	ad3antlr 730	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
35	4, 5	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Ring)
36		ringmnd 20066	. . . . . . . . . . . . 13 ⊢ (𝑌 ∈ Ring → 𝑌 ∈ Mnd)
37	35, 36	syl 17	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Mnd)
38	37	adantr 482	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑌 ∈ Mnd)
39	38	anim1i 616	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
40	39	adantr 482	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
41		eqid 2733	. . . . . . . . . 10 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
42	6, 41, 7	mndlid 18645	. . . . . . . . 9 ⊢ ((𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
43	40, 42	syl 17	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
44	34, 43	eqtrd 2773	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = 𝐶)
45		eqidd 2734	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶))
46		eqidd 2734	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑏)) → 𝐶 = 𝐶)
47		simpr1 1195	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
48		simpr2 1196	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
49	31	adantr 482	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
50	45, 46, 47, 48, 49	ovmpod 7560	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏) = 𝐶)
51		eqidd 2734	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
52		simpr3 1197	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑐 ∈ 𝐵)
53	45, 51, 47, 52, 49	ovmpod 7560	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
54	50, 53	oveq12d 7427	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
55		eqidd 2734	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = (𝑏(+_g‘𝑌)𝑐))) → 𝐶 = 𝐶)
56	35	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑌 ∈ Ring)
57	6, 41	ringacl 20095	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
58	56, 48, 52, 57	syl3anc 1372	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
59	45, 55, 47, 58, 49	ovmpod 7560	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = 𝐶)
60	44, 54, 59	3eqtr4rd 2784	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
61		eqidd 2734	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑏 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
62	45, 61, 48, 52, 49	ovmpod 7560	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
63	53, 62	oveq12d 7427	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
64		eqidd 2734	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = (𝑎(+_g‘𝑌)𝑏) ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
65	6, 41	ringacl 20095	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
66	56, 47, 48, 65	syl3anc 1372	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
67	45, 64, 66, 52, 49	ovmpod 7560	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
68	44, 63, 67	3eqtr4rd 2784	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
69	60, 68	jca 513	. . . . 5 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
70	69	ralrimivvva 3204	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
71	16, 32, 70	3jca 1129	. . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
72	13, 71	mpdan 686	. 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
73		plusgid 17224	. . . . 5 ⊢ +_g = Slot (+_g‘ndx)
74		plusgndxnmulrndx 17242	. . . . 5 ⊢ (+_g‘ndx) ≠ (._r‘ndx)
75	73, 74	setsnid 17142	. . . 4 ⊢ (+_g‘𝑌) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
76	14	fveq2i 6895	. . . 4 ⊢ (+_g‘𝑋) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
77	75, 76	eqtr4i 2764	. . 3 ⊢ (+_g‘𝑌) = (+_g‘𝑋)
78	14	eqcomi 2742	. . . . 5 ⊢ (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩) = 𝑋
79	78	fveq2i 6895	. . . 4 ⊢ (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)) = (._r‘𝑋)
80	26, 79	eqtri 2761	. . 3 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘𝑋)
81	18, 17, 77, 80	isrng 46698	. 2 ⊢ (𝑋 ∈ Rng ↔ (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
82	72, 81	sylibr 233	1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑋 ∈ Rng)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 Vcvv 3475 ∅c0 4323 ⟨cop 4635 ‘cfv 6544 (class class class)co 7409 ∈ cmpo 7411 ℕcn 12212 ℕ₀cn0 12472 sSet csts 17096 ndxcnx 17126 Basecbs 17144 +_gcplusg 17197 ._rcmulr 17198 0_gc0g 17385 Smgrpcsgrp 18609 Mndcmnd 18625 Abelcabl 19649 mulGrpcmgp 19987 Ringcrg 20056 CRingccrg 20057 ℤ/nℤczn 21052 Rngcrng 46696

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 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-addf 11189 ax-mulf 11190

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-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-tpos 8211 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-ec 8705 df-qs 8709 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-fz 13485 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-0g 17387 df-imas 17454 df-qus 17455 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-grp 18822 df-minusg 18823 df-sbg 18824 df-subg 19003 df-nsg 19004 df-eqg 19005 df-cmn 19650 df-abl 19651 df-mgp 19988 df-ur 20005 df-ring 20058 df-cring 20059 df-oppr 20150 df-subrg 20317 df-lmod 20473 df-lss 20543 df-lsp 20583 df-sra 20785 df-rgmod 20786 df-lidl 20787 df-rsp 20788 df-2idl 20857 df-cnfld 20945 df-zring 21018 df-zn 21056 df-rng 46697

This theorem is referenced by: (None)

W3C validator