Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > symgtset | Structured version Visualization version GIF version |
Description: The topology of the symmetric group on 𝐴. This component is defined on a larger set than the true base - the product topology is defined on the set of all functions, not just bijections - but the definition of TopOpen ensures that it is trimmed down before it gets use. (Contributed by Mario Carneiro, 29-Aug-2015.) (Proof revised by AV, 30-Mar-2024.) |
Ref | Expression |
---|---|
symggrp.1 | ⊢ 𝐺 = (SymGrp‘𝐴) |
Ref | Expression |
---|---|
symgtset | ⊢ (𝐴 ∈ 𝑉 → (∏t‘(𝐴 × {𝒫 𝐴})) = (TopSet‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2736 | . . 3 ⊢ (EndoFMnd‘𝐴) = (EndoFMnd‘𝐴) | |
2 | 1 | efmndtset 18260 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∏t‘(𝐴 × {𝒫 𝐴})) = (TopSet‘(EndoFMnd‘𝐴))) |
3 | symggrp.1 | . . . . 5 ⊢ 𝐺 = (SymGrp‘𝐴) | |
4 | eqid 2736 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
5 | 3, 4 | symgbas 18717 | . . . 4 ⊢ (Base‘𝐺) = {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} |
6 | fvexd 6710 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (Base‘𝐺) ∈ V) | |
7 | 5, 6 | eqeltrrid 2836 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ∈ V) |
8 | eqid 2736 | . . . 4 ⊢ ((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}) = ((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}) | |
9 | eqid 2736 | . . . 4 ⊢ (TopSet‘(EndoFMnd‘𝐴)) = (TopSet‘(EndoFMnd‘𝐴)) | |
10 | 8, 9 | resstset 16849 | . . 3 ⊢ ({𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ∈ V → (TopSet‘(EndoFMnd‘𝐴)) = (TopSet‘((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}))) |
11 | 7, 10 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → (TopSet‘(EndoFMnd‘𝐴)) = (TopSet‘((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}))) |
12 | eqid 2736 | . . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} = {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} | |
13 | 3, 12 | symgval 18715 | . . . . 5 ⊢ 𝐺 = ((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}) |
14 | 13 | eqcomi 2745 | . . . 4 ⊢ ((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴}) = 𝐺 |
15 | 14 | fveq2i 6698 | . . 3 ⊢ (TopSet‘((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴})) = (TopSet‘𝐺) |
16 | 15 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → (TopSet‘((EndoFMnd‘𝐴) ↾s {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴})) = (TopSet‘𝐺)) |
17 | 2, 11, 16 | 3eqtrd 2775 | 1 ⊢ (𝐴 ∈ 𝑉 → (∏t‘(𝐴 × {𝒫 𝐴})) = (TopSet‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2112 {cab 2714 Vcvv 3398 𝒫 cpw 4499 {csn 4527 × cxp 5534 –1-1-onto→wf1o 6357 ‘cfv 6358 (class class class)co 7191 Basecbs 16666 ↾s cress 16667 TopSetcts 16755 ∏tcpt 16897 EndoFMndcefmnd 18249 SymGrpcsymg 18713 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-cnex 10750 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 ax-pre-mulgt0 10771 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-1o 8180 df-er 8369 df-map 8488 df-en 8605 df-dom 8606 df-sdom 8607 df-fin 8608 df-pnf 10834 df-mnf 10835 df-xr 10836 df-ltxr 10837 df-le 10838 df-sub 11029 df-neg 11030 df-nn 11796 df-2 11858 df-3 11859 df-4 11860 df-5 11861 df-6 11862 df-7 11863 df-8 11864 df-9 11865 df-n0 12056 df-z 12142 df-uz 12404 df-fz 13061 df-struct 16668 df-ndx 16669 df-slot 16670 df-base 16672 df-sets 16673 df-ress 16674 df-plusg 16762 df-tset 16768 df-efmnd 18250 df-symg 18714 |
This theorem is referenced by: symgtopn 18752 |
Copyright terms: Public domain | W3C validator |