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 46943

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 12485	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
2		cznrng.y	. . . . . . 7 ⊢ 𝑌 = (ℤ/nℤ‘𝑁)
3	2	zncrng 21321	. . . . . 6 ⊢ (𝑁 ∈ ℕ₀ → 𝑌 ∈ CRing)
4	1, 3	syl 17	. . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ CRing)
5		crngring 20141	. . . . . 6 ⊢ (𝑌 ∈ CRing → 𝑌 ∈ Ring)
6		cznrng.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑌)
7		cznrng.0	. . . . . . . 8 ⊢ 0 = (0_g‘𝑌)
8	6, 7	ring0cl 20157	. . . . . . 7 ⊢ (𝑌 ∈ Ring → 0 ∈ 𝐵)
9		eleq1a 2826	. . . . . . 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 405	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝐶 ∈ 𝐵)
14		cznrng.x	. . . . . 6 ⊢ 𝑋 = (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)
15	2, 6, 14	cznabel 46942	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
16	15	adantlr 711	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝑋 ∈ Abel)
17		eqid 2730	. . . . . 6 ⊢ (mulGrp‘𝑋) = (mulGrp‘𝑋)
18	2, 6, 14	cznrnglem 46941	. . . . . 6 ⊢ 𝐵 = (Base‘𝑋)
19	17, 18	mgpbas 20036	. . . . 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 8070	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V
24		mulridx 17245	. . . . . . . . 9 ⊢ ._r = Slot (._r‘ndx)
25	24	setsid 17147	. . . . . . . 8 ⊢ ((𝑌 ∈ V ∧ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)))
26	21, 23, 25	mp2an 688	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
27	20, 26	mgpplusg 20034	. . . . . 6 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (+_g‘(mulGrp‘𝑋))
28	27	eqcomi 2739	. . . . 5 ⊢ (+_g‘(mulGrp‘𝑋)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)
29		ne0i 4335	. . . . . 6 ⊢ (𝐶 ∈ 𝐵 → 𝐵 ≠ ∅)
30	29	adantl 480	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐵 ≠ ∅)
31		simpr 483	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → 𝐶 ∈ 𝐵)
32	19, 28, 30, 31	copissgrp 46846	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (mulGrp‘𝑋) ∈ Smgrp)
33		oveq1 7420	. . . . . . . . 9 ⊢ (𝐶 = 0 → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
34	33	ad3antlr 727	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = ( 0 (+_g‘𝑌)𝐶))
35	4, 5	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Ring)
36		ringmnd 20139	. . . . . . . . . . . . 13 ⊢ (𝑌 ∈ Ring → 𝑌 ∈ Mnd)
37	35, 36	syl 17	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 𝑌 ∈ Mnd)
38	37	adantr 479	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → 𝑌 ∈ Mnd)
39	38	anim1i 613	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
40	39	adantr 479	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵))
41		eqid 2730	. . . . . . . . . 10 ⊢ (+_g‘𝑌) = (+_g‘𝑌)
42	6, 41, 7	mndlid 18681	. . . . . . . . 9 ⊢ ((𝑌 ∈ Mnd ∧ 𝐶 ∈ 𝐵) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
43	40, 42	syl 17	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ( 0 (+_g‘𝑌)𝐶) = 𝐶)
44	34, 43	eqtrd 2770	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝐶(+_g‘𝑌)𝐶) = 𝐶)
45		eqidd 2731	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶))
46		eqidd 2731	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑏)) → 𝐶 = 𝐶)
47		simpr1 1192	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑎 ∈ 𝐵)
48		simpr2 1193	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑏 ∈ 𝐵)
49	31	adantr 479	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝐶 ∈ 𝐵)
50	45, 46, 47, 48, 49	ovmpod 7564	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏) = 𝐶)
51		eqidd 2731	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
52		simpr3 1194	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑐 ∈ 𝐵)
53	45, 51, 47, 52, 49	ovmpod 7564	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
54	50, 53	oveq12d 7431	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
55		eqidd 2731	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑎 ∧ 𝑦 = (𝑏(+_g‘𝑌)𝑐))) → 𝐶 = 𝐶)
56	35	ad3antrrr 726	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → 𝑌 ∈ Ring)
57	6, 41	ringacl 20168	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
58	56, 48, 52, 57	syl3anc 1369	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(+_g‘𝑌)𝑐) ∈ 𝐵)
59	45, 55, 47, 58, 49	ovmpod 7564	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = 𝐶)
60	44, 54, 59	3eqtr4rd 2781	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
61		eqidd 2731	. . . . . . . . 9 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = 𝑏 ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
62	45, 61, 48, 52, 49	ovmpod 7564	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
63	53, 62	oveq12d 7431	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) = (𝐶(+_g‘𝑌)𝐶))
64		eqidd 2731	. . . . . . . 8 ⊢ (((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) ∧ (𝑥 = (𝑎(+_g‘𝑌)𝑏) ∧ 𝑦 = 𝑐)) → 𝐶 = 𝐶)
65	6, 41	ringacl 20168	. . . . . . . . 9 ⊢ ((𝑌 ∈ Ring ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
66	56, 47, 48, 65	syl3anc 1369	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → (𝑎(+_g‘𝑌)𝑏) ∈ 𝐵)
67	45, 64, 66, 52, 49	ovmpod 7564	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = 𝐶)
68	44, 63, 67	3eqtr4rd 2781	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))
69	60, 68	jca 510	. . . . 5 ⊢ ((((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵)) → ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
70	69	ralrimivvva 3201	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐))))
71	16, 32, 70	3jca 1126	. . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) ∧ 𝐶 ∈ 𝐵) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
72	13, 71	mpdan 683	. 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐶 = 0 ) → (𝑋 ∈ Abel ∧ (mulGrp‘𝑋) ∈ Smgrp ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)(𝑏(+_g‘𝑌)𝑐)) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑏)(+_g‘𝑌)(𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)) ∧ ((𝑎(+_g‘𝑌)𝑏)(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐) = ((𝑎(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)(+_g‘𝑌)(𝑏(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)𝑐)))))
73		plusgid 17230	. . . . 5 ⊢ +_g = Slot (+_g‘ndx)
74		plusgndxnmulrndx 17248	. . . . 5 ⊢ (+_g‘ndx) ≠ (._r‘ndx)
75	73, 74	setsnid 17148	. . . 4 ⊢ (+_g‘𝑌) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
76	14	fveq2i 6895	. . . 4 ⊢ (+_g‘𝑋) = (+_g‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩))
77	75, 76	eqtr4i 2761	. . 3 ⊢ (+_g‘𝑌) = (+_g‘𝑋)
78	14	eqcomi 2739	. . . . 5 ⊢ (𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩) = 𝑋
79	78	fveq2i 6895	. . . 4 ⊢ (._r‘(𝑌 sSet ⟨(._r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶)⟩)) = (._r‘𝑋)
80	26, 79	eqtri 2758	. . 3 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ 𝐶) = (._r‘𝑋)
81	18, 17, 77, 80	isrng 20050	. 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 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 Vcvv 3472 ∅c0 4323 ⟨cop 4635 ‘cfv 6544 (class class class)co 7413 ∈ cmpo 7415 ℕcn 12218 ℕ₀cn0 12478 sSet csts 17102 ndxcnx 17132 Basecbs 17150 +_gcplusg 17203 ._rcmulr 17204 0_gc0g 17391 Smgrpcsgrp 18645 Mndcmnd 18661 Abelcabl 19692 mulGrpcmgp 20030 Rngcrng 20048 Ringcrg 20129 CRingccrg 20130 ℤ/nℤczn 21273

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191 ax-addf 11193 ax-mulf 11194

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 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 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-tpos 8215 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-er 8707 df-ec 8709 df-qs 8713 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-sup 9441 df-inf 9442 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-2 12281 df-3 12282 df-4 12283 df-5 12284 df-6 12285 df-7 12286 df-8 12287 df-9 12288 df-n0 12479 df-z 12565 df-dec 12684 df-uz 12829 df-fz 13491 df-struct 17086 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ress 17180 df-plusg 17216 df-mulr 17217 df-starv 17218 df-sca 17219 df-vsca 17220 df-ip 17221 df-tset 17222 df-ple 17223 df-ds 17225 df-unif 17226 df-0g 17393 df-imas 17460 df-qus 17461 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18860 df-minusg 18861 df-sbg 18862 df-subg 19041 df-nsg 19042 df-eqg 19043 df-cmn 19693 df-abl 19694 df-mgp 20031 df-rng 20049 df-ur 20078 df-ring 20131 df-cring 20132 df-oppr 20227 df-subrng 20436 df-subrg 20461 df-lmod 20618 df-lss 20689 df-lsp 20729 df-sra 20932 df-rgmod 20933 df-lidl 20934 df-rsp 20935 df-2idl 21008 df-cnfld 21147 df-zring 21220 df-zn 21277

This theorem is referenced by: (None)

W3C validator