Theorem unitprodclb 33352

Description: A finite product is a unit iff all factors are units. (Contributed by Thierry Arnoux, 27-May-2025.)

Hypotheses

Ref	Expression
unitprodclb.1	⊢ 𝐵 = (Base‘𝑅)
unitprodclb.u	⊢ 𝑈 = (Unit‘𝑅)
unitprodclb.m	⊢ 𝑀 = (mulGrp‘𝑅)
unitprodclb.r	⊢ (𝜑 → 𝑅 ∈ CRing)
unitprodclb.f	⊢ (𝜑 → 𝐹 ∈ Word 𝐵)

Assertion

Ref	Expression
unitprodclb	⊢ (𝜑 → ((𝑀 Σg 𝐹) ∈ 𝑈 ↔ ran 𝐹 ⊆ 𝑈))

Proof of Theorem unitprodclb

Dummy variables 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		unitprodclb.f	. 2 ⊢ (𝜑 → 𝐹 ∈ Word 𝐵)
2		unitprodclb.r	. 2 ⊢ (𝜑 → 𝑅 ∈ CRing)
3		oveq2 7354	. . . . . 6 ⊢ (𝑔 = ∅ → (𝑀 Σg 𝑔) = (𝑀 Σg ∅))
4	3	eleq1d 2816	. . . . 5 ⊢ (𝑔 = ∅ → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ (𝑀 Σg ∅) ∈ 𝑈))
5		rneq 5876	. . . . . 6 ⊢ (𝑔 = ∅ → ran 𝑔 = ran ∅)
6	5	sseq1d 3966	. . . . 5 ⊢ (𝑔 = ∅ → (ran 𝑔 ⊆ 𝑈 ↔ ran ∅ ⊆ 𝑈))
7	4, 6	bibi12d 345	. . . 4 ⊢ (𝑔 = ∅ → (((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈) ↔ ((𝑀 Σg ∅) ∈ 𝑈 ↔ ran ∅ ⊆ 𝑈)))
8	7	imbi2d 340	. . 3 ⊢ (𝑔 = ∅ → ((𝑅 ∈ CRing → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈)) ↔ (𝑅 ∈ CRing → ((𝑀 Σg ∅) ∈ 𝑈 ↔ ran ∅ ⊆ 𝑈))))
9		oveq2 7354	. . . . . 6 ⊢ (𝑔 = 𝑓 → (𝑀 Σg 𝑔) = (𝑀 Σg 𝑓))
10	9	eleq1d 2816	. . . . 5 ⊢ (𝑔 = 𝑓 → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ (𝑀 Σg 𝑓) ∈ 𝑈))
11		rneq 5876	. . . . . 6 ⊢ (𝑔 = 𝑓 → ran 𝑔 = ran 𝑓)
12	11	sseq1d 3966	. . . . 5 ⊢ (𝑔 = 𝑓 → (ran 𝑔 ⊆ 𝑈 ↔ ran 𝑓 ⊆ 𝑈))
13	10, 12	bibi12d 345	. . . 4 ⊢ (𝑔 = 𝑓 → (((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈) ↔ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)))
14	13	imbi2d 340	. . 3 ⊢ (𝑔 = 𝑓 → ((𝑅 ∈ CRing → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈)) ↔ (𝑅 ∈ CRing → ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈))))
15		oveq2 7354	. . . . . 6 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → (𝑀 Σg 𝑔) = (𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)))
16	15	eleq1d 2816	. . . . 5 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ (𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈))
17		rneq 5876	. . . . . 6 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → ran 𝑔 = ran (𝑓 ++ ⟨“𝑥”⟩))
18	17	sseq1d 3966	. . . . 5 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → (ran 𝑔 ⊆ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈))
19	16, 18	bibi12d 345	. . . 4 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → (((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈) ↔ ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈)))
20	19	imbi2d 340	. . 3 ⊢ (𝑔 = (𝑓 ++ ⟨“𝑥”⟩) → ((𝑅 ∈ CRing → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈)) ↔ (𝑅 ∈ CRing → ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈))))
21		oveq2 7354	. . . . . 6 ⊢ (𝑔 = 𝐹 → (𝑀 Σg 𝑔) = (𝑀 Σg 𝐹))
22	21	eleq1d 2816	. . . . 5 ⊢ (𝑔 = 𝐹 → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ (𝑀 Σg 𝐹) ∈ 𝑈))
23		rneq 5876	. . . . . 6 ⊢ (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
24	23	sseq1d 3966	. . . . 5 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ⊆ 𝑈 ↔ ran 𝐹 ⊆ 𝑈))
25	22, 24	bibi12d 345	. . . 4 ⊢ (𝑔 = 𝐹 → (((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈) ↔ ((𝑀 Σg 𝐹) ∈ 𝑈 ↔ ran 𝐹 ⊆ 𝑈)))
26	25	imbi2d 340	. . 3 ⊢ (𝑔 = 𝐹 → ((𝑅 ∈ CRing → ((𝑀 Σg 𝑔) ∈ 𝑈 ↔ ran 𝑔 ⊆ 𝑈)) ↔ (𝑅 ∈ CRing → ((𝑀 Σg 𝐹) ∈ 𝑈 ↔ ran 𝐹 ⊆ 𝑈))))
27		unitprodclb.m	. . . . . . 7 ⊢ 𝑀 = (mulGrp‘𝑅)
28		eqid 2731	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
29	27, 28	ringidval 20102	. . . . . 6 ⊢ (1r‘𝑅) = (0g‘𝑀)
30	29	gsum0 18592	. . . . 5 ⊢ (𝑀 Σg ∅) = (1r‘𝑅)
31		crngring 20164	. . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
32		unitprodclb.u	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅)
33	32, 28	1unit 20293	. . . . . 6 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝑈)
34	31, 33	syl 17	. . . . 5 ⊢ (𝑅 ∈ CRing → (1r‘𝑅) ∈ 𝑈)
35	30, 34	eqeltrid 2835	. . . 4 ⊢ (𝑅 ∈ CRing → (𝑀 Σg ∅) ∈ 𝑈)
36		rn0 5866	. . . . . 6 ⊢ ran ∅ = ∅
37		0ss 4350	. . . . . 6 ⊢ ∅ ⊆ 𝑈
38	36, 37	eqsstri 3981	. . . . 5 ⊢ ran ∅ ⊆ 𝑈
39	38	a1i 11	. . . 4 ⊢ (𝑅 ∈ CRing → ran ∅ ⊆ 𝑈)
40	35, 39	2thd 265	. . 3 ⊢ (𝑅 ∈ CRing → ((𝑀 Σg ∅) ∈ 𝑈 ↔ ran ∅ ⊆ 𝑈))
41		simplr 768	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑅 ∈ CRing)
42		unitprodclb.1	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑅)
43	27, 42	mgpbas 20064	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑀)
44	27	crngmgp 20160	. . . . . . . . . 10 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd)
45	44	ad2antlr 727	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑀 ∈ CMnd)
46		ovexd 7381	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (0..^(♯‘𝑓)) ∈ V)
47		wrdf 14425	. . . . . . . . . 10 ⊢ (𝑓 ∈ Word 𝐵 → 𝑓:(0..^(♯‘𝑓))⟶𝐵)
48	47	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑓:(0..^(♯‘𝑓))⟶𝐵)
49		fvexd 6837	. . . . . . . . . 10 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (1r‘𝑅) ∈ V)
50		simplll 774	. . . . . . . . . 10 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑓 ∈ Word 𝐵)
51	49, 50	wrdfsupp 32916	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑓 finSupp (1r‘𝑅))
52	43, 29, 45, 46, 48, 51	gsumcl 19828	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (𝑀 Σg 𝑓) ∈ 𝐵)
53		simpllr 775	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑥 ∈ 𝐵)
54		eqid 2731	. . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅)
55	32, 54, 42	unitmulclb 20300	. . . . . . . 8 ⊢ ((𝑅 ∈ CRing ∧ (𝑀 Σg 𝑓) ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (((𝑀 Σg 𝑓)(.r‘𝑅)𝑥) ∈ 𝑈 ↔ ((𝑀 Σg 𝑓) ∈ 𝑈 ∧ 𝑥 ∈ 𝑈)))
56	41, 52, 53, 55	syl3anc 1373	. . . . . . 7 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (((𝑀 Σg 𝑓)(.r‘𝑅)𝑥) ∈ 𝑈 ↔ ((𝑀 Σg 𝑓) ∈ 𝑈 ∧ 𝑥 ∈ 𝑈)))
57		simpr 484	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈))
58		vex 3440	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
59	58	snss 4737	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑈 ↔ {𝑥} ⊆ 𝑈)
60		s1rn 14507	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝐵 → ran ⟨“𝑥”⟩ = {𝑥})
61	60	sseq1d 3966	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐵 → (ran ⟨“𝑥”⟩ ⊆ 𝑈 ↔ {𝑥} ⊆ 𝑈))
62	59, 61	bitr4id 290	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝑈 ↔ ran ⟨“𝑥”⟩ ⊆ 𝑈))
63	53, 62	syl 17	. . . . . . . . 9 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (𝑥 ∈ 𝑈 ↔ ran ⟨“𝑥”⟩ ⊆ 𝑈))
64	57, 63	anbi12d 632	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (((𝑀 Σg 𝑓) ∈ 𝑈 ∧ 𝑥 ∈ 𝑈) ↔ (ran 𝑓 ⊆ 𝑈 ∧ ran ⟨“𝑥”⟩ ⊆ 𝑈)))
65		unss 4140	. . . . . . . 8 ⊢ ((ran 𝑓 ⊆ 𝑈 ∧ ran ⟨“𝑥”⟩ ⊆ 𝑈) ↔ (ran 𝑓 ∪ ran ⟨“𝑥”⟩) ⊆ 𝑈)
66	64, 65	bitrdi 287	. . . . . . 7 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (((𝑀 Σg 𝑓) ∈ 𝑈 ∧ 𝑥 ∈ 𝑈) ↔ (ran 𝑓 ∪ ran ⟨“𝑥”⟩) ⊆ 𝑈))
67	56, 66	bitrd 279	. . . . . 6 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (((𝑀 Σg 𝑓)(.r‘𝑅)𝑥) ∈ 𝑈 ↔ (ran 𝑓 ∪ ran ⟨“𝑥”⟩) ⊆ 𝑈))
68	27	ringmgp 20158	. . . . . . . . . 10 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd)
69	31, 68	syl 17	. . . . . . . . 9 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ Mnd)
70	69	ad2antlr 727	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → 𝑀 ∈ Mnd)
71	27, 54	mgpplusg 20063	. . . . . . . . 9 ⊢ (.r‘𝑅) = (+g‘𝑀)
72	43, 71	gsumccatsn 18751	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ 𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) = ((𝑀 Σg 𝑓)(.r‘𝑅)𝑥))
73	70, 50, 53, 72	syl3anc 1373	. . . . . . 7 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) = ((𝑀 Σg 𝑓)(.r‘𝑅)𝑥))
74	73	eleq1d 2816	. . . . . 6 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ((𝑀 Σg 𝑓)(.r‘𝑅)𝑥) ∈ 𝑈))
75	53	s1cld 14511	. . . . . . . 8 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → ⟨“𝑥”⟩ ∈ Word 𝐵)
76		ccatrn 14497	. . . . . . . 8 ⊢ ((𝑓 ∈ Word 𝐵 ∧ ⟨“𝑥”⟩ ∈ Word 𝐵) → ran (𝑓 ++ ⟨“𝑥”⟩) = (ran 𝑓 ∪ ran ⟨“𝑥”⟩))
77	50, 75, 76	syl2anc 584	. . . . . . 7 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → ran (𝑓 ++ ⟨“𝑥”⟩) = (ran 𝑓 ∪ ran ⟨“𝑥”⟩))
78	77	sseq1d 3966	. . . . . 6 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈 ↔ (ran 𝑓 ∪ ran ⟨“𝑥”⟩) ⊆ 𝑈))
79	67, 74, 78	3bitr4d 311	. . . . 5 ⊢ ((((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑅 ∈ CRing) ∧ ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈))
80	79	exp31 419	. . . 4 ⊢ ((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑅 ∈ CRing → (((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈) → ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈))))
81	80	a2d 29	. . 3 ⊢ ((𝑓 ∈ Word 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑅 ∈ CRing → ((𝑀 Σg 𝑓) ∈ 𝑈 ↔ ran 𝑓 ⊆ 𝑈)) → (𝑅 ∈ CRing → ((𝑀 Σg (𝑓 ++ ⟨“𝑥”⟩)) ∈ 𝑈 ↔ ran (𝑓 ++ ⟨“𝑥”⟩) ⊆ 𝑈))))
82	8, 14, 20, 26, 40, 81	wrdind 14629	. 2 ⊢ (𝐹 ∈ Word 𝐵 → (𝑅 ∈ CRing → ((𝑀 Σg 𝐹) ∈ 𝑈 ↔ ran 𝐹 ⊆ 𝑈)))
83	1, 2, 82	sylc 65	1 ⊢ (𝜑 → ((𝑀 Σg 𝐹) ∈ 𝑈 ↔ ran 𝐹 ⊆ 𝑈))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  Vcvv 3436   ∪ cun 3900   ⊆ wss 3902  ∅c0 4283  {csn 4576  ran crn 5617  ⟶wf 6477  ‘cfv 6481  (class class class)co 7346  0cc0 11006  ..^cfzo 13554  ♯chash 14237  Word cword 14420   ++ cconcat 14477  ⟨“cs1 14503  Basecbs 17120  ._rcmulr 17162   Σ_g cgsu 17344  Mndcmnd 18642  CMndccmn 19693  mulGrpcmgp 20059  1_rcur 20100  Ringcrg 20152  CRingccrg 20153  Unitcui 20274

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11062  ax-resscn 11063  ax-1cn 11064  ax-icn 11065  ax-addcl 11066  ax-addrcl 11067  ax-mulcl 11068  ax-mulrcl 11069  ax-mulcom 11070  ax-addass 11071  ax-mulass 11072  ax-distr 11073  ax-i2m1 11074  ax-1ne0 11075  ax-1rid 11076  ax-rnegex 11077  ax-rrecex 11078  ax-cnre 11079  ax-pre-lttri 11080  ax-pre-lttrn 11081  ax-pre-ltadd 11082  ax-pre-mulgt0 11083

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-se 5570  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-isom 6490  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-supp 8091  df-tpos 8156  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-er 8622  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873  df-fsupp 9246  df-oi 9396  df-card 9832  df-pnf 11148  df-mnf 11149  df-xr 11150  df-ltxr 11151  df-le 11152  df-sub 11346  df-neg 11347  df-nn 12126  df-2 12188  df-3 12189  df-n0 12382  df-xnn0 12455  df-z 12469  df-uz 12733  df-fz 13408  df-fzo 13555  df-seq 13909  df-hash 14238  df-word 14421  df-lsw 14470  df-concat 14478  df-s1 14504  df-substr 14549  df-pfx 14579  df-sets 17075  df-slot 17093  df-ndx 17105  df-base 17121  df-ress 17142  df-plusg 17174  df-mulr 17175  df-0g 17345  df-gsum 17346  df-mgm 18548  df-sgrp 18627  df-mnd 18643  df-submnd 18692  df-grp 18849  df-minusg 18850  df-cntz 19230  df-cmn 19695  df-abl 19696  df-mgp 20060  df-rng 20072  df-ur 20101  df-ring 20154  df-cring 20155  df-oppr 20256  df-dvdsr 20276  df-unit 20277

This theorem is referenced by:  1arithidom  33500