Theorem pgpfac 20147

Description: Full factorization of a finite abelian p-group, by iterating pgpfac1 20143. There is a direct product decomposition of any abelian group of prime-power order into cyclic subgroups. (Contributed by Mario Carneiro, 27-Apr-2016.) (Revised by Mario Carneiro, 3-May-2016.)

Hypotheses

Ref	Expression
pgpfac.b	⊢ 𝐵 = (Base‘𝐺)
pgpfac.c	⊢ 𝐶 = {𝑟 ∈ (SubGrp‘𝐺) ∣ (𝐺 ↾s 𝑟) ∈ (CycGrp ∩ ran pGrp )}
pgpfac.g	⊢ (𝜑 → 𝐺 ∈ Abel)
pgpfac.p	⊢ (𝜑 → 𝑃 pGrp 𝐺)
pgpfac.f	⊢ (𝜑 → 𝐵 ∈ Fin)

Assertion

Ref	Expression
pgpfac	⊢ (𝜑 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵))

Distinct variable groups:   𝐶,𝑠   𝑠,𝑟,𝐺   𝐵,𝑠

Allowed substitution hints:   𝜑(𝑠,𝑟)   𝐵(𝑟)   𝐶(𝑟)   𝑃(𝑠,𝑟)

Proof of Theorem pgpfac

Dummy variables 𝑡 𝑢 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pgpfac.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ Abel)
2		ablgrp 19846	. . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
3		pgpfac.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
4	3	subgid 19185	. . 3 ⊢ (𝐺 ∈ Grp → 𝐵 ∈ (SubGrp‘𝐺))
5	1, 2, 4	3syl 19	. 2 ⊢ (𝜑 → 𝐵 ∈ (SubGrp‘𝐺))
6		pgpfac.f	. . 3 ⊢ (𝜑 → 𝐵 ∈ Fin)
7		eleq1 2853	. . . . . 6 ⊢ (𝑡 = 𝑢 → (𝑡 ∈ (SubGrp‘𝐺) ↔ 𝑢 ∈ (SubGrp‘𝐺)))
8		eqeq2 2777	. . . . . . . 8 ⊢ (𝑡 = 𝑢 → ((𝐺 DProd 𝑠) = 𝑡 ↔ (𝐺 DProd 𝑠) = 𝑢))
9	8	anbi2d 641	. . . . . . 7 ⊢ (𝑡 = 𝑢 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))
10	9	rexbidv 3189	. . . . . 6 ⊢ (𝑡 = 𝑢 → (∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))
11	7, 10	imbi12d 347	. . . . 5 ⊢ (𝑡 = 𝑢 → ((𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ↔ (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢))))
12	11	imbi2d 343	. . . 4 ⊢ (𝑡 = 𝑢 → ((𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) ↔ (𝜑 → (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))))
13		eleq1 2853	. . . . . 6 ⊢ (𝑡 = 𝐵 → (𝑡 ∈ (SubGrp‘𝐺) ↔ 𝐵 ∈ (SubGrp‘𝐺)))
14		eqeq2 2777	. . . . . . . 8 ⊢ (𝑡 = 𝐵 → ((𝐺 DProd 𝑠) = 𝑡 ↔ (𝐺 DProd 𝑠) = 𝐵))
15	14	anbi2d 641	. . . . . . 7 ⊢ (𝑡 = 𝐵 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵)))
16	15	rexbidv 3189	. . . . . 6 ⊢ (𝑡 = 𝐵 → (∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵)))
17	13, 16	imbi12d 347	. . . . 5 ⊢ (𝑡 = 𝐵 → ((𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ↔ (𝐵 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵))))
18	17	imbi2d 343	. . . 4 ⊢ (𝑡 = 𝐵 → ((𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) ↔ (𝜑 → (𝐵 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵)))))
19		bi2.04 391	. . . . . . . . 9 ⊢ ((𝑡 ⊊ 𝑢 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) ↔ (𝑡 ∈ (SubGrp‘𝐺) → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))))
20	19	imbi2i 339	. . . . . . . 8 ⊢ ((𝜑 → (𝑡 ⊊ 𝑢 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
21		bi2.04 391	. . . . . . . 8 ⊢ ((𝑡 ⊊ 𝑢 → (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ (𝜑 → (𝑡 ⊊ 𝑢 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
22		bi2.04 391	. . . . . . . 8 ⊢ ((𝑡 ∈ (SubGrp‘𝐺) → (𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
23	20, 21, 22	3bitr4i 306	. . . . . . 7 ⊢ ((𝑡 ⊊ 𝑢 → (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ (𝑡 ∈ (SubGrp‘𝐺) → (𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
24	23	albii 1842	. . . . . 6 ⊢ (∀𝑡(𝑡 ⊊ 𝑢 → (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ ∀𝑡(𝑡 ∈ (SubGrp‘𝐺) → (𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
25		df-ral 3080	. . . . . 6 ⊢ (∀𝑡 ∈ (SubGrp‘𝐺)(𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) ↔ ∀𝑡(𝑡 ∈ (SubGrp‘𝐺) → (𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))))
26		r19.21v 3190	. . . . . 6 ⊢ (∀𝑡 ∈ (SubGrp‘𝐺)(𝜑 → (𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) ↔ (𝜑 → ∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))))
27	24, 25, 26	3bitr2i 302	. . . . 5 ⊢ (∀𝑡(𝑡 ⊊ 𝑢 → (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) ↔ (𝜑 → ∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))))
28		pgpfac.c	. . . . . . . . 9 ⊢ 𝐶 = {𝑟 ∈ (SubGrp‘𝐺) ∣ (𝐺 ↾s 𝑟) ∈ (CycGrp ∩ ran pGrp )}
29	1	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → 𝐺 ∈ Abel)
30		pgpfac.p	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 pGrp 𝐺)
31	30	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → 𝑃 pGrp 𝐺)
32	6	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → 𝐵 ∈ Fin)
33		simprr 784	. . . . . . . . 9 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → 𝑢 ∈ (SubGrp‘𝐺))
34		simprl 782	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → ∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))
35		psseq1 4046	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑥 → (𝑡 ⊊ 𝑢 ↔ 𝑥 ⊊ 𝑢))
36		eqeq2 2777	. . . . . . . . . . . . . 14 ⊢ (𝑡 = 𝑥 → ((𝐺 DProd 𝑠) = 𝑡 ↔ (𝐺 DProd 𝑠) = 𝑥))
37	36	anbi2d 641	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑥 → ((𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ (𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑥)))
38	37	rexbidv 3189	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑥 → (∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡) ↔ ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑥)))
39	35, 38	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑥 → ((𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ↔ (𝑥 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑥))))
40	39	cbvralvw 3243	. . . . . . . . . 10 ⊢ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ↔ ∀𝑥 ∈ (SubGrp‘𝐺)(𝑥 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑥)))
41	34, 40	sylib 221	. . . . . . . . 9 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → ∀𝑥 ∈ (SubGrp‘𝐺)(𝑥 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑥)))
42	3, 28, 29, 31, 32, 33, 41	pgpfaclem3 20146	. . . . . . . 8 ⊢ ((𝜑 ∧ (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) ∧ 𝑢 ∈ (SubGrp‘𝐺))) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢))
43	42	exp32 425	. . . . . . 7 ⊢ (𝜑 → (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) → (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢))))
44	43	a1i 11	. . . . . 6 ⊢ (𝑢 ∈ Fin → (𝜑 → (∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)) → (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))))
45	44	a2d 30	. . . . 5 ⊢ (𝑢 ∈ Fin → ((𝜑 → ∀𝑡 ∈ (SubGrp‘𝐺)(𝑡 ⊊ 𝑢 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡))) → (𝜑 → (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))))
46	27, 45	biimtrid 245	. . . 4 ⊢ (𝑢 ∈ Fin → (∀𝑡(𝑡 ⊊ 𝑢 → (𝜑 → (𝑡 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑡)))) → (𝜑 → (𝑢 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝑢)))))
47	12, 18, 46	findcard3 9231	. . 3 ⊢ (𝐵 ∈ Fin → (𝜑 → (𝐵 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵))))
48	6, 47	mpcom 39	. 2 ⊢ (𝜑 → (𝐵 ∈ (SubGrp‘𝐺) → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵)))
49	5, 48	mpd 16	1 ⊢ (𝜑 → ∃𝑠 ∈ Word 𝐶(𝐺dom DProd 𝑠 ∧ (𝐺 DProd 𝑠) = 𝐵))

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1561   = wceq 1563   ∈ wcel 2145  ∀wral 3079  ∃wrex 3089  {crab 3417   ∩ cin 3906   ⊊ wpss 3908   class class class wbr 5105  dom cdm 5652  ran crn 5653  ‘cfv 6525  (class class class)co 7400  Fincfn 8931  Word cword 14540  Basecbs 17259   ↾_s cress 17280  Grpcgrp 18990  SubGrpcsubg 19177   pGrp cpgp 19587  Abelcabl 19842  CycGrpccyg 19938   DProd cdprd 20056

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-inf2 9598  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165  ax-pre-sup 11166

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-iin 4955  df-disj 5073  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-se 5606  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-isom 6534  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-of 7664  df-rpss 7710  df-om 7851  df-1st 7974  df-2nd 7975  df-supp 8145  df-tpos 8210  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-2o 8442  df-oadd 8445  df-omul 8446  df-er 8682  df-ec 8684  df-qs 8688  df-map 8814  df-ixp 8884  df-en 8932  df-dom 8933  df-sdom 8934  df-fin 8935  df-fsupp 9310  df-sup 9390  df-inf 9391  df-oi 9460  df-dju 9875  df-card 9913  df-acn 9916  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-div 11860  df-nn 12225  df-2 12294  df-3 12295  df-n0 12496  df-xnn0 12569  df-z 12583  df-uz 12854  df-q 12964  df-rp 13008  df-fz 13527  df-fzo 13674  df-fl 13816  df-mod 13894  df-seq 14029  df-exp 14089  df-fac 14301  df-bc 14330  df-hash 14358  df-word 14541  df-concat 14598  df-s1 14624  df-cj 15140  df-re 15141  df-im 15142  df-sqrt 15276  df-abs 15277  df-clim 15529  df-sum 15728  df-dvds 16301  df-gcd 16543  df-prm 16720  df-pc 16887  df-sets 17214  df-slot 17232  df-ndx 17244  df-base 17260  df-ress 17281  df-plusg 17313  df-0g 17484  df-gsum 17485  df-mre 17628  df-mrc 17629  df-acs 17631  df-mgm 18688  df-sgrp 18767  df-mnd 18783  df-mhm 18831  df-submnd 18832  df-grp 18993  df-minusg 18994  df-sbg 18995  df-mulg 19125  df-subg 19180  df-eqg 19182  df-ghm 19275  df-gim 19320  df-ga 19351  df-cntz 19378  df-oppg 19407  df-od 19589  df-gex 19590  df-pgp 19591  df-lsm 19697  df-pj1 19698  df-cmn 19843  df-abl 19844  df-cyg 19939  df-dprd 20058

This theorem is referenced by:  ablfaclem3  20150