Theorem isros 31537

Description: The property of being a rings of sets, i.e. containing the empty set, and closed under finite union and set complement. (Contributed by Thierry Arnoux, 18-Jul-2020.)

Hypothesis

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

Assertion

Ref	Expression
isros	⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))

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

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

Proof of Theorem isros

Step	Hyp	Ref	Expression
1		eleq2 2878	. . . 4 ⊢ (𝑠 = 𝑆 → (∅ ∈ 𝑠 ↔ ∅ ∈ 𝑆))
2		eleq2 2878	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((𝑥 ∪ 𝑦) ∈ 𝑠 ↔ (𝑥 ∪ 𝑦) ∈ 𝑆))
3		eleq2 2878	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((𝑥 ∖ 𝑦) ∈ 𝑠 ↔ (𝑥 ∖ 𝑦) ∈ 𝑆))
4	2, 3	anbi12d 633	. . . . . 6 ⊢ (𝑠 = 𝑆 → (((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
5	4	raleqbi1dv 3356	. . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
6	5	raleqbi1dv 3356	. . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
7	1, 6	anbi12d 633	. . 3 ⊢ (𝑠 = 𝑆 → ((∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)) ↔ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
8		isros.1	. . 3 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
9	7, 8	elrab2 3631	. 2 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
10		3anass 1092	. 2 ⊢ ((𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)) ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
11		uneq1 4083	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥 ∪ 𝑦) = (𝑢 ∪ 𝑦))
12	11	eleq1d 2874	. . . . 5 ⊢ (𝑥 = 𝑢 → ((𝑥 ∪ 𝑦) ∈ 𝑆 ↔ (𝑢 ∪ 𝑦) ∈ 𝑆))
13		difeq1 4043	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥 ∖ 𝑦) = (𝑢 ∖ 𝑦))
14	13	eleq1d 2874	. . . . 5 ⊢ (𝑥 = 𝑢 → ((𝑥 ∖ 𝑦) ∈ 𝑆 ↔ (𝑢 ∖ 𝑦) ∈ 𝑆))
15	12, 14	anbi12d 633	. . . 4 ⊢ (𝑥 = 𝑢 → (((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆) ↔ ((𝑢 ∪ 𝑦) ∈ 𝑆 ∧ (𝑢 ∖ 𝑦) ∈ 𝑆)))
16		uneq2 4084	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢 ∪ 𝑦) = (𝑢 ∪ 𝑣))
17	16	eleq1d 2874	. . . . 5 ⊢ (𝑦 = 𝑣 → ((𝑢 ∪ 𝑦) ∈ 𝑆 ↔ (𝑢 ∪ 𝑣) ∈ 𝑆))
18		difeq2 4044	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢 ∖ 𝑦) = (𝑢 ∖ 𝑣))
19	18	eleq1d 2874	. . . . 5 ⊢ (𝑦 = 𝑣 → ((𝑢 ∖ 𝑦) ∈ 𝑆 ↔ (𝑢 ∖ 𝑣) ∈ 𝑆))
20	17, 19	anbi12d 633	. . . 4 ⊢ (𝑦 = 𝑣 → (((𝑢 ∪ 𝑦) ∈ 𝑆 ∧ (𝑢 ∖ 𝑦) ∈ 𝑆) ↔ ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
21	15, 20	cbvral2vw 3408	. . 3 ⊢ (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆) ↔ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆))
22	21	3anbi3i 1156	. 2 ⊢ ((𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)) ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
23	9, 10, 22	3bitr2i 302	1 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))

Syntax hints:   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  {crab 3110   ∖ cdif 3878   ∪ cun 3879  ∅c0 4243  𝒫 cpw 4497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886

This theorem is referenced by:  rossspw  31538  0elros  31539  unelros  31540  difelros  31541