Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  0elros Structured version   Visualization version   GIF version

Theorem 0elros 34803
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.
StepHypRef Expression
1 isros.1 . . 3 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
21isros 34801 . 2 (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
32simp2bi 1164 1 (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412   ∖ cdif 4045   ∪ cun 4149  ∅c0 4278  𝒫 cpw 4556
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 4047  df-un 4151
This theorem is used by:  fiunelros  34807  rossros  34813
  Copyright terms: Public domain W3C validator