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 34390 is actually the class of all Moore
collections. This is also illustrated by the lack of sethood condition
in bj-ismoore 34391.
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 7479). 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 5335) , 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 34397. (Contributed by BJ, 8-Dec-2021.) |
Ref | Expression |
---|---|
bj-mooreset | ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elpw 5249 | . . 3 ⊢ ∅ ∈ 𝒫 𝐴 | |
2 | rint0 4909 | . . . . 5 ⊢ (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴) | |
3 | 2 | eleq1d 2897 | . . . 4 ⊢ (𝑥 = ∅ → ((∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 ↔ ∪ 𝐴 ∈ 𝐴)) |
4 | 3 | rspcv 3618 | . . 3 ⊢ (∅ ∈ 𝒫 𝐴 → (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴)) |
5 | 1, 4 | ax-mp 5 | . 2 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴) |
6 | uniexr 7479 | . 2 ⊢ (∪ 𝐴 ∈ 𝐴 → 𝐴 ∈ V) | |
7 | 5, 6 | syl 17 | 1 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∀wral 3138 Vcvv 3495 ∩ cin 3935 ∅c0 4291 𝒫 cpw 4539 ∪ cuni 4832 ∩ cint 4869 |
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 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rab 3147 df-v 3497 df-dif 3939 df-in 3943 df-ss 3952 df-nul 4292 df-pw 4541 df-uni 4833 df-int 4870 |
This theorem is referenced by: bj-ismoore 34391 |
Copyright terms: Public domain | W3C validator |