Theorem isros 34783

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 2850	. . . 4 ⊢ (𝑠 = 𝑆 → (∅ ∈ 𝑠 ↔ ∅ ∈ 𝑆))
2		eleq2 2850	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((𝑥 ∪ 𝑦) ∈ 𝑠 ↔ (𝑥 ∪ 𝑦) ∈ 𝑆))
3		eleq2 2850	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((𝑥 ∖ 𝑦) ∈ 𝑠 ↔ (𝑥 ∖ 𝑦) ∈ 𝑆))
4	2, 3	anbi12d 644	. . . . . 6 ⊢ (𝑠 = 𝑆 → (((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
5	4	raleqbi1dv 3330	. . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
6	5	raleqbi1dv 3330	. . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)))
7	1, 6	anbi12d 644	. . 3 ⊢ (𝑠 = 𝑆 → ((∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)) ↔ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
8		isros.1	. . 3 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
9	7, 8	elrab2 3649	. 2 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
10		3anass 1111	. 2 ⊢ ((𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)) ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆))))
11		uneq1 4108	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥 ∪ 𝑦) = (𝑢 ∪ 𝑦))
12	11	eleq1d 2846	. . . . 5 ⊢ (𝑥 = 𝑢 → ((𝑥 ∪ 𝑦) ∈ 𝑆 ↔ (𝑢 ∪ 𝑦) ∈ 𝑆))
13		difeq1 4067	. . . . . 6 ⊢ (𝑥 = 𝑢 → (𝑥 ∖ 𝑦) = (𝑢 ∖ 𝑦))
14	13	eleq1d 2846	. . . . 5 ⊢ (𝑥 = 𝑢 → ((𝑥 ∖ 𝑦) ∈ 𝑆 ↔ (𝑢 ∖ 𝑦) ∈ 𝑆))
15	12, 14	anbi12d 644	. . . 4 ⊢ (𝑥 = 𝑢 → (((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆) ↔ ((𝑢 ∪ 𝑦) ∈ 𝑆 ∧ (𝑢 ∖ 𝑦) ∈ 𝑆)))
16		uneq2 4109	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢 ∪ 𝑦) = (𝑢 ∪ 𝑣))
17	16	eleq1d 2846	. . . . 5 ⊢ (𝑦 = 𝑣 → ((𝑢 ∪ 𝑦) ∈ 𝑆 ↔ (𝑢 ∪ 𝑣) ∈ 𝑆))
18		difeq2 4068	. . . . . 6 ⊢ (𝑦 = 𝑣 → (𝑢 ∖ 𝑦) = (𝑢 ∖ 𝑣))
19	18	eleq1d 2846	. . . . 5 ⊢ (𝑦 = 𝑣 → ((𝑢 ∖ 𝑦) ∈ 𝑆 ↔ (𝑢 ∖ 𝑣) ∈ 𝑆))
20	17, 19	anbi12d 644	. . . 4 ⊢ (𝑦 = 𝑣 → (((𝑢 ∪ 𝑦) ∈ 𝑆 ∧ (𝑢 ∖ 𝑦) ∈ 𝑆) ↔ ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
21	15, 20	cbvral2vw 3245	. . 3 ⊢ (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆) ↔ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆))
22	21	3anbi3i 1177	. 2 ⊢ ((𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∪ 𝑦) ∈ 𝑆 ∧ (𝑥 ∖ 𝑦) ∈ 𝑆)) ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))
23	9, 10, 22	3bitr2i 302	1 ⊢ (𝑆 ∈ 𝑄 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ 𝑆 ((𝑢 ∪ 𝑣) ∈ 𝑆 ∧ (𝑢 ∖ 𝑣) ∈ 𝑆)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413   ∖ cdif 3896   ∪ cun 3897  ∅c0 4279  𝒫 cpw 4557

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 2147  ax-9 2155  ax-ext 2733

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904

This theorem is used by:  rossspw  34784  0elros  34785  unelros  34786  difelros  34787