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

Theorem symgextfv 19641
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 4066 . . . 4 (𝑋 ∈ (𝑁 ∖ {𝐾}) → 𝑋 ∈ 𝑁)
2 fvexd 6905 . . . . 5 ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑍‘𝑋) ∈ V)
3 ifexg 4531 . . . . 5 ((𝐾 ∈ 𝑁 ∧ (𝑍‘𝑋) ∈ V) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V)
42, 3syldan 603 . . . 4 ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V)
5 eqeq1 2764 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = 𝐾 ↔ 𝑋 = 𝐾))
6 fveq2 6890 . . . . . 6 (𝑥 = 𝑋 → (𝑍‘𝑥) = (𝑍‘𝑋))
75, 6ifbieq2d 4508 . . . . 5 (𝑥 = 𝑋 → if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)))
8 symgext.e . . . . 5 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)))
97, 8fvmptg 6996 . . . 4 ((𝑋 ∈ 𝑁 ∧ if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V) → (𝐸‘𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)))
101, 4, 9syl2anr 609 . . 3 (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)))
11 eldifsnneq 4750 . . . . 5 (𝑋 ∈ (𝑁 ∖ {𝐾}) → ¬ 𝑋 = 𝐾)
1211adantl 487 . . . 4 (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ¬ 𝑋 = 𝐾)
1312iffalsed 4492 . . 3 (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) = (𝑍‘𝑋))
1410, 13eqtrd 2795 . 2 (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = (𝑍‘𝑋))
1514ex 418 1 ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4044  ifcif 4481  {csn 4584   ↦ cmpt 5185  ‘cfv 6543  Basecbs 17396  SymGrpcsymg 19592
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fv 6551
This theorem is used by:  symgextf1lem  19643  symgextf1  19644  symgextfo  19645  symgextres  19648
  Copyright terms: Public domain W3C validator