![]() |
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 6913 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓‘𝐾) = (𝐹‘𝐾)) | |
2 | 1 | eqeq1d 2739 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝐾) = 𝐾 ↔ (𝐹‘𝐾) = 𝐾)) |
3 | symgfixf.q | . . . 4 ⊢ 𝑄 = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} | |
4 | fveq1 6913 | . . . . . 6 ⊢ (𝑞 = 𝑓 → (𝑞‘𝐾) = (𝑓‘𝐾)) | |
5 | 4 | eqeq1d 2739 | . . . . 5 ⊢ (𝑞 = 𝑓 → ((𝑞‘𝐾) = 𝐾 ↔ (𝑓‘𝐾) = 𝐾)) |
6 | 5 | cbvrabv 3447 | . . . 4 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
7 | 3, 6 | eqtri 2765 | . . 3 ⊢ 𝑄 = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
8 | 2, 7 | elrab2 3701 | . 2 ⊢ (𝐹 ∈ 𝑄 ↔ (𝐹 ∈ 𝑃 ∧ (𝐹‘𝐾) = 𝐾)) |
9 | eqid 2737 | . . . 4 ⊢ (SymGrp‘𝑁) = (SymGrp‘𝑁) | |
10 | symgfixf.p | . . . 4 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) | |
11 | 9, 10 | elsymgbas2 19414 | . . 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 1539 ∈ wcel 2108 {crab 3436 –1-1-onto→wf1o 6568 ‘cfv 6569 Basecbs 17254 SymGrpcsymg 19410 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-cnex 11218 ax-resscn 11219 ax-1cn 11220 ax-icn 11221 ax-addcl 11222 ax-addrcl 11223 ax-mulcl 11224 ax-mulrcl 11225 ax-mulcom 11226 ax-addass 11227 ax-mulass 11228 ax-distr 11229 ax-i2m1 11230 ax-1ne0 11231 ax-1rid 11232 ax-rnegex 11233 ax-rrecex 11234 ax-cnre 11235 ax-pre-lttri 11236 ax-pre-lttrn 11237 ax-pre-ltadd 11238 ax-pre-mulgt0 11239 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-pss 3986 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-tp 4639 df-op 4641 df-uni 4916 df-iun 5001 df-br 5152 df-opab 5214 df-mpt 5235 df-tr 5269 df-id 5587 df-eprel 5593 df-po 5601 df-so 5602 df-fr 5645 df-we 5647 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-pred 6329 df-ord 6395 df-on 6396 df-lim 6397 df-suc 6398 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-om 7895 df-1st 8022 df-2nd 8023 df-frecs 8314 df-wrecs 8345 df-recs 8419 df-rdg 8458 df-1o 8514 df-er 8753 df-map 8876 df-en 8994 df-dom 8995 df-sdom 8996 df-fin 8997 df-pnf 11304 df-mnf 11305 df-xr 11306 df-ltxr 11307 df-le 11308 df-sub 11501 df-neg 11502 df-nn 12274 df-2 12336 df-3 12337 df-4 12338 df-5 12339 df-6 12340 df-7 12341 df-8 12342 df-9 12343 df-n0 12534 df-z 12621 df-uz 12886 df-fz 13554 df-struct 17190 df-sets 17207 df-slot 17225 df-ndx 17237 df-base 17255 df-ress 17284 df-plusg 17320 df-tset 17326 df-efmnd 18904 df-symg 19411 |
This theorem is referenced by: symgfixelsi 19477 symgfixf1 19479 symgfixfolem1 19480 |
Copyright terms: Public domain | W3C validator |