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

Theorem symgextfv 19487
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 4093 . . . 4 (𝑋 ∈ (𝑁 ∖ {𝐾}) → 𝑋𝑁)
2 fvexd 6897 . . . . 5 ((𝐾𝑁𝑍𝑆) → (𝑍𝑋) ∈ V)
3 ifexg 4542 . . . . 5 ((𝐾𝑁 ∧ (𝑍𝑋) ∈ V) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
42, 3syldan 602 . . . 4 ((𝐾𝑁𝑍𝑆) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V)
5 eqeq1 2773 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = 𝐾𝑋 = 𝐾))
6 fveq2 6882 . . . . . 6 (𝑥 = 𝑋 → (𝑍𝑥) = (𝑍𝑋))
75, 6ifbieq2d 4519 . . . . 5 (𝑥 = 𝑋 → if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
8 symgext.e . . . . 5 𝐸 = (𝑥𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍𝑥)))
97, 8fvmptg 6988 . . . 4 ((𝑋𝑁 ∧ if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) ∈ V) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
101, 4, 9syl2anr 608 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)))
11 eldifsnneq 4763 . . . . 5 (𝑋 ∈ (𝑁 ∖ {𝐾}) → ¬ 𝑋 = 𝐾)
1211adantl 486 . . . 4 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ¬ 𝑋 = 𝐾)
1312iffalsed 4503 . . 3 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → if(𝑋 = 𝐾, 𝐾, (𝑍𝑋)) = (𝑍𝑋))
1410, 13eqtrd 2804 . 2 (((𝐾𝑁𝑍𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸𝑋) = (𝑍𝑋))
1514ex 417 1 ((𝐾𝑁𝑍𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸𝑋) = (𝑍𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400   = wceq 1567  wcel 2149  Vcvv 3463  cdif 3910  ifcif 4492  {csn 4594  cmpt 5196  cfv 6537  Basecbs 17268  SymGrpcsymg 19438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-iota 6493  df-fun 6539  df-fv 6545
This theorem is referenced by:  symgextf1lem  19489  symgextf1  19490  symgextfo  19491  symgextres  19494
  Copyright terms: Public domain W3C validator