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

Theorem symgextfv 19460
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 4154 . . . 4 (𝑋 ∈ (𝑁 ∖ {𝐾}) → 𝑋𝑁)
2 fvexd 6935 . . . . 5 ((𝐾𝑁𝑍𝑆) → (𝑍𝑋) ∈ V)
3 ifexg 4597 . . . . 5 ((𝐾𝑁 ∧ (𝑍𝑋) ∈ V) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
42, 3syldan 590 . . . 4 ((𝐾𝑁𝑍𝑆) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
5 eqeq1 2744 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = 𝐾𝑋 = 𝐾))
6 fveq2 6920 . . . . . 6 (𝑥 = 𝑋 → (𝑍𝑥) = (𝑍𝑋))
75, 6ifbieq2d 4574 . . . . 5 (𝑥 = 𝑋 → if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
8 symgext.e . . . . 5 𝐸 = (𝑥𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)))
97, 8fvmptg 7027 . . . 4 ((𝑋𝑁 ∧ if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
101, 4, 9syl2anr 596 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
11 eldifsnneq 4816 . . . . 5 (𝑋 ∈ (𝑁 ∖ {𝐾}) → ¬ 𝑋 = 𝐾)
1211adantl 481 . . . 4 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ¬ 𝑋 = 𝐾)
1312iffalsed 4559 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) = (𝑍𝑋))
1410, 13eqtrd 2780 . 2 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = (𝑍𝑋))
1514ex 412 1 ((𝐾𝑁𝑍𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸𝑋) = (𝑍𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1537  wcel 2108  Vcvv 3488  cdif 3973  ifcif 4548  {csn 4648  cmpt 5249  cfv 6573  Basecbs 17258  SymGrpcsymg 19410
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581
This theorem is referenced by:  symgextf1lem  19462  symgextf1  19463  symgextfo  19464  symgextres  19467
  Copyright terms: Public domain W3C validator