![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > symgextfve | Structured version Visualization version GIF version |
Description: The function value of the extension of a permutation, fixing the additional element, for the additional element. (Contributed by AV, 6-Jan-2019.) |
Ref | Expression |
---|---|
symgext.s | ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) |
symgext.e | ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) |
Ref | Expression |
---|---|
symgextfve | ⊢ (𝐾 ∈ 𝑁 → (𝑋 = 𝐾 → (𝐸‘𝑋) = 𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6645 | . . 3 ⊢ (𝑋 = 𝐾 → (𝐸‘𝑋) = (𝐸‘𝐾)) | |
2 | iftrue 4431 | . . . . 5 ⊢ (𝑥 = 𝐾 → if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)) = 𝐾) | |
3 | symgext.e | . . . . 5 ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) | |
4 | 2, 3 | fvmptg 6743 | . . . 4 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝐾 ∈ 𝑁) → (𝐸‘𝐾) = 𝐾) |
5 | 4 | anidms 570 | . . 3 ⊢ (𝐾 ∈ 𝑁 → (𝐸‘𝐾) = 𝐾) |
6 | 1, 5 | sylan9eqr 2855 | . 2 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑋 = 𝐾) → (𝐸‘𝑋) = 𝐾) |
7 | 6 | ex 416 | 1 ⊢ (𝐾 ∈ 𝑁 → (𝑋 = 𝐾 → (𝐸‘𝑋) = 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 ∖ cdif 3878 ifcif 4425 {csn 4525 ↦ cmpt 5110 ‘cfv 6324 Basecbs 16475 SymGrpcsymg 18487 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fun 6326 df-fv 6332 |
This theorem is referenced by: symgextf1lem 18540 symgextfo 18542 |
Copyright terms: Public domain | W3C validator |