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 6696 | . 2 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐽 ∈ dom Clsd) | |
2 | fncld 21624 | . . 3 ⊢ Clsd Fn Top | |
3 | fndm 6449 | . . 3 ⊢ (Clsd Fn Top → dom Clsd = Top) | |
4 | 2, 3 | ax-mp 5 | . 2 ⊢ dom Clsd = Top |
5 | 1, 4 | eleqtrdi 2923 | 1 ⊢ (𝐶 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 dom cdm 5549 Fn wfn 6344 ‘cfv 6349 Topctop 21495 Clsdccld 21618 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-iota 6308 df-fun 6351 df-fn 6352 df-fv 6357 df-cld 21621 |
This theorem is referenced by: cldss 21631 cldopn 21633 difopn 21636 iincld 21641 uncld 21643 cldcls 21644 clsss2 21674 opncldf3 21688 restcldi 21775 restcldr 21776 paste 21896 connsubclo 22026 txcld 22205 cldregopn 33674 |
Copyright terms: Public domain | W3C validator |