| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-mooreset | Structured version Visualization version GIF version | ||
| Description: A Moore collection is a
set. Therefore, the class Moore of all
Moore sets defined in df-bj-moore 37138 is actually the class of all Moore
collections. This is also illustrated by the lack of sethood condition
in bj-ismoore 37139.
Note that the closed sets of a topology form a Moore collection, so a topology is a set, and this remark also applies to many other families of sets (namely, as soon as the whole set is required to be a set of the family, then the associated kind of family has no proper classes: that this condition suffices to impose sethood can be seen in this proof, which relies crucially on uniexr 7691). Note: if, in the above predicate, we substitute 𝒫 𝑋 for 𝐴, then the last ∈ 𝒫 𝑋 could be weakened to ⊆ 𝑋, and then the predicate would be obviously satisfied since ⊢ ∪ 𝒫 𝑋 = 𝑋 (unipw 5386), making 𝒫 𝑋 a Moore collection in this weaker sense, for any class 𝑋, even proper, but the addition of this single case does not add anything interesting. Instead, we have the biconditional bj-discrmoore 37145. (Contributed by BJ, 8-Dec-2021.) |
| Ref | Expression |
|---|---|
| bj-mooreset | ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0elpw 5289 | . . 3 ⊢ ∅ ∈ 𝒫 𝐴 | |
| 2 | rint0 4933 | . . . . 5 ⊢ (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴) | |
| 3 | 2 | eleq1d 2816 | . . . 4 ⊢ (𝑥 = ∅ → ((∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 ↔ ∪ 𝐴 ∈ 𝐴)) |
| 4 | 3 | rspcv 3568 | . . 3 ⊢ (∅ ∈ 𝒫 𝐴 → (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴)) |
| 5 | 1, 4 | ax-mp 5 | . 2 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴) |
| 6 | uniexr 7691 | . 2 ⊢ (∪ 𝐴 ∈ 𝐴 → 𝐴 ∈ V) | |
| 7 | 5, 6 | syl 17 | 1 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ∀wral 3047 Vcvv 3436 ∩ cin 3896 ∅c0 4278 𝒫 cpw 4545 ∪ cuni 4854 ∩ cint 4892 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pow 5298 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-in 3904 df-ss 3914 df-nul 4279 df-pw 4547 df-uni 4855 df-int 4893 |
| This theorem is referenced by: bj-ismoore 37139 |
| Copyright terms: Public domain | W3C validator |