Theorem pgpfac1lem1 20109

Description: Lemma for pgpfac1 20115. (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 19818	. . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
5		pgpfac1.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
6	5	subgacs 19192	. . . . . 6 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘𝐵))
7		acsmre 17697	. . . . . 6 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘𝐵) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
8	3, 4, 6, 7	4syl 19	. . . . 5 ⊢ (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
9	8	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
10		eldifi 4141	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → 𝐶 ∈ 𝑈)
11	10	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝑈)
12	11	snssd 4814	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝑈)
13		pgpfac1.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
14	13	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝑈 ∈ (SubGrp‘𝐺))
15		pgpfac1.k	. . . . 5 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺))
16	15	mrcsscl 17665	. . . 4 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ {𝐶} ⊆ 𝑈 ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ 𝑈)
17	9, 12, 14, 16	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ 𝑈)
18		pgpfac1.s	. . . . . . 7 ⊢ 𝑆 = (𝐾‘{𝐴})
19	5	subgss 19158	. . . . . . . . . 10 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ 𝐵)
20	13, 19	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
21		pgpfac1.au	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
22	20, 21	sseldd 3996	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
23	15	mrcsncl 17657	. . . . . . . 8 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐴 ∈ 𝐵) → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
24	8, 22, 23	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
25	18, 24	eqeltrid 2843	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
26		pgpfac1.w	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ (SubGrp‘𝐺))
27		pgpfac1.l	. . . . . . 7 ⊢ ⊕ = (LSSum‘𝐺)
28	27	lsmsubg2 19892	. . . . . 6 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
29	3, 25, 26, 28	syl3anc 1370	. . . . 5 ⊢ (𝜑 → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
30	29	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
31	20	sselda 3995	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ 𝐵)
32	10, 31	sylan2 593	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝐵)
33	15	mrcsncl 17657	. . . . 5 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
34	9, 32, 33	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
35	27	lsmlub 19697	. . . 4 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
36	30, 34, 14, 35	syl3anc 1370	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
37	2, 17, 36	mpbi2and 712	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈)
38	27	lsmub1 19690	. . . . . 6 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
39	30, 34, 38	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
40	27	lsmub2 19691	. . . . . . 7 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
41	30, 34, 40	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
42	32	snssd 4814	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝐵)
43	9, 15, 42	mrcssidd 17670	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ (𝐾‘{𝐶}))
44		snssg 4788	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐵 → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
45	32, 44	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
46	43, 45	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ (𝐾‘{𝐶}))
47	41, 46	sseldd 3996	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
48		eldifn 4142	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
49	48	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
50	39, 47, 49	ssnelpssd 4125	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
51	27	lsmub1 19690	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
52	25, 26, 51	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
53	22	snssd 4814	. . . . . . . . . . 11 ⊢ (𝜑 → {𝐴} ⊆ 𝐵)
54	8, 15, 53	mrcssidd 17670	. . . . . . . . . 10 ⊢ (𝜑 → {𝐴} ⊆ (𝐾‘{𝐴}))
55	54, 18	sseqtrrdi 4047	. . . . . . . . 9 ⊢ (𝜑 → {𝐴} ⊆ 𝑆)
56		snssg 4788	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑈 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
57	21, 56	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
58	55, 57	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
59	52, 58	sseldd 3996	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝑆 ⊕ 𝑊))
60	59	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ (𝑆 ⊕ 𝑊))
61	39, 60	sseldd 3996	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
62		psseq1 4100	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝑤 ⊊ 𝑈 ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈))
63		eleq2 2828	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
64	62, 63	anbi12d 632	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
65		psseq2 4101	. . . . . . . 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 19892	. . . . . . 7 ⊢ ((𝐺 ∈ Abel ∧ (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
72	70, 30, 34, 71	syl3anc 1370	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
73	67, 69, 72	rspcdva 3623	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
74	61, 73	mpan2d 694	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
75	50, 74	mt2d 136	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈)
76		npss 4123	. . 3 ⊢ (¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
77	75, 76	sylib 218	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
78	37, 77	mpd 15	1 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059   ∖ cdif 3960   ∩ cin 3962   ⊆ wss 3963   ⊊ wpss 3964  {csn 4631   class class class wbr 5148  ‘cfv 6563  (class class class)co 7431  Fincfn 8984  Basecbs 17245  0_gc0g 17486  Moorecmre 17627  mrClscmrc 17628  ACScacs 17630  Grpcgrp 18964  SubGrpcsubg 19151  odcod 19557  gExcgex 19558   pGrp cpgp 19559  LSSumclsm 19667  Abelcabl 19814

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-iin 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-2o 8506  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-sets 17198  df-slot 17216  df-ndx 17228  df-base 17246  df-ress 17275  df-plusg 17311  df-0g 17488  df-mre 17631  df-mrc 17632  df-acs 17634  df-mgm 18666  df-sgrp 18745  df-mnd 18761  df-submnd 18810  df-grp 18967  df-minusg 18968  df-subg 19154  df-cntz 19348  df-lsm 19669  df-cmn 19815  df-abl 19816

This theorem is referenced by:  pgpfac1lem2  20110  pgpfac1lem3  20112