Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cldrcl | Structured version Visualization version GIF version |
Description: Reverse closure of the closed set operation. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
Ref | Expression |
---|---|
cldrcl | ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfvdm 6220 | . 2 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐽 ∈ dom Clsd) | |
2 | fncld 20826 | . . 3 ⊢ Clsd Fn Top | |
3 | fndm 5990 | . . 3 ⊢ (Clsd Fn Top → dom Clsd = Top) | |
4 | 2, 3 | ax-mp 5 | . 2 ⊢ dom Clsd = Top |
5 | 1, 4 | syl6eleq 2711 | 1 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 dom cdm 5114 Fn wfn 5883 ‘cfv 5888 Topctop 20698 Clsdccld 20820 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fn 5891 df-fv 5896 df-cld 20823 |
This theorem is referenced by: cldss 20833 cldopn 20835 difopn 20838 iincld 20843 uncld 20845 cldcls 20846 clsss2 20876 opncldf3 20890 restcldi 20977 restcldr 20978 paste 21098 connsubclo 21227 txcld 21406 cldregopn 32326 |
Copyright terms: Public domain | W3C validator |