| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > symgfixelq | Structured version Visualization version GIF version | ||
| Description: A permutation of a set fixing an element of the set. (Contributed by AV, 4-Jan-2019.) |
| Ref | Expression |
|---|---|
| symgfixf.p | ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) |
| symgfixf.q | ⊢ 𝑄 = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} |
| Ref | Expression |
|---|---|
| symgfixelq | ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝑄 ↔ (𝐹:𝑁–1-1-onto→𝑁 ∧ (𝐹‘𝐾) = 𝐾))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq1 6831 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓‘𝐾) = (𝐹‘𝐾)) | |
| 2 | 1 | eqeq1d 2736 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝐾) = 𝐾 ↔ (𝐹‘𝐾) = 𝐾)) |
| 3 | symgfixf.q | . . . 4 ⊢ 𝑄 = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} | |
| 4 | fveq1 6831 | . . . . . 6 ⊢ (𝑞 = 𝑓 → (𝑞‘𝐾) = (𝑓‘𝐾)) | |
| 5 | 4 | eqeq1d 2736 | . . . . 5 ⊢ (𝑞 = 𝑓 → ((𝑞‘𝐾) = 𝐾 ↔ (𝑓‘𝐾) = 𝐾)) |
| 6 | 5 | cbvrabv 3407 | . . . 4 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
| 7 | 3, 6 | eqtri 2757 | . . 3 ⊢ 𝑄 = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
| 8 | 2, 7 | elrab2 3647 | . 2 ⊢ (𝐹 ∈ 𝑄 ↔ (𝐹 ∈ 𝑃 ∧ (𝐹‘𝐾) = 𝐾)) |
| 9 | eqid 2734 | . . . 4 ⊢ (SymGrp‘𝑁) = (SymGrp‘𝑁) | |
| 10 | symgfixf.p | . . . 4 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) | |
| 11 | 9, 10 | elsymgbas2 19300 | . . 3 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝑃 ↔ 𝐹:𝑁–1-1-onto→𝑁)) |
| 12 | 11 | anbi1d 631 | . 2 ⊢ (𝐹 ∈ 𝑉 → ((𝐹 ∈ 𝑃 ∧ (𝐹‘𝐾) = 𝐾) ↔ (𝐹:𝑁–1-1-onto→𝑁 ∧ (𝐹‘𝐾) = 𝐾))) |
| 13 | 8, 12 | bitrid 283 | 1 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝑄 ↔ (𝐹:𝑁–1-1-onto→𝑁 ∧ (𝐹‘𝐾) = 𝐾))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3397 –1-1-onto→wf1o 6489 ‘cfv 6490 Basecbs 17134 SymGrpcsymg 19296 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 df-struct 17072 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-tset 17194 df-efmnd 18792 df-symg 19297 |
| This theorem is referenced by: symgfixelsi 19362 symgfixf1 19364 symgfixfolem1 19365 |
| Copyright terms: Public domain | W3C validator |