Theorem pgpfac1lem1 20209

Description: Lemma for pgpfac1 20215. (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 486	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ 𝑈)
3		pgpfac1.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Abel)
4		ablgrp 19918	. . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp)
5		pgpfac1.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐺)
6	5	subgacs 19290	. . . . . 6 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘𝐵))
7		acsmre 17746	. . . . . 6 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘𝐵) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
8	3, 4, 6, 7	4syl 20	. . . . 5 ⊢ (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
9	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (SubGrp‘𝐺) ∈ (Moore‘𝐵))
10		eldifi 4081	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → 𝐶 ∈ 𝑈)
11	10	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝑈)
12	11	snssd 4750	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝑈)
13		pgpfac1.u	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺))
14	13	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝑈 ∈ (SubGrp‘𝐺))
15		pgpfac1.k	. . . . 5 ⊢ 𝐾 = (mrCls‘(SubGrp‘𝐺))
16	15	mrcsscl 17714	. . . 4 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ {𝐶} ⊆ 𝑈 ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ 𝑈)
17	9, 12, 14, 16	syl3anc 1398	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ 𝑈)
18		pgpfac1.s	. . . . . . 7 ⊢ 𝑆 = (𝐾‘{𝐴})
19	5	subgss 19256	. . . . . . . . . 10 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ 𝐵)
20	13, 19	syl 18	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
21		pgpfac1.au	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
22	20, 21	sseldd 3935	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
23	15	mrcsncl 17706	. . . . . . . 8 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐴 ∈ 𝐵) → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
24	8, 22, 23	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → (𝐾‘{𝐴}) ∈ (SubGrp‘𝐺))
25	18, 24	eqeltrid 2866	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺))
26		pgpfac1.w	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ (SubGrp‘𝐺))
27		pgpfac1.l	. . . . . . 7 ⊢ ⊕ = (LSSum‘𝐺)
28	27	lsmsubg2 19992	. . . . . 6 ⊢ ((𝐺 ∈ Abel ∧ 𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
29	3, 25, 26, 28	syl3anc 1398	. . . . 5 ⊢ (𝜑 → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
30	29	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺))
31	20	sselda 3934	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ 𝐵)
32	10, 31	sylan2 605	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ 𝐵)
33	15	mrcsncl 17706	. . . . 5 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
34	9, 32, 33	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺))
35	27	lsmlub 19797	. . . 4 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
36	30, 34, 14, 35	syl3anc 1398	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊆ 𝑈 ∧ (𝐾‘{𝐶}) ⊆ 𝑈) ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈))
37	2, 17, 36	mpbi2and 725	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈)
38	27	lsmub1 19790	. . . . . 6 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
39	30, 34, 38	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
40	27	lsmub2 19791	. . . . . . 7 ⊢ (((𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
41	30, 34, 40	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐾‘{𝐶}) ⊆ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
42	32	snssd 4750	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ 𝐵)
43	9, 15, 42	mrcssidd 17719	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → {𝐶} ⊆ (𝐾‘{𝐶}))
44		snssg 4747	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐵 → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
45	32, 44	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝐶 ∈ (𝐾‘{𝐶}) ↔ {𝐶} ⊆ (𝐾‘{𝐶})))
46	43, 45	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ (𝐾‘{𝐶}))
47	41, 46	sseldd 3935	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐶 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
48		eldifn 4082	. . . . . 6 ⊢ (𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊)) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
49	48	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ 𝐶 ∈ (𝑆 ⊕ 𝑊))
50	39, 47, 49	ssnelpssd 4067	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
51	27	lsmub1 19790	. . . . . . . . 9 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑊 ∈ (SubGrp‘𝐺)) → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
52	25, 26, 51	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (𝑆 ⊕ 𝑊))
53	22	snssd 4750	. . . . . . . . . . 11 ⊢ (𝜑 → {𝐴} ⊆ 𝐵)
54	8, 15, 53	mrcssidd 17719	. . . . . . . . . 10 ⊢ (𝜑 → {𝐴} ⊆ (𝐾‘{𝐴}))
55	54, 18	sseqtrrdi 3975	. . . . . . . . 9 ⊢ (𝜑 → {𝐴} ⊆ 𝑆)
56		snssg 4747	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑈 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
57	21, 56	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ 𝑆 ↔ {𝐴} ⊆ 𝑆))
58	55, 57	mpbird 260	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝑆)
59	52, 58	sseldd 3935	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝑆 ⊕ 𝑊))
60	59	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ (𝑆 ⊕ 𝑊))
61	39, 60	sseldd 3935	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))
62		psseq1 4041	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝑤 ⊊ 𝑈 ↔ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈))
63		eleq2 2851	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (𝐴 ∈ 𝑤 ↔ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
64	62, 63	anbi12d 644	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
65		psseq2 4042	. . . . . . . 8 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → ((𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
66	65	notbid 321	. . . . . . 7 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤 ↔ ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
67	64, 66	imbi12d 347	. . . . . 6 ⊢ (𝑤 = ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) → (((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤) ↔ ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})))))
68		pgpfac1.2	. . . . . . 7 ⊢ (𝜑 → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
69	68	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ∀𝑤 ∈ (SubGrp‘𝐺)((𝑤 ⊊ 𝑈 ∧ 𝐴 ∈ 𝑤) → ¬ (𝑆 ⊕ 𝑊) ⊊ 𝑤))
70	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → 𝐺 ∈ Abel)
71	27	lsmsubg2 19992	. . . . . . 7 ⊢ ((𝐺 ∈ Abel ∧ (𝑆 ⊕ 𝑊) ∈ (SubGrp‘𝐺) ∧ (𝐾‘{𝐶}) ∈ (SubGrp‘𝐺)) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
72	70, 30, 34, 71	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ∈ (SubGrp‘𝐺))
73	67, 69, 72	rspcdva 3580	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ∧ 𝐴 ∈ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))) → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
74	61, 73	mpan2d 707	. . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 → ¬ (𝑆 ⊕ 𝑊) ⊊ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶}))))
75	50, 74	mt2d 137	. . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈)
76		npss 4065	. . 3 ⊢ (¬ ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊊ 𝑈 ↔ (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
77	75, 76	sylib 221	. 2 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → (((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) ⊆ 𝑈 → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈))
78	37, 77	mpd 16	1 ⊢ ((𝜑 ∧ 𝐶 ∈ (𝑈 ∖ (𝑆 ⊕ 𝑊))) → ((𝑆 ⊕ 𝑊) ⊕ (𝐾‘{𝐶})) = 𝑈)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078   ∖ cdif 3899   ∩ cin 3901   ⊆ wss 3902   ⊊ wpss 3903  {csn 4587   class class class wbr 5107  ‘cfv 6537  (class class class)co 7417  Fincfn 8956  Basecbs 17307  0_gc0g 17530  Moorecmre 17672  mrClscmrc 17673  ACScacs 17675  Grpcgrp 19063  SubGrpcsubg 19249  odcod 19657  gExcgex 19658   pGrp cpgp 19659  LSSumclsm 19767  Abelcabl 19914

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-nn 12262  df-2 12331  df-sets 17262  df-slot 17280  df-ndx 17292  df-base 17308  df-ress 17329  df-plusg 17361  df-0g 17532  df-mre 17676  df-mrc 17677  df-acs 17679  df-mgm 18736  df-sgrp 18827  df-mnd 18843  df-submnd 18898  df-grp 19066  df-minusg 19067  df-subg 19252  df-cntz 19450  df-lsm 19769  df-cmn 19915  df-abl 19916

This theorem is used by:  pgpfac1lem2  20210  pgpfac1lem3  20212