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

Theorem symgextfv 19532
Description: The function value of the extension of a permutation, fixing the additional element, for elements in the original domain. (Contributed by AV, 6-Jan-2019.)
Hypotheses
Ref Expression
symgext.s 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
symgext.e 𝐸 = (𝑥𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)))
Assertion
Ref Expression
symgextfv ((𝐾𝑁𝑍𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸𝑋) = (𝑍𝑋)))
Distinct variable groups:   𝑥,𝐾   𝑥,𝑁   𝑥,𝑆   𝑥,𝑍   𝑥,𝑋
Allowed substitution hint:   𝐸(𝑥)

Proof of Theorem symgextfv
StepHypRef Expression
1 eldifi 4085 . . . 4 (𝑋 ∈ (𝑁 ∖ {𝐾}) → 𝑋𝑁)
2 fvexd 6900 . . . . 5 ((𝐾𝑁𝑍𝑆) → (𝑍𝑋) ∈ V)
3 ifexg 4539 . . . . 5 ((𝐾𝑁 ∧ (𝑍𝑋) ∈ V) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
42, 3syldan 603 . . . 4 ((𝐾𝑁𝑍𝑆) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
5 eqeq1 2769 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = 𝐾𝑋 = 𝐾))
6 fveq2 6885 . . . . . 6 (𝑥 = 𝑋 → (𝑍𝑥) = (𝑍𝑋))
75, 6ifbieq2d 4516 . . . . 5 (𝑥 = 𝑋 → if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
8 symgext.e . . . . 5 𝐸 = (𝑥𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)))
97, 8fvmptg 6991 . . . 4 ((𝑋𝑁 ∧ if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
101, 4, 9syl2anr 609 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
11 eldifsnneq 4761 . . . . 5 (𝑋 ∈ (𝑁 ∖ {𝐾}) → ¬ 𝑋 = 𝐾)
1211adantl 487 . . . 4 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ¬ 𝑋 = 𝐾)
1312iffalsed 4500 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) = (𝑍𝑋))
1410, 13eqtrd 2800 . 2 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = (𝑍𝑋))
1514ex 418 1 ((𝐾𝑁𝑍𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸𝑋) = (𝑍𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  cdif 3903  ifcif 4489  {csn 4591  cmpt 5194  cfv 6540  Basecbs 17291  SymGrpcsymg 19483
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-pr 5406
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-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  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-iota 6496  df-fun 6542  df-fv 6548
This theorem is used by:  symgextf1lem  19534  symgextf1  19535  symgextfo  19536  symgextres  19539
  Copyright terms: Public domain W3C validator