Theorem bj-mooreset 38162

Description: A Moore collection is a set. Therefore, the class Moore of all Moore sets defined in df-bj-moore 38164 is actually the class of all Moore collections. This is also illustrated by the lack of sethood condition in bj-ismoore 38165.

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 7784).

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 5421), 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 38171. (Contributed by BJ, 8-Dec-2021.)

Assertion

Ref	Expression
bj-mooreset	⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V)

Distinct variable group:   𝑥,𝐴

Proof of Theorem bj-mooreset

Step	Hyp	Ref	Expression
1		0elpw 5320	. . 3 ⊢ ∅ ∈ 𝒫 𝐴
2		rint0 4950	. . . . 5 ⊢ (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴)
3	2	eleq1d 2848	. . . 4 ⊢ (𝑥 = ∅ → ((∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 ↔ ∪ 𝐴 ∈ 𝐴))
4	3	rspcv 3575	. . 3 ⊢ (∅ ∈ 𝒫 𝐴 → (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴))
5	1, 4	ax-mp 5	. 2 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴)
6		uniexr 7784	. 2 ⊢ (∪ 𝐴 ∈ 𝐴 → 𝐴 ∈ V)
7	5, 6	syl 18	1 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  ∀wral 3079  Vcvv 3453   ∩ cin 4091  ∅c0 4280  𝒫 cpw 4559  ∪ cuni 4869  ∩ cint 4909

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-nul 4281  df-pw 4561  df-uni 4870  df-int 4910

This theorem is used by:  bj-ismoore  38165