Theorem sylow1lem3 19714

Description: Lemma for sylow1 19717. One of the orbits of the group action has p-adic valuation less than the prime count of the set 𝑆. (Contributed by Mario Carneiro, 15-Jan-2015.)

Hypotheses

Ref	Expression
sylow1.x	⊢ 𝑋 = (Base‘𝐺)
sylow1.g	⊢ (𝜑 → 𝐺 ∈ Grp)
sylow1.f	⊢ (𝜑 → 𝑋 ∈ Fin)
sylow1.p	⊢ (𝜑 → 𝑃 ∈ ℙ)
sylow1.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)
sylow1.d	⊢ (𝜑 → (𝑃↑𝑁) ∥ (♯‘𝑋))
sylow1lem.a	⊢ + = (+g‘𝐺)
sylow1lem.s	⊢ 𝑆 = {𝑠 ∈ 𝒫 𝑋 ∣ (♯‘𝑠) = (𝑃↑𝑁)}
sylow1lem.m	⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑆 ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
sylow1lem3.1	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑆 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}

Assertion

Ref	Expression
sylow1lem3	⊢ (𝜑 → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))

Distinct variable groups:   𝑔,𝑠,𝑥,𝑦,𝑧,𝑤   𝑆,𝑔   𝑥,𝑤,𝑦,𝑧,𝑆   𝑔,𝑁   𝑤,𝑠,𝑁,𝑥,𝑦,𝑧   𝑔,𝑋,𝑠,𝑤,𝑥,𝑦,𝑧   + ,𝑠,𝑤,𝑥,𝑦,𝑧   𝑤, ∼ ,𝑧   ⊕ ,𝑔,𝑤,𝑥,𝑦,𝑧   𝑔,𝐺,𝑠,𝑥,𝑦,𝑧   𝑃,𝑔,𝑠,𝑤,𝑥,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑤, 𝑔, 𝑠)   + (𝑔)   ⊕ (𝑠)   ∼ (𝑥, 𝑦, 𝑔, 𝑠)   𝑆(𝑠)   𝐺(𝑤)

Proof of Theorem sylow1lem3

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sylow1.p	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ ℙ)
2		sylow1.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
3		sylow1.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ Grp)
4		sylow1.f	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ Fin)
5		sylow1.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
6		sylow1.d	. . . . . . . 8 ⊢ (𝜑 → (𝑃↑𝑁) ∥ (♯‘𝑋))
7		sylow1lem.a	. . . . . . . 8 ⊢ + = (+g‘𝐺)
8		sylow1lem.s	. . . . . . . 8 ⊢ 𝑆 = {𝑠 ∈ 𝒫 𝑋 ∣ (♯‘𝑠) = (𝑃↑𝑁)}
9	2, 3, 4, 1, 5, 6, 7, 8	sylow1lem1 19712	. . . . . . 7 ⊢ (𝜑 → ((♯‘𝑆) ∈ ℕ ∧ (𝑃 pCnt (♯‘𝑆)) = ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
10	9	simpld 500	. . . . . 6 ⊢ (𝜑 → (♯‘𝑆) ∈ ℕ)
11		pcndvds 16948	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑆) ∈ ℕ) → ¬ (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆))
12	1, 10, 11	syl2anc 596	. . . . 5 ⊢ (𝜑 → ¬ (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆))
13	9	simprd 501	. . . . . . . 8 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑆)) = ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
14	13	oveq1d 7434	. . . . . . 7 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑆)) + 1) = (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1))
15	14	oveq2d 7435	. . . . . 6 ⊢ (𝜑 → (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) = (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)))
16		sylow1lem.m	. . . . . . . . 9 ⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑆 ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
17	2, 3, 4, 1, 5, 6, 7, 8, 16	sylow1lem2 19713	. . . . . . . 8 ⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑆))
18		sylow1lem3.1	. . . . . . . . 9 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑆 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
19	18, 2	gaorber 19422	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑆) → ∼ Er 𝑆)
20	17, 19	syl 18	. . . . . . 7 ⊢ (𝜑 → ∼ Er 𝑆)
21		pwfi 9285	. . . . . . . . 9 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin)
22	4, 21	sylib 221	. . . . . . . 8 ⊢ (𝜑 → 𝒫 𝑋 ∈ Fin)
23	8	ssrab3 4037	. . . . . . . 8 ⊢ 𝑆 ⊆ 𝒫 𝑋
24		ssfi 9164	. . . . . . . 8 ⊢ ((𝒫 𝑋 ∈ Fin ∧ 𝑆 ⊆ 𝒫 𝑋) → 𝑆 ∈ Fin)
25	22, 23, 24	sylancl 598	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ Fin)
26	20, 25	qshash 15902	. . . . . 6 ⊢ (𝜑 → (♯‘𝑆) = Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
27	15, 26	breq12d 5124	. . . . 5 ⊢ (𝜑 → ((𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧)))
28	12, 27	mtbid 327	. . . 4 ⊢ (𝜑 → ¬ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
29		pwfi 9285	. . . . . . . 8 ⊢ (𝑆 ∈ Fin ↔ 𝒫 𝑆 ∈ Fin)
30	25, 29	sylib 221	. . . . . . 7 ⊢ (𝜑 → 𝒫 𝑆 ∈ Fin)
31	20	qsss 8779	. . . . . . 7 ⊢ (𝜑 → (𝑆 / ∼ ) ⊆ 𝒫 𝑆)
32	30, 31	ssfid 9236	. . . . . 6 ⊢ (𝜑 → (𝑆 / ∼ ) ∈ Fin)
33	32	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑆 / ∼ ) ∈ Fin)
34		prmnn 16754	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
35	1, 34	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℕ)
36	1, 10	pccld 16932	. . . . . . . . . 10 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑆)) ∈ ℕ0)
37	13, 36	eqeltrrd 2866	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℕ0)
38		peano2nn0 12559	. . . . . . . . 9 ⊢ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℕ0 → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
39	37, 38	syl 18	. . . . . . . 8 ⊢ (𝜑 → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
40	35, 39	nnexpcld 14299	. . . . . . 7 ⊢ (𝜑 → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℕ)
41	40	nnzd 12632	. . . . . 6 ⊢ (𝜑 → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℤ)
42	41	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℤ)
43		erdm 8711	. . . . . . . . . 10 ⊢ ( ∼ Er 𝑆 → dom ∼ = 𝑆)
44	20, 43	syl 18	. . . . . . . . 9 ⊢ (𝜑 → dom ∼ = 𝑆)
45		elqsn0 8788	. . . . . . . . 9 ⊢ ((dom ∼ = 𝑆 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ≠ ∅)
46	44, 45	sylan 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ≠ ∅)
47	25	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑆 ∈ Fin)
48	31	sselda 3938	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ∈ 𝒫 𝑆)
49	48	elpwid 4573	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ⊆ 𝑆)
50	47, 49	ssfid 9236	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ∈ Fin)
51		hashnncl 14420	. . . . . . . . 9 ⊢ (𝑧 ∈ Fin → ((♯‘𝑧) ∈ ℕ ↔ 𝑧 ≠ ∅))
52	50, 51	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((♯‘𝑧) ∈ ℕ ↔ 𝑧 ≠ ∅))
53	46, 52	mpbird 260	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℕ)
54	53	adantlr 728	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℕ)
55	54	nnzd 12632	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℤ)
56		fveq2 6885	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑧 → (♯‘𝑎) = (♯‘𝑧))
57	56	oveq2d 7435	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑧 → (𝑃 pCnt (♯‘𝑎)) = (𝑃 pCnt (♯‘𝑧)))
58	57	breq1d 5121	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑧 → ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
59	58	notbid 321	. . . . . . . . . 10 ⊢ (𝑎 = 𝑧 → (¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
60	59	rspccva 3582	. . . . . . . . 9 ⊢ ((∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
61	60	adantll 727	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
62	2	grpbn0 19077	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
63	3, 62	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑋 ≠ ∅)
64		hashnncl 14420	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
65	4, 64	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
66	63, 65	mpbird 260	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (♯‘𝑋) ∈ ℕ)
67	1, 66	pccld 16932	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ0)
68	67	nn0zd 12631	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑋)) ∈ ℤ)
69	5	nn0zd 12631	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑁 ∈ ℤ)
70	68, 69	zsubcld 12721	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ)
71	70	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ)
72	71	zred 12716	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℝ)
73	1	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑃 ∈ ℙ)
74	73, 54	pccld 16932	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℕ0)
75	74	nn0zd 12631	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℤ)
76	75	zred 12716	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℝ)
77	72, 76	ltnled 11372	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
78	61, 77	mpbird 260	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)))
79		zltp1le 12659	. . . . . . . 8 ⊢ ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑧)) ∈ ℤ) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧))))
80	71, 75, 79	syl2anc 596	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧))))
81	78, 80	mpbid 235	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)))
82	39	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
83		pcdvdsb 16951	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑧) ∈ ℤ ∧ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0) → ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧)))
84	73, 55, 82, 83	syl3anc 1398	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧)))
85	81, 84	mpbid 235	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧))
86	33, 42, 55, 85	fsumdvds 16388	. . . 4 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
87	28, 86	mtand 828	. . 3 ⊢ (𝜑 → ¬ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
88		dfrex2 3094	. . 3 ⊢ (∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ ¬ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
89	87, 88	sylibr 237	. 2 ⊢ (𝜑 → ∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
90		eqid 2765	. . . 4 ⊢ (𝑆 / ∼ ) = (𝑆 / ∼ )
91		fveq2 6885	. . . . . . 7 ⊢ ([𝑧] ∼ = 𝑎 → (♯‘[𝑧] ∼ ) = (♯‘𝑎))
92	91	oveq2d 7435	. . . . . 6 ⊢ ([𝑧] ∼ = 𝑎 → (𝑃 pCnt (♯‘[𝑧] ∼ )) = (𝑃 pCnt (♯‘𝑎)))
93	92	breq1d 5121	. . . . 5 ⊢ ([𝑧] ∼ = 𝑎 → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
94	93	imbi1d 344	. . . 4 ⊢ ([𝑧] ∼ = 𝑎 → (((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ↔ ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))))
95		eceq1 8740	. . . . . . . . . 10 ⊢ (𝑤 = 𝑧 → [𝑤] ∼ = [𝑧] ∼ )
96	95	fveq2d 6889	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (♯‘[𝑤] ∼ ) = (♯‘[𝑧] ∼ ))
97	96	oveq2d 7435	. . . . . . . 8 ⊢ (𝑤 = 𝑧 → (𝑃 pCnt (♯‘[𝑤] ∼ )) = (𝑃 pCnt (♯‘[𝑧] ∼ )))
98	97	breq1d 5121	. . . . . . 7 ⊢ (𝑤 = 𝑧 → ((𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
99	98	rspcev 3583	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ (𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
100	99	ex 418	. . . . 5 ⊢ (𝑧 ∈ 𝑆 → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
101	100	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
102	90, 94, 101	ectocld 8786	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
103	102	rexlimdva 3168	. 2 ⊢ (𝜑 → (∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
104	89, 103	mpd 16	1 ⊢ (𝜑 → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∀wral 3081  ∃wrex 3091  {crab 3418   ⊆ wss 3906  ∅c0 4286  𝒫 cpw 4564  {cpr 4593   class class class wbr 5111  {copab 5175   ↦ cmpt 5194  dom cdm 5663  ran crn 5664  ‘cfv 6540  (class class class)co 7419   ∈ cmpo 7421   Er wer 8697  [cec 8698   / cqs 8699  Fincfn 8949  1c1 11116   + caddc 11118   < clt 11258   ≤ cle 11259   − cmin 11456  ℕcn 12248  ℕ₀cn0 12519  ℤcz 12606  ↑cexp 14115  ♯chash 14384  Σcsu 15761   ∥ cdvds 16332  ℙcprime 16751   pCnt cpc 16918  Basecbs 17291  +_gcplusg 17332  Grpcgrp 19044   GrpAct cga 19403

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-inf2 9617  ax-cnex 11171  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-pre-mulgt0 11192  ax-pre-sup 11193

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-disj 5079  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-oadd 8463  df-er 8700  df-ec 8702  df-qs 8706  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-sup 9409  df-inf 9410  df-oi 9479  df-dju 9903  df-card 9941  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-sub 11458  df-neg 11459  df-div 11887  df-nn 12249  df-2 12318  df-3 12319  df-n0 12520  df-z 12607  df-uz 12879  df-q 12989  df-rp 13033  df-fz 13552  df-fzo 13700  df-fl 13843  df-mod 13921  df-seq 14056  df-exp 14116  df-fac 14328  df-bc 14357  df-hash 14385  df-cj 15174  df-re 15175  df-im 15176  df-sqrt 15310  df-abs 15311  df-clim 15563  df-sum 15762  df-dvds 16333  df-gcd 16575  df-prm 16752  df-pc 16919  df-0g 17516  df-mgm 18720  df-sgrp 18809  df-mnd 18825  df-grp 19047  df-minusg 19048  df-ga 19404

This theorem is used by:  sylow1  19717