Theorem srgpcomp 13622

Description: If two elements of a semiring commute, they also commute if one of the elements is raised to a higher power. (Contributed by AV, 23-Aug-2019.)

Hypotheses

Ref	Expression
srgpcomp.s	⊢ 𝑆 = (Base‘𝑅)
srgpcomp.m	⊢ × = (.r‘𝑅)
srgpcomp.g	⊢ 𝐺 = (mulGrp‘𝑅)
srgpcomp.e	⊢ ↑ = (.g‘𝐺)
srgpcomp.r	⊢ (𝜑 → 𝑅 ∈ SRing)
srgpcomp.a	⊢ (𝜑 → 𝐴 ∈ 𝑆)
srgpcomp.b	⊢ (𝜑 → 𝐵 ∈ 𝑆)
srgpcomp.k	⊢ (𝜑 → 𝐾 ∈ ℕ0)
srgpcomp.c	⊢ (𝜑 → (𝐴 × 𝐵) = (𝐵 × 𝐴))

Assertion

Ref	Expression
srgpcomp	⊢ (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵)))

Proof of Theorem srgpcomp

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		srgpcomp.k	. 2 ⊢ (𝜑 → 𝐾 ∈ ℕ0)
2		oveq1 5932	. . . . . 6 ⊢ (𝑥 = 0 → (𝑥 ↑ 𝐵) = (0 ↑ 𝐵))
3	2	oveq1d 5940	. . . . 5 ⊢ (𝑥 = 0 → ((𝑥 ↑ 𝐵) × 𝐴) = ((0 ↑ 𝐵) × 𝐴))
4	2	oveq2d 5941	. . . . 5 ⊢ (𝑥 = 0 → (𝐴 × (𝑥 ↑ 𝐵)) = (𝐴 × (0 ↑ 𝐵)))
5	3, 4	eqeq12d 2211	. . . 4 ⊢ (𝑥 = 0 → (((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵)) ↔ ((0 ↑ 𝐵) × 𝐴) = (𝐴 × (0 ↑ 𝐵))))
6	5	imbi2d 230	. . 3 ⊢ (𝑥 = 0 → ((𝜑 → ((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵))) ↔ (𝜑 → ((0 ↑ 𝐵) × 𝐴) = (𝐴 × (0 ↑ 𝐵)))))
7		oveq1 5932	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ↑ 𝐵) = (𝑦 ↑ 𝐵))
8	7	oveq1d 5940	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 ↑ 𝐵) × 𝐴) = ((𝑦 ↑ 𝐵) × 𝐴))
9	7	oveq2d 5941	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴 × (𝑥 ↑ 𝐵)) = (𝐴 × (𝑦 ↑ 𝐵)))
10	8, 9	eqeq12d 2211	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵)) ↔ ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵))))
11	10	imbi2d 230	. . 3 ⊢ (𝑥 = 𝑦 → ((𝜑 → ((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵))) ↔ (𝜑 → ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵)))))
12		oveq1 5932	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 ↑ 𝐵) = ((𝑦 + 1) ↑ 𝐵))
13	12	oveq1d 5940	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → ((𝑥 ↑ 𝐵) × 𝐴) = (((𝑦 + 1) ↑ 𝐵) × 𝐴))
14	12	oveq2d 5941	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (𝐴 × (𝑥 ↑ 𝐵)) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))
15	13, 14	eqeq12d 2211	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → (((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵)) ↔ (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵))))
16	15	imbi2d 230	. . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝜑 → ((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵))) ↔ (𝜑 → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))))
17		oveq1 5932	. . . . . 6 ⊢ (𝑥 = 𝐾 → (𝑥 ↑ 𝐵) = (𝐾 ↑ 𝐵))
18	17	oveq1d 5940	. . . . 5 ⊢ (𝑥 = 𝐾 → ((𝑥 ↑ 𝐵) × 𝐴) = ((𝐾 ↑ 𝐵) × 𝐴))
19	17	oveq2d 5941	. . . . 5 ⊢ (𝑥 = 𝐾 → (𝐴 × (𝑥 ↑ 𝐵)) = (𝐴 × (𝐾 ↑ 𝐵)))
20	18, 19	eqeq12d 2211	. . . 4 ⊢ (𝑥 = 𝐾 → (((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵)) ↔ ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵))))
21	20	imbi2d 230	. . 3 ⊢ (𝑥 = 𝐾 → ((𝜑 → ((𝑥 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑥 ↑ 𝐵))) ↔ (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵)))))
22		srgpcomp.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
23		srgpcomp.r	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ SRing)
24		srgpcomp.g	. . . . . . . . . 10 ⊢ 𝐺 = (mulGrp‘𝑅)
25		srgpcomp.s	. . . . . . . . . 10 ⊢ 𝑆 = (Base‘𝑅)
26	24, 25	mgpbasg 13558	. . . . . . . . 9 ⊢ (𝑅 ∈ SRing → 𝑆 = (Base‘𝐺))
27	23, 26	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝑆 = (Base‘𝐺))
28	22, 27	eleqtrd 2275	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ (Base‘𝐺))
29		eqid 2196	. . . . . . . 8 ⊢ (Base‘𝐺) = (Base‘𝐺)
30		eqid 2196	. . . . . . . 8 ⊢ (0g‘𝐺) = (0g‘𝐺)
31		srgpcomp.e	. . . . . . . 8 ⊢ ↑ = (.g‘𝐺)
32	29, 30, 31	mulg0 13331	. . . . . . 7 ⊢ (𝐵 ∈ (Base‘𝐺) → (0 ↑ 𝐵) = (0g‘𝐺))
33	28, 32	syl 14	. . . . . 6 ⊢ (𝜑 → (0 ↑ 𝐵) = (0g‘𝐺))
34		eqid 2196	. . . . . . . 8 ⊢ (1r‘𝑅) = (1r‘𝑅)
35	24, 34	ringidvalg 13593	. . . . . . 7 ⊢ (𝑅 ∈ SRing → (1r‘𝑅) = (0g‘𝐺))
36	23, 35	syl 14	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) = (0g‘𝐺))
37	33, 36	eqtr4d 2232	. . . . 5 ⊢ (𝜑 → (0 ↑ 𝐵) = (1r‘𝑅))
38	37	oveq1d 5940	. . . 4 ⊢ (𝜑 → ((0 ↑ 𝐵) × 𝐴) = ((1r‘𝑅) × 𝐴))
39		srgpcomp.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
40		srgpcomp.m	. . . . . . 7 ⊢ × = (.r‘𝑅)
41	25, 40, 34	srgridm 13612	. . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ 𝐴 ∈ 𝑆) → (𝐴 × (1r‘𝑅)) = 𝐴)
42	23, 39, 41	syl2anc 411	. . . . 5 ⊢ (𝜑 → (𝐴 × (1r‘𝑅)) = 𝐴)
43	37	oveq2d 5941	. . . . 5 ⊢ (𝜑 → (𝐴 × (0 ↑ 𝐵)) = (𝐴 × (1r‘𝑅)))
44	25, 40, 34	srglidm 13611	. . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ 𝐴 ∈ 𝑆) → ((1r‘𝑅) × 𝐴) = 𝐴)
45	23, 39, 44	syl2anc 411	. . . . 5 ⊢ (𝜑 → ((1r‘𝑅) × 𝐴) = 𝐴)
46	42, 43, 45	3eqtr4rd 2240	. . . 4 ⊢ (𝜑 → ((1r‘𝑅) × 𝐴) = (𝐴 × (0 ↑ 𝐵)))
47	38, 46	eqtrd 2229	. . 3 ⊢ (𝜑 → ((0 ↑ 𝐵) × 𝐴) = (𝐴 × (0 ↑ 𝐵)))
48	24	srgmgp 13600	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd)
49	23, 48	syl 14	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ∈ Mnd)
50	49	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝐺 ∈ Mnd)
51		simpr 110	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝑦 ∈ ℕ0)
52	22	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝐵 ∈ 𝑆)
53	27	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝑆 = (Base‘𝐺))
54	52, 53	eleqtrd 2275	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝐵 ∈ (Base‘𝐺))
55		eqid 2196	. . . . . . . . . . . . 13 ⊢ (+g‘𝐺) = (+g‘𝐺)
56	29, 31, 55	mulgnn0p1 13339	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ ℕ0 ∧ 𝐵 ∈ (Base‘𝐺)) → ((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵)(+g‘𝐺)𝐵))
57	50, 51, 54, 56	syl3anc 1249	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵)(+g‘𝐺)𝐵))
58	24, 40	mgpplusgg 13556	. . . . . . . . . . . . . . 15 ⊢ (𝑅 ∈ SRing → × = (+g‘𝐺))
59	23, 58	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝜑 → × = (+g‘𝐺))
60	59	oveqd 5942	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑦 ↑ 𝐵) × 𝐵) = ((𝑦 ↑ 𝐵)(+g‘𝐺)𝐵))
61	60	eqeq2d 2208	. . . . . . . . . . . 12 ⊢ (𝜑 → (((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵) × 𝐵) ↔ ((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵)(+g‘𝐺)𝐵)))
62	61	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵) × 𝐵) ↔ ((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵)(+g‘𝐺)𝐵)))
63	57, 62	mpbird 167	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑦 + 1) ↑ 𝐵) = ((𝑦 ↑ 𝐵) × 𝐵))
64	63	oveq1d 5940	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (((𝑦 ↑ 𝐵) × 𝐵) × 𝐴))
65		srgpcomp.c	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 × 𝐵) = (𝐵 × 𝐴))
66	65	eqcomd 2202	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐵 × 𝐴) = (𝐴 × 𝐵))
67	66	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (𝐵 × 𝐴) = (𝐴 × 𝐵))
68	67	oveq2d 5941	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑦 ↑ 𝐵) × (𝐵 × 𝐴)) = ((𝑦 ↑ 𝐵) × (𝐴 × 𝐵)))
69	23	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝑅 ∈ SRing)
70	29, 31	mulgnn0cl 13344	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ ℕ0 ∧ 𝐵 ∈ (Base‘𝐺)) → (𝑦 ↑ 𝐵) ∈ (Base‘𝐺))
71	50, 51, 54, 70	syl3anc 1249	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (𝑦 ↑ 𝐵) ∈ (Base‘𝐺))
72	71, 53	eleqtrrd 2276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (𝑦 ↑ 𝐵) ∈ 𝑆)
73	39	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → 𝐴 ∈ 𝑆)
74	25, 40	srgass 13603	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ SRing ∧ ((𝑦 ↑ 𝐵) ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (((𝑦 ↑ 𝐵) × 𝐵) × 𝐴) = ((𝑦 ↑ 𝐵) × (𝐵 × 𝐴)))
75	69, 72, 52, 73, 74	syl13anc 1251	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 ↑ 𝐵) × 𝐵) × 𝐴) = ((𝑦 ↑ 𝐵) × (𝐵 × 𝐴)))
76	25, 40	srgass 13603	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ SRing ∧ ((𝑦 ↑ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵) = ((𝑦 ↑ 𝐵) × (𝐴 × 𝐵)))
77	69, 72, 73, 52, 76	syl13anc 1251	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵) = ((𝑦 ↑ 𝐵) × (𝐴 × 𝐵)))
78	68, 75, 77	3eqtr4d 2239	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 ↑ 𝐵) × 𝐵) × 𝐴) = (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵))
79	64, 78	eqtrd 2229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵))
80	79	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵))) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵))
81		oveq1 5932	. . . . . . . 8 ⊢ (((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵)) → (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵) = ((𝐴 × (𝑦 ↑ 𝐵)) × 𝐵))
82	25, 40	srgass 13603	. . . . . . . . . 10 ⊢ ((𝑅 ∈ SRing ∧ (𝐴 ∈ 𝑆 ∧ (𝑦 ↑ 𝐵) ∈ 𝑆 ∧ 𝐵 ∈ 𝑆)) → ((𝐴 × (𝑦 ↑ 𝐵)) × 𝐵) = (𝐴 × ((𝑦 ↑ 𝐵) × 𝐵)))
83	69, 73, 72, 52, 82	syl13anc 1251	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝐴 × (𝑦 ↑ 𝐵)) × 𝐵) = (𝐴 × ((𝑦 ↑ 𝐵) × 𝐵)))
84	63	eqcomd 2202	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝑦 ↑ 𝐵) × 𝐵) = ((𝑦 + 1) ↑ 𝐵))
85	84	oveq2d 5941	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (𝐴 × ((𝑦 ↑ 𝐵) × 𝐵)) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))
86	83, 85	eqtrd 2229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → ((𝐴 × (𝑦 ↑ 𝐵)) × 𝐵) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))
87	81, 86	sylan9eqr 2251	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵))) → (((𝑦 ↑ 𝐵) × 𝐴) × 𝐵) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))
88	80, 87	eqtrd 2229	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵))) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))
89	88	ex 115	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵)) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵))))
90	89	expcom 116	. . . 4 ⊢ (𝑦 ∈ ℕ0 → (𝜑 → (((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵)) → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))))
91	90	a2d 26	. . 3 ⊢ (𝑦 ∈ ℕ0 → ((𝜑 → ((𝑦 ↑ 𝐵) × 𝐴) = (𝐴 × (𝑦 ↑ 𝐵))) → (𝜑 → (((𝑦 + 1) ↑ 𝐵) × 𝐴) = (𝐴 × ((𝑦 + 1) ↑ 𝐵)))))
92	6, 11, 16, 21, 47, 91	nn0ind 9457	. 2 ⊢ (𝐾 ∈ ℕ0 → (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵))))
93	1, 92	mpcom 36	1 ⊢ (𝜑 → ((𝐾 ↑ 𝐵) × 𝐴) = (𝐴 × (𝐾 ↑ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2167  ‘cfv 5259  (class class class)co 5925  0cc0 7896  1c1 7897   + caddc 7899  ℕ₀cn0 9266  Basecbs 12703  +_gcplusg 12780  ._rcmulr 12781  0_gc0g 12958  Mndcmnd 13118  ._gcmg 13325  mulGrpcmgp 13552  1_rcur 13591  SRingcsrg 13595

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-2 9066  df-3 9067  df-n0 9267  df-z 9344  df-uz 9619  df-seqfrec 10557  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-minusg 13206  df-mulg 13326  df-mgp 13553  df-ur 13592  df-srg 13596

This theorem is referenced by:  srgpcompp  13623