Theorem sylow2alem1 19733

Description: Lemma for sylow2a 19735. An equivalence class of fixed points is a singleton. (Contributed by Mario Carneiro, 17-Jan-2015.)

Hypotheses

Ref	Expression
sylow2a.x	⊢ 𝑋 = (Base‘𝐺)
sylow2a.m	⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑌))
sylow2a.p	⊢ (𝜑 → 𝑃 pGrp 𝐺)
sylow2a.f	⊢ (𝜑 → 𝑋 ∈ Fin)
sylow2a.y	⊢ (𝜑 → 𝑌 ∈ Fin)
sylow2a.z	⊢ 𝑍 = {𝑢 ∈ 𝑌 ∣ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢}
sylow2a.r	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}

Assertion

Ref	Expression
sylow2alem1	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → [𝐴] ∼ = {𝐴})

Distinct variable groups:   ∼ ,ℎ   𝑔,ℎ,𝑢,𝑥,𝑦,𝐴   𝑔,𝐺,𝑥,𝑦   ⊕ ,𝑔,ℎ,𝑢,𝑥,𝑦   𝑔,𝑋,ℎ,𝑢,𝑥,𝑦   𝜑,ℎ   𝑔,𝑌,ℎ,𝑢,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑢, 𝑔)   𝑃(𝑥, 𝑦, 𝑢, 𝑔, ℎ)   ∼ (𝑥, 𝑦, 𝑢, 𝑔)   𝐺(𝑢, ℎ)   𝑍(𝑥, 𝑦, 𝑢, 𝑔, ℎ)

Proof of Theorem sylow2alem1

Dummy variables 𝑘 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3461	. . . . . 6 ⊢ 𝑤 ∈ V
2		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ 𝑍)
3		elecg 8745	. . . . . 6 ⊢ ((𝑤 ∈ V ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑤))
4	1, 2, 3	sylancr 599	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑤))
5		sylow2a.r	. . . . . . . 8 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
6	5	gaorb 19423	. . . . . . 7 ⊢ (𝐴 ∼ 𝑤 ↔ (𝐴 ∈ 𝑌 ∧ 𝑤 ∈ 𝑌 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤))
7	6	simp3bi 1165	. . . . . 6 ⊢ (𝐴 ∼ 𝑤 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤)
8		oveq2 7427	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝐴 → (ℎ ⊕ 𝑢) = (ℎ ⊕ 𝐴))
9		id 23	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝐴 → 𝑢 = 𝐴)
10	8, 9	eqeq12d 2781	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝐴 → ((ℎ ⊕ 𝑢) = 𝑢 ↔ (ℎ ⊕ 𝐴) = 𝐴))
11	10	ralbidv 3190	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝐴 → (∀ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢 ↔ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
12		sylow2a.z	. . . . . . . . . . . 12 ⊢ 𝑍 = {𝑢 ∈ 𝑌 ∣ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢}
13	11, 12	elrab2 3656	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑍 ↔ (𝐴 ∈ 𝑌 ∧ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
14	13	bilani 510	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ 𝑌 ∧ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
15	14	simprd 501	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴)
16		oveq1 7426	. . . . . . . . . . 11 ⊢ (ℎ = 𝑘 → (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴))
17	16	eqeq1d 2767	. . . . . . . . . 10 ⊢ (ℎ = 𝑘 → ((ℎ ⊕ 𝐴) = 𝐴 ↔ (𝑘 ⊕ 𝐴) = 𝐴))
18	17	rspccva 3582	. . . . . . . . 9 ⊢ ((∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴 ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) = 𝐴)
19	15, 18	sylan 592	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) = 𝐴)
20		eqeq1 2769	. . . . . . . 8 ⊢ ((𝑘 ⊕ 𝐴) = 𝑤 → ((𝑘 ⊕ 𝐴) = 𝐴 ↔ 𝑤 = 𝐴))
21	19, 20	syl5ibcom 248	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝑘 ⊕ 𝐴) = 𝑤 → 𝑤 = 𝐴))
22	21	rexlimdva 3168	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤 → 𝑤 = 𝐴))
23	7, 22	syl5 35	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∼ 𝑤 → 𝑤 = 𝐴))
24	4, 23	sylbid 243	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ → 𝑤 = 𝐴))
25		velsn 4607	. . . 4 ⊢ (𝑤 ∈ {𝐴} ↔ 𝑤 = 𝐴)
26	24, 25	imbitrrdi 255	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ → 𝑤 ∈ {𝐴}))
27	26	ssrdv 3944	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → [𝐴] ∼ ⊆ {𝐴})
28		sylow2a.m	. . . . . . 7 ⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑌))
29		sylow2a.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
30	5, 29	gaorber 19424	. . . . . . 7 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ∼ Er 𝑌)
31	28, 30	syl 18	. . . . . 6 ⊢ (𝜑 → ∼ Er 𝑌)
32	31	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → ∼ Er 𝑌)
33	14	simpld 500	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ 𝑌)
34	32, 33	erref 8721	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∼ 𝐴)
35		elecg 8745	. . . . 5 ⊢ ((𝐴 ∈ 𝑍 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
36	2, 35	sylancom 600	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
37	34, 36	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ [𝐴] ∼ )
38	37	snssd 4754	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → {𝐴} ⊆ [𝐴] ∼ )
39	27, 38	eqssd 3955	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑍) → [𝐴] ∼ = {𝐴})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  {crab 3418  Vcvv 3457   ⊆ wss 3906  {csn 4591  {cpr 4593   class class class wbr 5111  {copab 5175  ‘cfv 6540  (class class class)co 7419   Er wer 8697  [cec 8698  Fincfn 8949  Basecbs 17293   GrpAct cga 19405   pGrp cpgp 19642

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-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-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-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  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-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-er 8700  df-ec 8702  df-map 8832  df-0g 17518  df-mgm 18722  df-sgrp 18811  df-mnd 18827  df-grp 19049  df-minusg 19050  df-ga 19406

This theorem is used by:  sylow2alem2  19734  sylow2a  19735