ablfac1c - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ablfac1c		Structured version Visualization version GIF version

Theorem ablfac1c 18668

Description: The factors of ablfac1b 18667 cover the entire group. (Contributed by Mario Carneiro, 21-Apr-2016.)

**Hypotheses**
Ref	Expression
ablfac1.b	⊢ 𝐵 = (Base‘𝐺)
ablfac1.o	⊢ 𝑂 = (od‘𝐺)
ablfac1.s	⊢ 𝑆 = (𝑝 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))})
ablfac1.g	⊢ (𝜑 → 𝐺 ∈ Abel)
ablfac1.f	⊢ (𝜑 → 𝐵 ∈ Fin)
ablfac1.1	⊢ (𝜑 → 𝐴 ⊆ ℙ)
ablfac1c.d	⊢ 𝐷 = {𝑤 ∈ ℙ ∣ 𝑤 ∥ (♯‘𝐵)}
ablfac1.2	⊢ (𝜑 → 𝐷 ⊆ 𝐴)

**Assertion**
Ref	Expression
ablfac1c	⊢ (𝜑 → (𝐺 DProd 𝑆) = 𝐵)

Distinct variable groups: 𝑤,𝑝,𝑥,𝐵 𝐷,𝑝,𝑥 𝜑,𝑝,𝑤,𝑥 𝐴,𝑝,𝑥 𝑂,𝑝,𝑥 𝐺,𝑝,𝑥 Allowed substitution hints: 𝐴(𝑤) 𝐷(𝑤) 𝑆(𝑥,𝑤,𝑝) 𝐺(𝑤) 𝑂(𝑤)

Proof of Theorem ablfac1c Dummy variable 𝑞 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ablfac1.f	. 2 ⊢ (𝜑 → 𝐵 ∈ Fin)
2		ablfac1.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
3	2	dprdssv 18613	. . 3 ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵
4	3	a1i 11	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ 𝐵)
5		ssfi 8343	. . . . . 6 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵) → (𝐺 DProd 𝑆) ∈ Fin)
6	1, 3, 5	sylancl 697	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ Fin)
7		hashcl 13337	. . . . 5 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
8	6, 7	syl 17	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
9		hashcl 13337	. . . . 5 ⊢ (𝐵 ∈ Fin → (♯‘𝐵) ∈ ℕ₀)
10	1, 9	syl 17	. . . 4 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ₀)
11		ablfac1.o	. . . . . . 7 ⊢ 𝑂 = (od‘𝐺)
12		ablfac1.s	. . . . . . 7 ⊢ 𝑆 = (𝑝 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))})
13		ablfac1.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ Abel)
14		ablfac1.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℙ)
15	2, 11, 12, 13, 1, 14	ablfac1b 18667	. . . . . 6 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
16		dprdsubg 18621	. . . . . 6 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
17	15, 16	syl 17	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
18	2	lagsubg 17855	. . . . 5 ⊢ (((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) ∧ 𝐵 ∈ Fin) → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
19	17, 1, 18	syl2anc 696	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
20		breq1 4805	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑞 → (𝑤 ∥ (♯‘𝐵) ↔ 𝑞 ∥ (♯‘𝐵)))
21		ablfac1c.d	. . . . . . . . . . 11 ⊢ 𝐷 = {𝑤 ∈ ℙ ∣ 𝑤 ∥ (♯‘𝐵)}
22	20, 21	elrab2 3505	. . . . . . . . . 10 ⊢ (𝑞 ∈ 𝐷 ↔ (𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)))
23		ablfac1.2	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
24	23	sseld 3741	. . . . . . . . . 10 ⊢ (𝜑 → (𝑞 ∈ 𝐷 → 𝑞 ∈ 𝐴))
25	22, 24	syl5bir 233	. . . . . . . . 9 ⊢ (𝜑 → ((𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴))
26	25	impl 651	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴)
27	2, 11, 12, 13, 1, 14	ablfac1a 18666	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) = (𝑞↑(𝑞 pCnt (♯‘𝐵))))
28		fvex 6360	. . . . . . . . . . . . . . . . . . . 20 ⊢ (Base‘𝐺) ∈ V
29	2, 28	eqeltri 2833	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐵 ∈ V
30	29	rabex 4962	. . . . . . . . . . . . . . . . . 18 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))} ∈ V
31	30, 12	dmmpti 6182	. . . . . . . . . . . . . . . . 17 ⊢ dom 𝑆 = 𝐴
32	31	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → dom 𝑆 = 𝐴)
33	15, 32	dprdf2 18604	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑆:𝐴⟶(SubGrp‘𝐺))
34	33	ffvelrnda 6520	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘𝐺))
35	15	adantr 472	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝐺dom DProd 𝑆)
36	31	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → dom 𝑆 = 𝐴)
37		simpr 479	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ 𝐴)
38	35, 36, 37	dprdub 18622	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))
39	17	adantr 472	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
40		eqid 2758	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ↾_s (𝐺 DProd 𝑆)) = (𝐺 ↾_s (𝐺 DProd 𝑆))
41	40	subsubg 17816	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
42	39, 41	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
43	34, 38, 42	mpbir2and 995	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
44	40	subgbas 17797	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
45	39, 44	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
46	6	adantr 472	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ Fin)
47	45, 46	eqeltrrd 2838	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin)
48		eqid 2758	. . . . . . . . . . . . . 14 ⊢ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))
49	48	lagsubg 17855	. . . . . . . . . . . . 13 ⊢ (((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∧ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
50	43, 47, 49	syl2anc 696	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
51	45	fveq2d 6354	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) = (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
52	50, 51	breqtrrd 4830	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(𝐺 DProd 𝑆)))
53	27, 52	eqbrtrrd 4826	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆)))
54	14	sselda 3742	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ ℙ)
55	8	nn0zd 11670	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
56	55	adantr 472	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
57		simpr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
58		ablgrp 18396	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
59	2	grpbn0 17650	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Grp → 𝐵 ≠ ∅)
60	13, 58, 59	3syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≠ ∅)
61		hashnncl 13347	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Fin → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
62	1, 61	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
63	60, 62	mpbird 247	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ)
64	63	adantr 472	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘𝐵) ∈ ℕ)
65	57, 64	pccld 15755	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
66	54, 65	syldan 488	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
67		pcdvdsb 15773	. . . . . . . . . . 11 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ ∧ (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
68	54, 56, 66, 67	syl3anc 1477	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
69	53, 68	mpbird 247	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
70	69	adantlr 753	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
71	26, 70	syldan 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
72		pceq0 15775	. . . . . . . . . 10 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘𝐵) ∈ ℕ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
73	57, 64, 72	syl2anc 696	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
74	73	biimpar 503	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) = 0)
75		eqid 2758	. . . . . . . . . . . . . . 15 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
76	75	subg0cl 17801	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ (𝐺 DProd 𝑆))
77		ne0i 4062	. . . . . . . . . . . . . 14 ⊢ ((0_g‘𝐺) ∈ (𝐺 DProd 𝑆) → (𝐺 DProd 𝑆) ≠ ∅)
78	17, 76, 77	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≠ ∅)
79		hashnncl 13347	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
80	6, 79	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
81	78, 80	mpbird 247	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
82	81	adantr 472	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
83	57, 82	pccld 15755	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ∈ ℕ₀)
84	83	nn0ge0d 11544	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
85	84	adantr 472	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
86	74, 85	eqbrtrd 4824	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
87	71, 86	pm2.61dan 867	. . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
88	87	ralrimiva 3102	. . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
89	10	nn0zd 11670	. . . . . 6 ⊢ (𝜑 → (♯‘𝐵) ∈ ℤ)
90		pc2dvds 15783	. . . . . 6 ⊢ (((♯‘𝐵) ∈ ℤ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ) → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
91	89, 55, 90	syl2anc 696	. . . . 5 ⊢ (𝜑 → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
92	88, 91	mpbird 247	. . . 4 ⊢ (𝜑 → (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))
93		dvdseq 15236	. . . 4 ⊢ ((((♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀ ∧ (♯‘𝐵) ∈ ℕ₀) ∧ ((♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵) ∧ (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))) → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
94	8, 10, 19, 92, 93	syl22anc 1478	. . 3 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
95		hashen 13327	. . . 4 ⊢ (((𝐺 DProd 𝑆) ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
96	6, 1, 95	syl2anc 696	. . 3 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
97	94, 96	mpbid 222	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≈ 𝐵)
98		fisseneq 8334	. 2 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵 ∧ (𝐺 DProd 𝑆) ≈ 𝐵) → (𝐺 DProd 𝑆) = 𝐵)
99	1, 4, 97, 98	syl3anc 1477	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = 𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1630 ∈ wcel 2137 ≠ wne 2930 ∀wral 3048 {crab 3052 Vcvv 3338 ⊆ wss 3713 ∅c0 4056 class class class wbr 4802 ↦ cmpt 4879 dom cdm 5264 ‘cfv 6047 (class class class)co 6811 ≈ cen 8116 Fincfn 8119 0cc0 10126 ≤ cle 10265 ℕcn 11210 ℕ₀cn0 11482 ℤcz 11567 ↑cexp 13052 ♯chash 13309 ∥ cdvds 15180 ℙcprime 15585 pCnt cpc 15741 Basecbs 16057 ↾_s cress 16058 0_gc0g 16300 Grpcgrp 17621 SubGrpcsubg 17787 odcod 18142 Abelcabl 18392 DProd cdprd 18590

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1986 ax-6 2052 ax-7 2088 ax-8 2139 ax-9 2146 ax-10 2166 ax-11 2181 ax-12 2194 ax-13 2389 ax-ext 2738 ax-rep 4921 ax-sep 4931 ax-nul 4939 ax-pow 4990 ax-pr 5053 ax-un 7112 ax-inf2 8709 ax-cnex 10182 ax-resscn 10183 ax-1cn 10184 ax-icn 10185 ax-addcl 10186 ax-addrcl 10187 ax-mulcl 10188 ax-mulrcl 10189 ax-mulcom 10190 ax-addass 10191 ax-mulass 10192 ax-distr 10193 ax-i2m1 10194 ax-1ne0 10195 ax-1rid 10196 ax-rnegex 10197 ax-rrecex 10198 ax-cnre 10199 ax-pre-lttri 10200 ax-pre-lttrn 10201 ax-pre-ltadd 10202 ax-pre-mulgt0 10203 ax-pre-sup 10204

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1633 df-fal 1636 df-ex 1852 df-nf 1857 df-sb 2045 df-eu 2609 df-mo 2610 df-clab 2745 df-cleq 2751 df-clel 2754 df-nfc 2889 df-ne 2931 df-nel 3034 df-ral 3053 df-rex 3054 df-reu 3055 df-rmo 3056 df-rab 3057 df-v 3340 df-sbc 3575 df-csb 3673 df-dif 3716 df-un 3718 df-in 3720 df-ss 3727 df-pss 3729 df-nul 4057 df-if 4229 df-pw 4302 df-sn 4320 df-pr 4322 df-tp 4324 df-op 4326 df-uni 4587 df-int 4626 df-iun 4672 df-iin 4673 df-disj 4771 df-br 4803 df-opab 4863 df-mpt 4880 df-tr 4903 df-id 5172 df-eprel 5177 df-po 5185 df-so 5186 df-fr 5223 df-se 5224 df-we 5225 df-xp 5270 df-rel 5271 df-cnv 5272 df-co 5273 df-dm 5274 df-rn 5275 df-res 5276 df-ima 5277 df-pred 5839 df-ord 5885 df-on 5886 df-lim 5887 df-suc 5888 df-iota 6010 df-fun 6049 df-fn 6050 df-f 6051 df-f1 6052 df-fo 6053 df-f1o 6054 df-fv 6055 df-isom 6056 df-riota 6772 df-ov 6814 df-oprab 6815 df-mpt2 6816 df-of 7060 df-om 7229 df-1st 7331 df-2nd 7332 df-supp 7462 df-tpos 7519 df-wrecs 7574 df-recs 7635 df-rdg 7673 df-1o 7727 df-2o 7728 df-oadd 7731 df-omul 7732 df-er 7909 df-ec 7911 df-qs 7915 df-map 8023 df-ixp 8073 df-en 8120 df-dom 8121 df-sdom 8122 df-fin 8123 df-fsupp 8439 df-sup 8511 df-inf 8512 df-oi 8578 df-card 8953 df-acn 8956 df-cda 9180 df-pnf 10266 df-mnf 10267 df-xr 10268 df-ltxr 10269 df-le 10270 df-sub 10458 df-neg 10459 df-div 10875 df-nn 11211 df-2 11269 df-3 11270 df-n0 11483 df-xnn0 11554 df-z 11568 df-uz 11878 df-q 11980 df-rp 12024 df-fz 12518 df-fzo 12658 df-fl 12785 df-mod 12861 df-seq 12994 df-exp 13053 df-fac 13253 df-bc 13282 df-hash 13310 df-cj 14036 df-re 14037 df-im 14038 df-sqrt 14172 df-abs 14173 df-clim 14416 df-sum 14614 df-dvds 15181 df-gcd 15417 df-prm 15586 df-pc 15742 df-ndx 16060 df-slot 16061 df-base 16063 df-sets 16064 df-ress 16065 df-plusg 16154 df-0g 16302 df-gsum 16303 df-mre 16446 df-mrc 16447 df-acs 16449 df-mgm 17441 df-sgrp 17483 df-mnd 17494 df-mhm 17534 df-submnd 17535 df-grp 17624 df-minusg 17625 df-sbg 17626 df-mulg 17740 df-subg 17790 df-eqg 17792 df-ghm 17857 df-gim 17900 df-ga 17921 df-cntz 17948 df-oppg 17974 df-od 18146 df-lsm 18249 df-pj1 18250 df-cmn 18393 df-abl 18394 df-dprd 18592

This theorem is referenced by: ablfaclem2 18683

W3C validator