| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > symgextfv | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| symgext.s | ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) |
| symgext.e | ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) |
| Ref | Expression |
|---|---|
| symgextfv | ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifi 4085 | . . . 4 ⊢ (𝑋 ∈ (𝑁 ∖ {𝐾}) → 𝑋 ∈ 𝑁) | |
| 2 | fvexd 6896 | . . . . 5 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑍‘𝑋) ∈ V) | |
| 3 | ifexg 4537 | . . . . 5 ⊢ ((𝐾 ∈ 𝑁 ∧ (𝑍‘𝑋) ∈ V) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V) | |
| 4 | 2, 3 | syldan 602 | . . . 4 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V) |
| 5 | eqeq1 2767 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 = 𝐾 ↔ 𝑋 = 𝐾)) | |
| 6 | fveq2 6881 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑍‘𝑥) = (𝑍‘𝑋)) | |
| 7 | 5, 6 | ifbieq2d 4514 | . . . . 5 ⊢ (𝑥 = 𝑋 → if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋))) |
| 8 | symgext.e | . . . . 5 ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) | |
| 9 | 7, 8 | fvmptg 6987 | . . . 4 ⊢ ((𝑋 ∈ 𝑁 ∧ if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) ∈ V) → (𝐸‘𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋))) |
| 10 | 1, 4, 9 | syl2anr 608 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋))) |
| 11 | eldifsnneq 4759 | . . . . 5 ⊢ (𝑋 ∈ (𝑁 ∖ {𝐾}) → ¬ 𝑋 = 𝐾) | |
| 12 | 11 | adantl 486 | . . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ¬ 𝑋 = 𝐾) |
| 13 | 12 | iffalsed 4498 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → if(𝑋 = 𝐾, 𝐾, (𝑍‘𝑋)) = (𝑍‘𝑋)) |
| 14 | 10, 13 | eqtrd 2798 | . 2 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = (𝑍‘𝑋)) |
| 15 | 14 | ex 417 | 1 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∖ cdif 3902 ifcif 4487 {csn 4589 ↦ cmpt 5192 ‘cfv 6536 Basecbs 17264 SymGrpcsymg 19434 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-iota 6492 df-fun 6538 df-fv 6544 |
| This theorem is referenced by: symgextf1lem 19485 symgextf1 19486 symgextfo 19487 symgextres 19490 |
| Copyright terms: Public domain | W3C validator |