Theorem sylow1lem3 19530

Description: Lemma for sylow1 19533. 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 19528	. . . . . . 7 ⊢ (𝜑 → ((♯‘𝑆) ∈ ℕ ∧ (𝑃 pCnt (♯‘𝑆)) = ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
10	9	simpld 494	. . . . . 6 ⊢ (𝜑 → (♯‘𝑆) ∈ ℕ)
11		pcndvds 16837	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑆) ∈ ℕ) → ¬ (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆))
12	1, 10, 11	syl2anc 584	. . . . 5 ⊢ (𝜑 → ¬ (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆))
13	9	simprd 495	. . . . . . . 8 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑆)) = ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
14	13	oveq1d 7402	. . . . . . 7 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑆)) + 1) = (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1))
15	14	oveq2d 7403	. . . . . 6 ⊢ (𝜑 → (𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) = (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)))
16		sylow1lem.m	. . . . . . . . 9 ⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑆 ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
17	2, 3, 4, 1, 5, 6, 7, 8, 16	sylow1lem2 19529	. . . . . . . 8 ⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑆))
18		sylow1lem3.1	. . . . . . . . 9 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑆 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
19	18, 2	gaorber 19240	. . . . . . . 8 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑆) → ∼ Er 𝑆)
20	17, 19	syl 17	. . . . . . 7 ⊢ (𝜑 → ∼ Er 𝑆)
21		pwfi 9268	. . . . . . . . 9 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin)
22	4, 21	sylib 218	. . . . . . . 8 ⊢ (𝜑 → 𝒫 𝑋 ∈ Fin)
23	8	ssrab3 4045	. . . . . . . 8 ⊢ 𝑆 ⊆ 𝒫 𝑋
24		ssfi 9137	. . . . . . . 8 ⊢ ((𝒫 𝑋 ∈ Fin ∧ 𝑆 ⊆ 𝒫 𝑋) → 𝑆 ∈ Fin)
25	22, 23, 24	sylancl 586	. . . . . . 7 ⊢ (𝜑 → 𝑆 ∈ Fin)
26	20, 25	qshash 15793	. . . . . 6 ⊢ (𝜑 → (♯‘𝑆) = Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
27	15, 26	breq12d 5120	. . . . 5 ⊢ (𝜑 → ((𝑃↑((𝑃 pCnt (♯‘𝑆)) + 1)) ∥ (♯‘𝑆) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧)))
28	12, 27	mtbid 324	. . . 4 ⊢ (𝜑 → ¬ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
29		pwfi 9268	. . . . . . . 8 ⊢ (𝑆 ∈ Fin ↔ 𝒫 𝑆 ∈ Fin)
30	25, 29	sylib 218	. . . . . . 7 ⊢ (𝜑 → 𝒫 𝑆 ∈ Fin)
31	20	qsss 8749	. . . . . . 7 ⊢ (𝜑 → (𝑆 / ∼ ) ⊆ 𝒫 𝑆)
32	30, 31	ssfid 9212	. . . . . 6 ⊢ (𝜑 → (𝑆 / ∼ ) ∈ Fin)
33	32	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑆 / ∼ ) ∈ Fin)
34		prmnn 16644	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
35	1, 34	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℕ)
36	1, 10	pccld 16821	. . . . . . . . . 10 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑆)) ∈ ℕ0)
37	13, 36	eqeltrrd 2829	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℕ0)
38		peano2nn0 12482	. . . . . . . . 9 ⊢ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℕ0 → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
39	37, 38	syl 17	. . . . . . . 8 ⊢ (𝜑 → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
40	35, 39	nnexpcld 14210	. . . . . . 7 ⊢ (𝜑 → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℕ)
41	40	nnzd 12556	. . . . . 6 ⊢ (𝜑 → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℤ)
42	41	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∈ ℤ)
43		erdm 8681	. . . . . . . . . 10 ⊢ ( ∼ Er 𝑆 → dom ∼ = 𝑆)
44	20, 43	syl 17	. . . . . . . . 9 ⊢ (𝜑 → dom ∼ = 𝑆)
45		elqsn0 8757	. . . . . . . . 9 ⊢ ((dom ∼ = 𝑆 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ≠ ∅)
46	44, 45	sylan 580	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ≠ ∅)
47	25	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑆 ∈ Fin)
48	31	sselda 3946	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ∈ 𝒫 𝑆)
49	48	elpwid 4572	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ⊆ 𝑆)
50	47, 49	ssfid 9212	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑧 ∈ Fin)
51		hashnncl 14331	. . . . . . . . 9 ⊢ (𝑧 ∈ Fin → ((♯‘𝑧) ∈ ℕ ↔ 𝑧 ≠ ∅))
52	50, 51	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((♯‘𝑧) ∈ ℕ ↔ 𝑧 ≠ ∅))
53	46, 52	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℕ)
54	53	adantlr 715	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℕ)
55	54	nnzd 12556	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (♯‘𝑧) ∈ ℤ)
56		fveq2 6858	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑧 → (♯‘𝑎) = (♯‘𝑧))
57	56	oveq2d 7403	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑧 → (𝑃 pCnt (♯‘𝑎)) = (𝑃 pCnt (♯‘𝑧)))
58	57	breq1d 5117	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑧 → ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
59	58	notbid 318	. . . . . . . . . 10 ⊢ (𝑎 = 𝑧 → (¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
60	59	rspccva 3587	. . . . . . . . 9 ⊢ ((∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
61	60	adantll 714	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
62	2	grpbn0 18898	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
63	3, 62	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑋 ≠ ∅)
64		hashnncl 14331	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
65	4, 64	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
66	63, 65	mpbird 257	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (♯‘𝑋) ∈ ℕ)
67	1, 66	pccld 16821	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ0)
68	67	nn0zd 12555	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 pCnt (♯‘𝑋)) ∈ ℤ)
69	5	nn0zd 12555	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑁 ∈ ℤ)
70	68, 69	zsubcld 12643	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ)
71	70	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ)
72	71	zred 12638	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℝ)
73	1	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → 𝑃 ∈ ℙ)
74	73, 54	pccld 16821	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℕ0)
75	74	nn0zd 12555	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℤ)
76	75	zred 12638	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃 pCnt (♯‘𝑧)) ∈ ℝ)
77	72, 76	ltnled 11321	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ ¬ (𝑃 pCnt (♯‘𝑧)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
78	61, 77	mpbird 257	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)))
79		zltp1le 12583	. . . . . . . 8 ⊢ ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑧)) ∈ ℤ) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧))))
80	71, 75, 79	syl2anc 584	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) < (𝑃 pCnt (♯‘𝑧)) ↔ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧))))
81	78, 80	mpbid 232	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)))
82	39	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0)
83		pcdvdsb 16840	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑧) ∈ ℤ ∧ (((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ∈ ℕ0) → ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧)))
84	73, 55, 82, 83	syl3anc 1373	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → ((((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1) ≤ (𝑃 pCnt (♯‘𝑧)) ↔ (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧)))
85	81, 84	mpbid 232	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ∧ 𝑧 ∈ (𝑆 / ∼ )) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ (♯‘𝑧))
86	33, 42, 55, 85	fsumdvds 16278	. . . 4 ⊢ ((𝜑 ∧ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → (𝑃↑(((𝑃 pCnt (♯‘𝑋)) − 𝑁) + 1)) ∥ Σ𝑧 ∈ (𝑆 / ∼ )(♯‘𝑧))
87	28, 86	mtand 815	. . 3 ⊢ (𝜑 → ¬ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
88		dfrex2 3056	. . 3 ⊢ (∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ ¬ ∀𝑎 ∈ (𝑆 / ∼ ) ¬ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
89	87, 88	sylibr 234	. 2 ⊢ (𝜑 → ∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
90		eqid 2729	. . . 4 ⊢ (𝑆 / ∼ ) = (𝑆 / ∼ )
91		fveq2 6858	. . . . . . 7 ⊢ ([𝑧] ∼ = 𝑎 → (♯‘[𝑧] ∼ ) = (♯‘𝑎))
92	91	oveq2d 7403	. . . . . 6 ⊢ ([𝑧] ∼ = 𝑎 → (𝑃 pCnt (♯‘[𝑧] ∼ )) = (𝑃 pCnt (♯‘𝑎)))
93	92	breq1d 5117	. . . . 5 ⊢ ([𝑧] ∼ = 𝑎 → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
94	93	imbi1d 341	. . . 4 ⊢ ([𝑧] ∼ = 𝑎 → (((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) ↔ ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))))
95		eceq1 8710	. . . . . . . . . 10 ⊢ (𝑤 = 𝑧 → [𝑤] ∼ = [𝑧] ∼ )
96	95	fveq2d 6862	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (♯‘[𝑤] ∼ ) = (♯‘[𝑧] ∼ ))
97	96	oveq2d 7403	. . . . . . . 8 ⊢ (𝑤 = 𝑧 → (𝑃 pCnt (♯‘[𝑤] ∼ )) = (𝑃 pCnt (♯‘[𝑧] ∼ )))
98	97	breq1d 5117	. . . . . . 7 ⊢ (𝑤 = 𝑧 → ((𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) ↔ (𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
99	98	rspcev 3588	. . . . . 6 ⊢ ((𝑧 ∈ 𝑆 ∧ (𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))
100	99	ex 412	. . . . 5 ⊢ (𝑧 ∈ 𝑆 → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
101	100	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝑃 pCnt (♯‘[𝑧] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
102	90, 94, 101	ectocld 8755	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑆 / ∼ )) → ((𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
103	102	rexlimdva 3134	. 2 ⊢ (𝜑 → (∃𝑎 ∈ (𝑆 / ∼ )(𝑃 pCnt (♯‘𝑎)) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁) → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁)))
104	89, 103	mpd 15	1 ⊢ (𝜑 → ∃𝑤 ∈ 𝑆 (𝑃 pCnt (♯‘[𝑤] ∼ )) ≤ ((𝑃 pCnt (♯‘𝑋)) − 𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  {crab 3405   ⊆ wss 3914  ∅c0 4296  𝒫 cpw 4563  {cpr 4591   class class class wbr 5107  {copab 5169   ↦ cmpt 5188  dom cdm 5638  ran crn 5639  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389   Er wer 8668  [cec 8669   / cqs 8670  Fincfn 8918  1c1 11069   + caddc 11071   < clt 11208   ≤ cle 11209   − cmin 11405  ℕcn 12186  ℕ₀cn0 12442  ℤcz 12529  ↑cexp 14026  ♯chash 14295  Σcsu 15652   ∥ cdvds 16222  ℙcprime 16641   pCnt cpc 16807  Basecbs 17179  +_gcplusg 17220  Grpcgrp 18865   GrpAct cga 19221

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145  ax-pre-sup 11146

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-disj 5075  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-2o 8435  df-oadd 8438  df-er 8671  df-ec 8673  df-qs 8677  df-map 8801  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-sup 9393  df-inf 9394  df-oi 9463  df-dju 9854  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-div 11836  df-nn 12187  df-2 12249  df-3 12250  df-n0 12443  df-z 12530  df-uz 12794  df-q 12908  df-rp 12952  df-fz 13469  df-fzo 13616  df-fl 13754  df-mod 13832  df-seq 13967  df-exp 14027  df-fac 14239  df-bc 14268  df-hash 14296  df-cj 15065  df-re 15066  df-im 15067  df-sqrt 15201  df-abs 15202  df-clim 15454  df-sum 15653  df-dvds 16223  df-gcd 16465  df-prm 16642  df-pc 16808  df-0g 17404  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-ga 19222

This theorem is referenced by:  sylow1  19533