Theorem bj-mooreset 36581

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

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

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 5452), 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 36590. (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 5356	. . 3 ⊢ ∅ ∈ 𝒫 𝐴
2		rint0 4993	. . . . 5 ⊢ (𝑥 = ∅ → (∪ 𝐴 ∩ ∩ 𝑥) = ∪ 𝐴)
3	2	eleq1d 2814	. . . 4 ⊢ (𝑥 = ∅ → ((∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 ↔ ∪ 𝐴 ∈ 𝐴))
4	3	rspcv 3605	. . 3 ⊢ (∅ ∈ 𝒫 𝐴 → (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴))
5	1, 4	ax-mp 5	. 2 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → ∪ 𝐴 ∈ 𝐴)
6		uniexr 7765	. 2 ⊢ (∪ 𝐴 ∈ 𝐴 → 𝐴 ∈ V)
7	5, 6	syl 17	1 ⊢ (∀𝑥 ∈ 𝒫 𝐴(∪ 𝐴 ∩ ∩ 𝑥) ∈ 𝐴 → 𝐴 ∈ V)

Syntax hints:   → wi 4   = wceq 1534   ∈ wcel 2099  ∀wral 3058  Vcvv 3471   ∩ cin 3946  ∅c0 4323  𝒫 cpw 4603  ∪ cuni 4908  ∩ cint 4949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pow 5365

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-in 3954  df-ss 3964  df-nul 4324  df-pw 4605  df-uni 4909  df-int 4950

This theorem is referenced by:  bj-ismoore  36584