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 19589

Description: The factors of ablfac1b 19588 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 19534	. . 3 ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵
4	3	a1i 11	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ 𝐵)
5		ssfi 8918	. . . . . 6 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵) → (𝐺 DProd 𝑆) ∈ Fin)
6	1, 3, 5	sylancl 585	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ Fin)
7		hashcl 13999	. . . . 5 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
8	6, 7	syl 17	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
9		hashcl 13999	. . . . 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 19588	. . . . . 6 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
16		dprdsubg 19542	. . . . . 6 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
17	15, 16	syl 17	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
18	2	lagsubg 18733	. . . . 5 ⊢ (((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) ∧ 𝐵 ∈ Fin) → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
19	17, 1, 18	syl2anc 583	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
20		breq1 5073	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑞 → (𝑤 ∥ (♯‘𝐵) ↔ 𝑞 ∥ (♯‘𝐵)))
21		ablfac1c.d	. . . . . . . . . . 11 ⊢ 𝐷 = {𝑤 ∈ ℙ ∣ 𝑤 ∥ (♯‘𝐵)}
22	20, 21	elrab2 3620	. . . . . . . . . 10 ⊢ (𝑞 ∈ 𝐷 ↔ (𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)))
23		ablfac1.2	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
24	23	sseld 3916	. . . . . . . . . 10 ⊢ (𝜑 → (𝑞 ∈ 𝐷 → 𝑞 ∈ 𝐴))
25	22, 24	syl5bir 242	. . . . . . . . 9 ⊢ (𝜑 → ((𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴))
26	25	impl 455	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴)
27	2, 11, 12, 13, 1, 14	ablfac1a 19587	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) = (𝑞↑(𝑞 pCnt (♯‘𝐵))))
28	2	fvexi 6770	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐵 ∈ V
29	28	rabex 5251	. . . . . . . . . . . . . . . . . 18 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))} ∈ V
30	29, 12	dmmpti 6561	. . . . . . . . . . . . . . . . 17 ⊢ dom 𝑆 = 𝐴
31	30	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → dom 𝑆 = 𝐴)
32	15, 31	dprdf2 19525	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑆:𝐴⟶(SubGrp‘𝐺))
33	32	ffvelrnda 6943	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘𝐺))
34	15	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝐺dom DProd 𝑆)
35	30	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → dom 𝑆 = 𝐴)
36		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ 𝐴)
37	34, 35, 36	dprdub 19543	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))
38	17	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
39		eqid 2738	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ↾_s (𝐺 DProd 𝑆)) = (𝐺 ↾_s (𝐺 DProd 𝑆))
40	39	subsubg 18693	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
41	38, 40	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
42	33, 37, 41	mpbir2and 709	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
43	39	subgbas 18674	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
44	38, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
45	6	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ Fin)
46	44, 45	eqeltrrd 2840	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin)
47		eqid 2738	. . . . . . . . . . . . . 14 ⊢ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))
48	47	lagsubg 18733	. . . . . . . . . . . . 13 ⊢ (((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∧ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
49	42, 46, 48	syl2anc 583	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
50	44	fveq2d 6760	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) = (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
51	49, 50	breqtrrd 5098	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(𝐺 DProd 𝑆)))
52	27, 51	eqbrtrrd 5094	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆)))
53	14	sselda 3917	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ ℙ)
54	8	nn0zd 12353	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
55	54	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
56		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
57		ablgrp 19306	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
58	2	grpbn0 18523	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Grp → 𝐵 ≠ ∅)
59	13, 57, 58	3syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≠ ∅)
60		hashnncl 14009	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Fin → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
61	1, 60	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
62	59, 61	mpbird 256	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ)
63	62	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘𝐵) ∈ ℕ)
64	56, 63	pccld 16479	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
65	53, 64	syldan 590	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
66		pcdvdsb 16498	. . . . . . . . . . 11 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ ∧ (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
67	53, 55, 65, 66	syl3anc 1369	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
68	52, 67	mpbird 256	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
69	68	adantlr 711	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
70	26, 69	syldan 590	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
71		pceq0 16500	. . . . . . . . . 10 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘𝐵) ∈ ℕ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
72	56, 63, 71	syl2anc 583	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
73	72	biimpar 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) = 0)
74		eqid 2738	. . . . . . . . . . . . . . 15 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
75	74	subg0cl 18678	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ (𝐺 DProd 𝑆))
76		ne0i 4265	. . . . . . . . . . . . . 14 ⊢ ((0_g‘𝐺) ∈ (𝐺 DProd 𝑆) → (𝐺 DProd 𝑆) ≠ ∅)
77	17, 75, 76	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≠ ∅)
78		hashnncl 14009	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
79	6, 78	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
80	77, 79	mpbird 256	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
81	80	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
82	56, 81	pccld 16479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ∈ ℕ₀)
83	82	nn0ge0d 12226	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
84	83	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
85	73, 84	eqbrtrd 5092	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
86	70, 85	pm2.61dan 809	. . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
87	86	ralrimiva 3107	. . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
88	10	nn0zd 12353	. . . . . 6 ⊢ (𝜑 → (♯‘𝐵) ∈ ℤ)
89		pc2dvds 16508	. . . . . 6 ⊢ (((♯‘𝐵) ∈ ℤ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ) → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
90	88, 54, 89	syl2anc 583	. . . . 5 ⊢ (𝜑 → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
91	87, 90	mpbird 256	. . . 4 ⊢ (𝜑 → (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))
92		dvdseq 15951	. . . 4 ⊢ ((((♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀ ∧ (♯‘𝐵) ∈ ℕ₀) ∧ ((♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵) ∧ (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))) → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
93	8, 10, 19, 91, 92	syl22anc 835	. . 3 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
94		hashen 13989	. . . 4 ⊢ (((𝐺 DProd 𝑆) ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
95	6, 1, 94	syl2anc 583	. . 3 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
96	93, 95	mpbid 231	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≈ 𝐵)
97		fisseneq 8963	. 2 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵 ∧ (𝐺 DProd 𝑆) ≈ 𝐵) → (𝐺 DProd 𝑆) = 𝐵)
98	1, 4, 96, 97	syl3anc 1369	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = 𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∀wral 3063 {crab 3067 ⊆ wss 3883 ∅c0 4253 class class class wbr 5070 ↦ cmpt 5153 dom cdm 5580 ‘cfv 6418 (class class class)co 7255 ≈ cen 8688 Fincfn 8691 0cc0 10802 ≤ cle 10941 ℕcn 11903 ℕ₀cn0 12163 ℤcz 12249 ↑cexp 13710 ♯chash 13972 ∥ cdvds 15891 ℙcprime 16304 pCnt cpc 16465 Basecbs 16840 ↾_s cress 16867 0_gc0g 17067 Grpcgrp 18492 SubGrpcsubg 18664 odcod 19047 Abelcabl 19302 DProd cdprd 19511

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-disj 5036 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-oadd 8271 df-omul 8272 df-er 8456 df-ec 8458 df-qs 8462 df-map 8575 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-sup 9131 df-inf 9132 df-oi 9199 df-dju 9590 df-card 9628 df-acn 9631 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-xnn0 12236 df-z 12250 df-uz 12512 df-q 12618 df-rp 12660 df-fz 13169 df-fzo 13312 df-fl 13440 df-mod 13518 df-seq 13650 df-exp 13711 df-fac 13916 df-bc 13945 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 df-sum 15326 df-dvds 15892 df-gcd 16130 df-prm 16305 df-pc 16466 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-0g 17069 df-gsum 17070 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-mhm 18345 df-submnd 18346 df-grp 18495 df-minusg 18496 df-sbg 18497 df-mulg 18616 df-subg 18667 df-eqg 18669 df-ghm 18747 df-gim 18790 df-ga 18811 df-cntz 18838 df-oppg 18865 df-od 19051 df-lsm 19156 df-pj1 19157 df-cmn 19303 df-abl 19304 df-dprd 19513

This theorem is referenced by: ablfaclem2 19604

W3C validator