Theorem pgpfac1lem1 20051

Description: Lemma for pgpfac1 20057. (Contributed by Mario Carneiro, 27-Apr-2016.)

Hypotheses

Ref	Expression
pgpfac1.k	⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺))
pgpfac1.s	⊢ 𝑆 = (𝐾‘{𝐴})
pgpfac1.b	⊢ 𝐵 = (Base‘𝐺)
pgpfac1.o	⊢ 𝑂 = (od‘𝐺)
pgpfac1.e	⊢ 𝐸 = (gEx‘𝐺)
pgpfac1.z	⊢ 0 = (0g‘𝐺)
pgpfac1.l	⊢ ⊕ = (LSSum‘𝐺)
pgpfac1.p	⊢ (𝜑 → 𝑃 pGrp 𝐺)
pgpfac1.g	⊢ (𝜑 → 𝐺 ∈ Abel)
pgpfac1.n	⊢ (𝜑 → 𝐵 ∈ Fin)
pgpfac1.oe	⊢ (𝜑 → (𝑂‘𝐴) = 𝐸)
pgpfac1.u	⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
pgpfac1.au	⊢ (𝜑 → 𝐴 ∈ 𝑈)
pgpfac1.w	⊢ (𝜑 → 𝑊 ∈ (SubGrp‘𝐺))
pgpfac1.i	⊢ (𝜑 → (𝑆 ∩ 𝑊) = { 0 })
pgpfac1.ss	⊢ (𝜑 → (𝑆 ⊕ 𝑊) ⊆ 𝑈)
pgpfac1.2	⊢ (𝜑 → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))

Assertion

Ref	Expression
pgpfac1lem1	⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈)

Distinct variable groups:   𝑤,𝐴   𝑤, ⊕   𝑤,𝑃   𝑤,𝐺   𝑤,𝑈   𝑤,𝐶   𝑤,𝑆   𝑤,𝑊   𝜑,𝑤   𝑤,𝐾

Allowed substitution hints:   𝐵(𝑤)   𝐸(𝑤)   𝑂(𝑤)   0 (𝑤)

Proof of Theorem pgpfac1lem1

Step	Hyp	Ref	Expression
1		pgpfac1.ss	. . . 4 ⊢ (𝜑 → (𝑆 ⊕ 𝑊) ⊆ 𝑈)
2	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ 𝑈)
3		pgpfac1.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Abel)
4		ablgrp 19760	. . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
5		pgpfac1.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
6	5	subgacs 19136	. . . . . 6 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘𝐵))
7		acsmre 17618	. . . . . 6 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘𝐵) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
8	3, 4, 6, 7	4syl 19	. . . . 5 ⊢ (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
9	8	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
10		eldifi 4071	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → 𝐶 ∈ 𝑈)
11	10	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝑈)
12	11	snssd 4730	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝑈)
13		pgpfac1.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
14	13	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝑈 ∈ (SubGrp‘𝐺))
15		pgpfac1.k	. . . . 5 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺))
16	15	mrcsscl 17586	. . . 4 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ {𝐶} ⊆ 𝑈 ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ 𝑈)
17	9, 12, 14, 16	syl3anc 1374	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ 𝑈)
18		pgpfac1.s	. . . . . . 7 ⊢ 𝑆 = (𝐾‘{𝐴})
19	5	subgss 19103	. . . . . . . . . 10 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ 𝐵)
20	13, 19	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
21		pgpfac1.au	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
22	20, 21	sseldd 3922	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
23	15	mrcsncl 17578	. . . . . . . 8 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐴 ∈ 𝐵) → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
24	8, 22, 23	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
25	18, 24	eqeltrid 2840	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
26		pgpfac1.w	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ (SubGrp‘𝐺))
27		pgpfac1.l	. . . . . . 7 ⊢ ⊕ = (LSSum‘𝐺)
28	27	lsmsubg2 19834	. . . . . 6 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
29	3, 25, 26, 28	syl3anc 1374	. . . . 5 ⊢ (𝜑 → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
30	29	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
31	20	sselda 3921	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ 𝐵)
32	10, 31	sylan2 594	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝐵)
33	15	mrcsncl 17578	. . . . 5 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
34	9, 32, 33	syl2anc 585	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
35	27	lsmlub 19639	. . . 4 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
36	30, 34, 14, 35	syl3anc 1374	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
37	2, 17, 36	mpbi2and 713	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈)
38	27	lsmub1 19632	. . . . . 6 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
39	30, 34, 38	syl2anc 585	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
40	27	lsmub2 19633	. . . . . . 7 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
41	30, 34, 40	syl2anc 585	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
42	32	snssd 4730	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝐵)
43	9, 15, 42	mrcssidd 17591	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ (𝐾‘{𝐶}))
44		snssg 4727	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐵 → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
45	32, 44	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
46	43, 45	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ (𝐾‘{𝐶}))
47	41, 46	sseldd 3922	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
48		eldifn 4072	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
49	48	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
50	39, 47, 49	ssnelpssd 4055	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
51	27	lsmub1 19632	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
52	25, 26, 51	syl2anc 585	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
53	22	snssd 4730	. . . . . . . . . . 11 ⊢ (𝜑 → {𝐴} ⊆ 𝐵)
54	8, 15, 53	mrcssidd 17591	. . . . . . . . . 10 ⊢ (𝜑 → {𝐴} ⊆ (𝐾‘{𝐴}))
55	54, 18	sseqtrrdi 3963	. . . . . . . . 9 ⊢ (𝜑 → {𝐴} ⊆ 𝑆)
56		snssg 4727	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑈 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
57	21, 56	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
58	55, 57	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
59	52, 58	sseldd 3922	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝑆 ⊕ 𝑊))
60	59	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ (𝑆 ⊕ 𝑊))
61	39, 60	sseldd 3922	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
62		psseq1 4030	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝑤 ⊊ 𝑈 ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈))
63		eleq2 2825	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
64	62, 63	anbi12d 633	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
65		psseq2 4031	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
66	65	notbid 318	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
67	64, 66	imbi12d 344	. . . . . 6 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤) ↔ ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
68		pgpfac1.2	. . . . . . 7 ⊢ (𝜑 → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
69	68	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
70	3	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐺 ∈ Abel)
71	27	lsmsubg2 19834	. . . . . . 7 ⊢ ((𝐺 ∈ Abel ∧ (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
72	70, 30, 34, 71	syl3anc 1374	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
73	67, 69, 72	rspcdva 3565	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
74	61, 73	mpan2d 695	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
75	50, 74	mt2d 136	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈)
76		npss 4053	. . 3 ⊢ (¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
77	75, 76	sylib 218	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
78	37, 77	mpd 15	1 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3051   ∖ cdif 3886   ∩ cin 3888   ⊆ wss 3889   ⊊ wpss 3890  {csn 4567   class class class wbr 5085  ‘cfv 6498  (class class class)co 7367  Fincfn 8893  Basecbs 17179  0_gc0g 17402  Moorecmre 17544  mrClscmrc 17545  ACScacs 17547  Grpcgrp 18909  SubGrpcsubg 19096  odcod 19499  gExcgex 19500   pGrp cpgp 19501  LSSumclsm 19609  Abelcabl 19756

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-mre 17548  df-mrc 17549  df-acs 17551  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-submnd 18752  df-grp 18912  df-minusg 18913  df-subg 19099  df-cntz 19292  df-lsm 19611  df-cmn 19757  df-abl 19758

This theorem is referenced by:  pgpfac1lem2  20052  pgpfac1lem3  20054