Theorem 0elros 31433

Description: A ring of sets contains the empty set. (Contributed by Thierry Arnoux, 18-Jul-2020.)

Hypothesis

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

Assertion

Ref	Expression
0elros	⊢ (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)

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

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

Proof of Theorem 0elros

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

Step	Hyp	Ref	Expression
1		isros.1	. . 3 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
2	1	isros 31431	. 2 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
3	2	simp2bi 1142	1 ⊢ (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  ∀wral 3141  {crab 3145   ∖ cdif 3936   ∪ cun 3937  ∅c0 4294  𝒫 cpw 4542

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944

This theorem is referenced by:  fiunelros  31437  rossros  31443