Theorem rossros 32779

Description: Rings of sets are semirings of sets. (Contributed by Thierry Arnoux, 18-Jul-2020.)

Hypotheses

Ref	Expression
rossros.q	⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
rossros.n	⊢ 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∩ 𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))}

Assertion

Ref	Expression
rossros	⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝑁)

Distinct variable groups:   𝑂,𝑠   𝑥,𝑄,𝑦   𝑆,𝑠,𝑥,𝑦,𝑧   𝑡,𝑠,𝑥,𝑦,𝑧

Allowed substitution hints:   𝑄(𝑧,𝑡,𝑠)   𝑆(𝑡)   𝑁(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑂(𝑥,𝑦,𝑧,𝑡)

Proof of Theorem rossros

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

Step	Hyp	Ref	Expression
1		rossros.q	. . . . 5 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
2	1	rossspw 32768	. . . 4 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ⊆ 𝒫 𝑂)
3		elpwg 4563	. . . 4 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ↔ 𝑆 ⊆ 𝒫 𝑂))
4	2, 3	mpbird 256	. . 3 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝒫 𝒫 𝑂)
5	1	0elros 32769	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)
6		uneq1 4116	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∪ 𝑣) = (𝑥 ∪ 𝑣))
7	6	eleq1d 2822	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑣) ∈ 𝑠))
8		difeq1 4075	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∖ 𝑣) = (𝑥 ∖ 𝑣))
9	8	eleq1d 2822	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑣) ∈ 𝑠))
10	7, 9	anbi12d 631	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑥 → (((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠)))
11		uneq2 4117	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∪ 𝑣) = (𝑥 ∪ 𝑦))
12	11	eleq1d 2822	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑦) ∈ 𝑠))
13		difeq2 4076	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∖ 𝑣) = (𝑥 ∖ 𝑦))
14	13	eleq1d 2822	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑦) ∈ 𝑠))
15	12, 14	anbi12d 631	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑦 → (((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
16	10, 15	cbvral2vw 3227	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))
17	16	anbi2i 623	. . . . . . . . 9 ⊢ ((∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠)) ↔ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
18	17	rabbii 3413	. . . . . . . 8 ⊢ {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))} = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
19	1, 18	eqtr4i 2767	. . . . . . 7 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))}
20	19	inelros 32772	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∩ 𝑦) ∈ 𝑆)
21	20	3expb 1120	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∩ 𝑦) ∈ 𝑆)
22	19	difelros 32771	. . . . . . . . 9 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∖ 𝑦) ∈ 𝑆)
23	22	3expb 1120	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) ∈ 𝑆)
24	23	snssd 4769	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
25		snex 5388	. . . . . . . 8 ⊢ {(𝑥 ∖ 𝑦)} ∈ V
26	25	elpw 4564	. . . . . . 7 ⊢ ({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ↔ {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
27	24, 26	sylibr 233	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆)
28		snfi 8988	. . . . . . 7 ⊢ {(𝑥 ∖ 𝑦)} ∈ Fin
29	28	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ Fin)
30		disjxsn 5098	. . . . . . 7 ⊢ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡
31	30	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡)
32		unisng 4886	. . . . . . . 8 ⊢ ((𝑥 ∖ 𝑦) ∈ 𝑆 → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
33	23, 32	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
34	33	eqcomd 2742	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})
35		eleq1 2825	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (𝑧 ∈ Fin ↔ {(𝑥 ∖ 𝑦)} ∈ Fin))
36		disjeq1 5077	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (Disj 𝑡 ∈ 𝑧 𝑡 ↔ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡))
37		unieq 4876	. . . . . . . . 9 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ∪ 𝑧 = ∪ {(𝑥 ∖ 𝑦)})
38	37	eqeq2d 2747	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑥 ∖ 𝑦) = ∪ 𝑧 ↔ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)}))
39	35, 36, 38	3anbi123d 1436	. . . . . . 7 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧) ↔ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})))
40	39	rspcev 3581	. . . . . 6 ⊢ (({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ∧ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
41	27, 29, 31, 34, 40	syl13anc 1372	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
42	21, 41	jca 512	. . . 4 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
43	42	ralrimivva 3197	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
44	4, 5, 43	3jca 1128	. 2 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
45		rossros.n	. . 3 ⊢ 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∩ 𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))}
46	45	issros 32774	. 2 ⊢ (𝑆 ∈ 𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
47	44, 46	sylibr 233	1 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝑁)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  {crab 3407   ∖ cdif 3907   ∪ cun 3908   ∩ cin 3909   ⊆ wss 3910  ∅c0 4282  𝒫 cpw 4560  {csn 4586  ∪ cuni 4865  Disj wdisj 5070  Fincfn 8883

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-mo 2538  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-disj 5071  df-br 5106  df-opab 5168  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-om 7803  df-1o 8412  df-en 8884  df-fin 8887

This theorem is referenced by: (None)