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 6662 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓‘𝐾) = (𝐹‘𝐾)) | |
2 | 1 | eqeq1d 2820 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝐾) = 𝐾 ↔ (𝐹‘𝐾) = 𝐾)) |
3 | symgfixf.q | . . . 4 ⊢ 𝑄 = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} | |
4 | fveq1 6662 | . . . . . 6 ⊢ (𝑞 = 𝑓 → (𝑞‘𝐾) = (𝑓‘𝐾)) | |
5 | 4 | eqeq1d 2820 | . . . . 5 ⊢ (𝑞 = 𝑓 → ((𝑞‘𝐾) = 𝐾 ↔ (𝑓‘𝐾) = 𝐾)) |
6 | 5 | cbvrabv 3489 | . . . 4 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
7 | 3, 6 | eqtri 2841 | . . 3 ⊢ 𝑄 = {𝑓 ∈ 𝑃 ∣ (𝑓‘𝐾) = 𝐾} |
8 | 2, 7 | elrab2 3680 | . 2 ⊢ (𝐹 ∈ 𝑄 ↔ (𝐹 ∈ 𝑃 ∧ (𝐹‘𝐾) = 𝐾)) |
9 | eqid 2818 | . . . 4 ⊢ (SymGrp‘𝑁) = (SymGrp‘𝑁) | |
10 | symgfixf.p | . . . 4 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) | |
11 | 9, 10 | elsymgbas2 18437 | . . 3 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝑃 ↔ 𝐹:𝑁–1-1-onto→𝑁)) |
12 | 11 | anbi1d 629 | . 2 ⊢ (𝐹 ∈ 𝑉 → ((𝐹 ∈ 𝑃 ∧ (𝐹‘𝐾) = 𝐾) ↔ (𝐹:𝑁–1-1-onto→𝑁 ∧ (𝐹‘𝐾) = 𝐾))) |
13 | 8, 12 | syl5bb 284 | 1 ⊢ (𝐹 ∈ 𝑉 → (𝐹 ∈ 𝑄 ↔ (𝐹:𝑁–1-1-onto→𝑁 ∧ (𝐹‘𝐾) = 𝐾))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 {crab 3139 –1-1-onto→wf1o 6347 ‘cfv 6348 Basecbs 16471 SymGrpcsymg 18433 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-plusg 16566 df-tset 16572 df-symg 18434 |
This theorem is referenced by: symgfixelsi 18492 symgfixf1 18494 symgfixfolem1 18495 |
Copyright terms: Public domain | W3C validator |