MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sylow2alem1 Structured version   Visualization version   GIF version

Theorem sylow2alem1 19843
Description: Lemma for sylow2a 19845. 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.
StepHypRef Expression
1 vex 3457 . . . . . 6 𝑤 ∈ V
2 simpr 490 . . . . . 6 ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ 𝑍)
3 elecg 8773 . . . . . 6 ((𝑤 ∈ V ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑤))
41, 2, 3sylancr 599 . . . . 5 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑤))
5 sylow2a.r . . . . . . . 8 ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
65gaorb 19533 . . . . . . 7 (𝐴 ∼ 𝑤 ↔ (𝐴 ∈ 𝑌 ∧ 𝑤 ∈ 𝑌 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤))
76simp3bi 1165 . . . . . 6 (𝐴 ∼ 𝑤 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤)
8 oveq2 7435 . . . . . . . . . . . . . 14 (𝑢 = 𝐴 → (ℎ ⊕ 𝑢) = (ℎ ⊕ 𝐴))
9 id 23 . . . . . . . . . . . . . 14 (𝑢 = 𝐴 → 𝑢 = 𝐴)
108, 9eqeq12d 2779 . . . . . . . . . . . . 13 (𝑢 = 𝐴 → ((ℎ ⊕ 𝑢) = 𝑢 ↔ (ℎ ⊕ 𝐴) = 𝐴))
1110ralbidv 3188 . . . . . . . . . . . 12 (𝑢 = 𝐴 → (∀ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢 ↔ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
12 sylow2a.z . . . . . . . . . . . 12 𝑍 = {𝑢 ∈ 𝑌 ∣ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢}
1311, 12elrab2 3651 . . . . . . . . . . 11 (𝐴 ∈ 𝑍 ↔ (𝐴 ∈ 𝑌 ∧ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
1413bilani 510 . . . . . . . . . 10 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ 𝑌 ∧ ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴))
1514simprd 501 . . . . . . . . 9 ((𝜑 ∧ 𝐴 ∈ 𝑍) → ∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴)
16 oveq1 7434 . . . . . . . . . . 11 (ℎ = 𝑘 → (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴))
1716eqeq1d 2765 . . . . . . . . . 10 (ℎ = 𝑘 → ((ℎ ⊕ 𝐴) = 𝐴 ↔ (𝑘 ⊕ 𝐴) = 𝐴))
1817rspccva 3578 . . . . . . . . 9 ((∀ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐴 ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) = 𝐴)
1915, 18sylan 592 . . . . . . . 8 (((𝜑 ∧ 𝐴 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) = 𝐴)
20 eqeq1 2767 . . . . . . . 8 ((𝑘 ⊕ 𝐴) = 𝑤 → ((𝑘 ⊕ 𝐴) = 𝐴 ↔ 𝑤 = 𝐴))
2119, 20syl5ibcom 248 . . . . . . 7 (((𝜑 ∧ 𝐴 ∈ 𝑍) ∧ 𝑘 ∈ 𝑋) → ((𝑘 ⊕ 𝐴) = 𝑤 → 𝑤 = 𝐴))
2221rexlimdva 3166 . . . . . 6 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝐴) = 𝑤 → 𝑤 = 𝐴))
237, 22syl5 35 . . . . 5 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∼ 𝑤 → 𝑤 = 𝐴))
244, 23sylbid 243 . . . 4 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ → 𝑤 = 𝐴))
25 velsn 4599 . . . 4 (𝑤 ∈ {𝐴} ↔ 𝑤 = 𝐴)
2624, 25imbitrrdi 255 . . 3 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝑤 ∈ [𝐴] ∼ → 𝑤 ∈ {𝐴}))
2726ssrdv 3918 . 2 ((𝜑 ∧ 𝐴 ∈ 𝑍) → [𝐴] ∼ ⊆ {𝐴})
28 sylow2a.m . . . . . . 7 (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑌))
29 sylow2a.x . . . . . . . 8 𝑋 = (Base‘𝐺)
305, 29gaorber 19534 . . . . . . 7 ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ∼ Er 𝑌)
3128, 30syl 18 . . . . . 6 (𝜑 → ∼ Er 𝑌)
3231adantr 486 . . . . 5 ((𝜑 ∧ 𝐴 ∈ 𝑍) → ∼ Er 𝑌)
3314simpld 500 . . . . 5 ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ 𝑌)
3432, 33erref 8749 . . . 4 ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∼ 𝐴)
35 elecg 8773 . . . . 5 ((𝐴 ∈ 𝑍 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
362, 35sylancom 600 . . . 4 ((𝜑 ∧ 𝐴 ∈ 𝑍) → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
3734, 36mpbird 260 . . 3 ((𝜑 ∧ 𝐴 ∈ 𝑍) → 𝐴 ∈ [𝐴] ∼ )
3837snssd 4746 . 2 ((𝜑 ∧ 𝐴 ∈ 𝑍) → {𝐴} ⊆ [𝐴] ∼ )
3927, 38eqssd 3929 1 ((𝜑 ∧ 𝐴 ∈ 𝑍) → [𝐴] ∼ = {𝐴})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079  ∃wrex 3089  {crab 3415  Vcvv 3453   ⊆ wss 3899  {csn 4587  {cpr 4589   class class class wbr 5105  {copab 5169  ‘cfv 6546  (class class class)co 7427   Er wer 8725  [cec 8726  Fincfn 8984  Basecbs 17399   GrpAct cga 19515   pGrp cpgp 19752
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-er 8728  df-ec 8730  df-map 8860  df-0g 17624  df-mgm 18828  df-sgrp 18920  df-mnd 18936  df-grp 19159  df-minusg 19160  df-ga 19516
This theorem is used by:  sylow2alem2  19844  sylow2a  19845
  Copyright terms: Public domain W3C validator