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 19941

Description: The factors of ablfac1b 19940 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 19886	. . 3 ⊢ (𝐺 DProd 𝑆) ⊆ 𝐵
4	3	a1i 11	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ⊆ 𝐵)
5		ssfi 9173	. . . . . 6 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵) → (𝐺 DProd 𝑆) ∈ Fin)
6	1, 3, 5	sylancl 587	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ Fin)
7		hashcl 14316	. . . . 5 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
8	6, 7	syl 17	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀)
9		hashcl 14316	. . . . 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 19940	. . . . . 6 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
16		dprdsubg 19894	. . . . . 6 ⊢ (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
17	15, 16	syl 17	. . . . 5 ⊢ (𝜑 → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
18	2	lagsubg 19072	. . . . 5 ⊢ (((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) ∧ 𝐵 ∈ Fin) → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
19	17, 1, 18	syl2anc 585	. . . 4 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵))
20		breq1 5152	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑞 → (𝑤 ∥ (♯‘𝐵) ↔ 𝑞 ∥ (♯‘𝐵)))
21		ablfac1c.d	. . . . . . . . . . 11 ⊢ 𝐷 = {𝑤 ∈ ℙ ∣ 𝑤 ∥ (♯‘𝐵)}
22	20, 21	elrab2 3687	. . . . . . . . . 10 ⊢ (𝑞 ∈ 𝐷 ↔ (𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)))
23		ablfac1.2	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
24	23	sseld 3982	. . . . . . . . . 10 ⊢ (𝜑 → (𝑞 ∈ 𝐷 → 𝑞 ∈ 𝐴))
25	22, 24	biimtrrid 242	. . . . . . . . 9 ⊢ (𝜑 → ((𝑞 ∈ ℙ ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴))
26	25	impl 457	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → 𝑞 ∈ 𝐴)
27	2, 11, 12, 13, 1, 14	ablfac1a 19939	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) = (𝑞↑(𝑞 pCnt (♯‘𝐵))))
28	2	fvexi 6906	. . . . . . . . . . . . . . . . . . 19 ⊢ 𝐵 ∈ V
29	28	rabex 5333	. . . . . . . . . . . . . . . . . 18 ⊢ {𝑥 ∈ 𝐵 ∣ (𝑂‘𝑥) ∥ (𝑝↑(𝑝 pCnt (♯‘𝐵)))} ∈ V
30	29, 12	dmmpti 6695	. . . . . . . . . . . . . . . . 17 ⊢ dom 𝑆 = 𝐴
31	30	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → dom 𝑆 = 𝐴)
32	15, 31	dprdf2 19877	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑆:𝐴⟶(SubGrp‘𝐺))
33	32	ffvelcdmda 7087	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘𝐺))
34	15	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝐺dom DProd 𝑆)
35	30	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → dom 𝑆 = 𝐴)
36		simpr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ 𝐴)
37	34, 35, 36	dprdub 19895	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))
38	17	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺))
39		eqid 2733	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ↾_s (𝐺 DProd 𝑆)) = (𝐺 ↾_s (𝐺 DProd 𝑆))
40	39	subsubg 19029	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
41	38, 40	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ↔ ((𝑆‘𝑞) ∈ (SubGrp‘𝐺) ∧ (𝑆‘𝑞) ⊆ (𝐺 DProd 𝑆))))
42	33, 37, 41	mpbir2and 712	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
43	39	subgbas 19010	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
44	38, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))))
45	6	adantr 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝐺 DProd 𝑆) ∈ Fin)
46	44, 45	eqeltrrd 2835	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin)
47		eqid 2733	. . . . . . . . . . . . . 14 ⊢ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) = (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))
48	47	lagsubg 19072	. . . . . . . . . . . . 13 ⊢ (((𝑆‘𝑞) ∈ (SubGrp‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∧ (Base‘(𝐺 ↾_s (𝐺 DProd 𝑆))) ∈ Fin) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
49	42, 46, 48	syl2anc 585	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
50	44	fveq2d 6896	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) = (♯‘(Base‘(𝐺 ↾_s (𝐺 DProd 𝑆)))))
51	49, 50	breqtrrd 5177	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝑆‘𝑞)) ∥ (♯‘(𝐺 DProd 𝑆)))
52	27, 51	eqbrtrrd 5173	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆)))
53	14	sselda 3983	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ ℙ)
54	8	nn0zd 12584	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
55	54	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (♯‘(𝐺 DProd 𝑆)) ∈ ℤ)
56		simpr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 𝑞 ∈ ℙ)
57		ablgrp 19653	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
58	2	grpbn0 18851	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Grp → 𝐵 ≠ ∅)
59	13, 57, 58	3syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≠ ∅)
60		hashnncl 14326	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ Fin → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
61	1, 60	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((♯‘𝐵) ∈ ℕ ↔ 𝐵 ≠ ∅))
62	59, 61	mpbird 257	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ)
63	62	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘𝐵) ∈ ℕ)
64	56, 63	pccld 16783	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
65	53, 64	syldan 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀)
66		pcdvdsb 16802	. . . . . . . . . . 11 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ ∧ (𝑞 pCnt (♯‘𝐵)) ∈ ℕ₀) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
67	53, 55, 65, 66	syl3anc 1372	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → ((𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ↔ (𝑞↑(𝑞 pCnt (♯‘𝐵))) ∥ (♯‘(𝐺 DProd 𝑆))))
68	52, 67	mpbird 257	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
69	68	adantlr 714	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∈ 𝐴) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
70	26, 69	syldan 592	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
71		pceq0 16804	. . . . . . . . . 10 ⊢ ((𝑞 ∈ ℙ ∧ (♯‘𝐵) ∈ ℕ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
72	56, 63, 71	syl2anc 585	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → ((𝑞 pCnt (♯‘𝐵)) = 0 ↔ ¬ 𝑞 ∥ (♯‘𝐵)))
73	72	biimpar 479	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) = 0)
74		eqid 2733	. . . . . . . . . . . . . . 15 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
75	74	subg0cl 19014	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ (𝐺 DProd 𝑆))
76		ne0i 4335	. . . . . . . . . . . . . 14 ⊢ ((0_g‘𝐺) ∈ (𝐺 DProd 𝑆) → (𝐺 DProd 𝑆) ≠ ∅)
77	17, 75, 76	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≠ ∅)
78		hashnncl 14326	. . . . . . . . . . . . . 14 ⊢ ((𝐺 DProd 𝑆) ∈ Fin → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
79	6, 78	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) ∈ ℕ ↔ (𝐺 DProd 𝑆) ≠ ∅))
80	77, 79	mpbird 257	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
81	80	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (♯‘(𝐺 DProd 𝑆)) ∈ ℕ)
82	56, 81	pccld 16783	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))) ∈ ℕ₀)
83	82	nn0ge0d 12535	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
84	83	adantr 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → 0 ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
85	73, 84	eqbrtrd 5171	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑞 ∈ ℙ) ∧ ¬ 𝑞 ∥ (♯‘𝐵)) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
86	70, 85	pm2.61dan 812	. . . . . 6 ⊢ ((𝜑 ∧ 𝑞 ∈ ℙ) → (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
87	86	ralrimiva 3147	. . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆))))
88	10	nn0zd 12584	. . . . . 6 ⊢ (𝜑 → (♯‘𝐵) ∈ ℤ)
89		pc2dvds 16812	. . . . . 6 ⊢ (((♯‘𝐵) ∈ ℤ ∧ (♯‘(𝐺 DProd 𝑆)) ∈ ℤ) → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
90	88, 54, 89	syl2anc 585	. . . . 5 ⊢ (𝜑 → ((♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)) ↔ ∀𝑞 ∈ ℙ (𝑞 pCnt (♯‘𝐵)) ≤ (𝑞 pCnt (♯‘(𝐺 DProd 𝑆)))))
91	87, 90	mpbird 257	. . . 4 ⊢ (𝜑 → (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))
92		dvdseq 16257	. . . 4 ⊢ ((((♯‘(𝐺 DProd 𝑆)) ∈ ℕ₀ ∧ (♯‘𝐵) ∈ ℕ₀) ∧ ((♯‘(𝐺 DProd 𝑆)) ∥ (♯‘𝐵) ∧ (♯‘𝐵) ∥ (♯‘(𝐺 DProd 𝑆)))) → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
93	8, 10, 19, 91, 92	syl22anc 838	. . 3 ⊢ (𝜑 → (♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵))
94		hashen 14307	. . . 4 ⊢ (((𝐺 DProd 𝑆) ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
95	6, 1, 94	syl2anc 585	. . 3 ⊢ (𝜑 → ((♯‘(𝐺 DProd 𝑆)) = (♯‘𝐵) ↔ (𝐺 DProd 𝑆) ≈ 𝐵))
96	93, 95	mpbid 231	. 2 ⊢ (𝜑 → (𝐺 DProd 𝑆) ≈ 𝐵)
97		fisseneq 9257	. 2 ⊢ ((𝐵 ∈ Fin ∧ (𝐺 DProd 𝑆) ⊆ 𝐵 ∧ (𝐺 DProd 𝑆) ≈ 𝐵) → (𝐺 DProd 𝑆) = 𝐵)
98	1, 4, 96, 97	syl3anc 1372	1 ⊢ (𝜑 → (𝐺 DProd 𝑆) = 𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 {crab 3433 ⊆ wss 3949 ∅c0 4323 class class class wbr 5149 ↦ cmpt 5232 dom cdm 5677 ‘cfv 6544 (class class class)co 7409 ≈ cen 8936 Fincfn 8939 0cc0 11110 ≤ cle 11249 ℕcn 12212 ℕ₀cn0 12472 ℤcz 12558 ↑cexp 14027 ♯chash 14290 ∥ cdvds 16197 ℙcprime 16608 pCnt cpc 16769 Basecbs 17144 ↾_s cress 17173 0_gc0g 17385 Grpcgrp 18819 SubGrpcsubg 19000 odcod 19392 Abelcabl 19649 DProd cdprd 19863

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 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-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-disj 5115 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-se 5633 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-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-om 7856 df-1st 7975 df-2nd 7976 df-supp 8147 df-tpos 8211 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-oadd 8470 df-omul 8471 df-er 8703 df-ec 8705 df-qs 8709 df-map 8822 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9362 df-sup 9437 df-inf 9438 df-oi 9505 df-dju 9896 df-card 9934 df-acn 9937 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-xnn0 12545 df-z 12559 df-uz 12823 df-q 12933 df-rp 12975 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-fac 14234 df-bc 14263 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-sum 15633 df-dvds 16198 df-gcd 16436 df-prm 16609 df-pc 16770 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-0g 17387 df-gsum 17388 df-mre 17530 df-mrc 17531 df-acs 17533 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-mhm 18671 df-submnd 18672 df-grp 18822 df-minusg 18823 df-sbg 18824 df-mulg 18951 df-subg 19003 df-eqg 19005 df-ghm 19090 df-gim 19133 df-ga 19154 df-cntz 19181 df-oppg 19210 df-od 19396 df-lsm 19504 df-pj1 19505 df-cmn 19650 df-abl 19651 df-dprd 19865

This theorem is referenced by: ablfaclem2 19956

W3C validator