Theorem pgpfac1lem1 20049

Description: Lemma for pgpfac1 20055. (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 481	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ 𝑈)
3		pgpfac1.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Abel)
4		ablgrp 19758	. . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
5		pgpfac1.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
6	5	subgacs 19134	. . . . . 6 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘𝐵))
7		acsmre 17616	. . . . . 6 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘𝐵) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
8	3, 4, 6, 7	4syl 19	. . . . 5 ⊢ (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
9	8	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
10		eldifi 4068	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → 𝐶 ∈ 𝑈)
11	10	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝑈)
12	11	snssd 4725	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝑈)
13		pgpfac1.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
14	13	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝑈 ∈ (SubGrp‘𝐺))
15		pgpfac1.k	. . . . 5 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺))
16	15	mrcsscl 17584	. . . 4 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ {𝐶} ⊆ 𝑈 ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ 𝑈)
17	9, 12, 14, 16	syl3anc 1379	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ 𝑈)
18		pgpfac1.s	. . . . . . 7 ⊢ 𝑆 = (𝐾‘{𝐴})
19	5	subgss 19101	. . . . . . . . . 10 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ 𝐵)
20	13, 19	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
21		pgpfac1.au	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
22	20, 21	sseldd 3923	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
23	15	mrcsncl 17576	. . . . . . . 8 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐴 ∈ 𝐵) → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
24	8, 22, 23	syl2anc 590	. . . . . . 7 ⊢ (𝜑 → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
25	18, 24	eqeltrid 2844	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
26		pgpfac1.w	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ (SubGrp‘𝐺))
27		pgpfac1.l	. . . . . . 7 ⊢ ⊕ = (LSSum‘𝐺)
28	27	lsmsubg2 19832	. . . . . 6 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
29	3, 25, 26, 28	syl3anc 1379	. . . . 5 ⊢ (𝜑 → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
30	29	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
31	20	sselda 3922	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ 𝐵)
32	10, 31	sylan2 599	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝐵)
33	15	mrcsncl 17576	. . . . 5 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
34	9, 32, 33	syl2anc 590	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
35	27	lsmlub 19637	. . . 4 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
36	30, 34, 14, 35	syl3anc 1379	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
37	2, 17, 36	mpbi2and 718	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈)
38	27	lsmub1 19630	. . . . . 6 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
39	30, 34, 38	syl2anc 590	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
40	27	lsmub2 19631	. . . . . . 7 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
41	30, 34, 40	syl2anc 590	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
42	32	snssd 4725	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝐵)
43	9, 15, 42	mrcssidd 17589	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ (𝐾‘{𝐶}))
44		snssg 4722	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐵 → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
45	32, 44	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
46	43, 45	mpbird 258	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ (𝐾‘{𝐶}))
47	41, 46	sseldd 3923	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
48		eldifn 4069	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
49	48	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
50	39, 47, 49	ssnelpssd 4053	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
51	27	lsmub1 19630	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
52	25, 26, 51	syl2anc 590	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
53	22	snssd 4725	. . . . . . . . . . 11 ⊢ (𝜑 → {𝐴} ⊆ 𝐵)
54	8, 15, 53	mrcssidd 17589	. . . . . . . . . 10 ⊢ (𝜑 → {𝐴} ⊆ (𝐾‘{𝐴}))
55	54, 18	sseqtrrdi 3963	. . . . . . . . 9 ⊢ (𝜑 → {𝐴} ⊆ 𝑆)
56		snssg 4722	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑈 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
57	21, 56	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
58	55, 57	mpbird 258	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
59	52, 58	sseldd 3923	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝑆 ⊕ 𝑊))
60	59	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ (𝑆 ⊕ 𝑊))
61	39, 60	sseldd 3923	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
62		psseq1 4028	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝑤 ⊊ 𝑈 ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈))
63		eleq2 2829	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
64	62, 63	anbi12d 638	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
65		psseq2 4029	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
66	65	notbid 319	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
67	64, 66	imbi12d 345	. . . . . 6 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤) ↔ ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
68		pgpfac1.2	. . . . . . 7 ⊢ (𝜑 → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
69	68	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
70	3	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐺 ∈ Abel)
71	27	lsmsubg2 19832	. . . . . . 7 ⊢ ((𝐺 ∈ Abel ∧ (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
72	70, 30, 34, 71	syl3anc 1379	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
73	67, 69, 72	rspcdva 3568	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
74	61, 73	mpan2d 700	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
75	50, 74	mt2d 136	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈)
76		npss 4051	. . 3 ⊢ (¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
77	75, 76	sylib 219	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
78	37, 77	mpd 15	1 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∀wral 3054   ∖ cdif 3887   ∩ cin 3889   ⊆ wss 3890   ⊊ wpss 3891  {csn 4562   class class class wbr 5079  ‘cfv 6492  (class class class)co 7363  Fincfn 8890  Basecbs 17177  0_gc0g 17400  Moorecmre 17542  mrClscmrc 17543  ACScacs 17545  Grpcgrp 18907  SubGrpcsubg 19094  odcod 19497  gExcgex 19498   pGrp cpgp 19499  LSSumclsm 19607  Abelcabl 19754

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-iin 4931  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-1o 8402  df-2o 8403  df-er 8640  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-nn 12173  df-2 12242  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17178  df-ress 17199  df-plusg 17231  df-0g 17402  df-mre 17546  df-mrc 17547  df-acs 17549  df-mgm 18606  df-sgrp 18685  df-mnd 18701  df-submnd 18750  df-grp 18910  df-minusg 18911  df-subg 19097  df-cntz 19290  df-lsm 19609  df-cmn 19755  df-abl 19756

This theorem is referenced by:  pgpfac1lem2  20050  pgpfac1lem3  20052