Theorem rossspw 34583

Description: A ring of sets is a collection of subsets of 𝑂. (Contributed by Thierry Arnoux, 18-Jul-2020.)

Hypothesis

Ref	Expression
isros.1	⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}

Assertion

Ref	Expression
rossspw	⊢ (𝑆 ∈ 𝑄 → 𝑆 ⊆ 𝒫 𝑂)

Distinct variable groups:   𝑂,𝑠   𝑆,𝑠,𝑥,𝑦

Allowed substitution hints:   𝑄(𝑥, 𝑦, 𝑠)   𝑂(𝑥, 𝑦)

Proof of Theorem rossspw

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isros.1	. . . 4 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
2	1	isros 34582	. . 3 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
3	2	simp1bi 1163	. 2 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝒫 𝒫 𝑂)
4	3	elpwid 4576	1 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ⊆ 𝒫 𝑂)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082  {crab 3419   ∖ cdif 3905   ∪ cun 3906   ⊆ wss 3908  ∅c0 4289  𝒫 cpw 4567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-ss 3925  df-pw 4569

This theorem is used by:  rossros  34594