Theorem rossros 31549

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 31538	. . . 4 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ⊆ 𝒫 𝑂)
3		elpwg 4500	. . . 4 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ↔ 𝑆 ⊆ 𝒫 𝑂))
4	2, 3	mpbird 260	. . 3 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝒫 𝒫 𝑂)
5	1	0elros 31539	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)
6		uneq1 4083	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∪ 𝑣) = (𝑥 ∪ 𝑣))
7	6	eleq1d 2874	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑣) ∈ 𝑠))
8		difeq1 4043	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∖ 𝑣) = (𝑥 ∖ 𝑣))
9	8	eleq1d 2874	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑣) ∈ 𝑠))
10	7, 9	anbi12d 633	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑥 → (((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠)))
11		uneq2 4084	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∪ 𝑣) = (𝑥 ∪ 𝑦))
12	11	eleq1d 2874	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑦) ∈ 𝑠))
13		difeq2 4044	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∖ 𝑣) = (𝑥 ∖ 𝑦))
14	13	eleq1d 2874	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑦) ∈ 𝑠))
15	12, 14	anbi12d 633	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑦 → (((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
16	10, 15	cbvral2vw 3408	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))
17	16	anbi2i 625	. . . . . . . . 9 ⊢ ((∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠)) ↔ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
18	17	rabbii 3420	. . . . . . . 8 ⊢ {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))} = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
19	1, 18	eqtr4i 2824	. . . . . . 7 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))}
20	19	inelros 31542	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∩ 𝑦) ∈ 𝑆)
21	20	3expb 1117	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∩ 𝑦) ∈ 𝑆)
22	19	difelros 31541	. . . . . . . . 9 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∖ 𝑦) ∈ 𝑆)
23	22	3expb 1117	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) ∈ 𝑆)
24	23	snssd 4702	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
25		snex 5297	. . . . . . . 8 ⊢ {(𝑥 ∖ 𝑦)} ∈ V
26	25	elpw 4501	. . . . . . 7 ⊢ ({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ↔ {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
27	24, 26	sylibr 237	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆)
28		snfi 8577	. . . . . . 7 ⊢ {(𝑥 ∖ 𝑦)} ∈ Fin
29	28	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ Fin)
30		disjxsn 5023	. . . . . . 7 ⊢ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡
31	30	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡)
32		unisng 4819	. . . . . . . 8 ⊢ ((𝑥 ∖ 𝑦) ∈ 𝑆 → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
33	23, 32	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
34	33	eqcomd 2804	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})
35		eleq1 2877	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (𝑧 ∈ Fin ↔ {(𝑥 ∖ 𝑦)} ∈ Fin))
36		disjeq1 5002	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (Disj 𝑡 ∈ 𝑧 𝑡 ↔ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡))
37		unieq 4811	. . . . . . . . 9 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ∪ 𝑧 = ∪ {(𝑥 ∖ 𝑦)})
38	37	eqeq2d 2809	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑥 ∖ 𝑦) = ∪ 𝑧 ↔ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)}))
39	35, 36, 38	3anbi123d 1433	. . . . . . 7 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧) ↔ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})))
40	39	rspcev 3571	. . . . . 6 ⊢ (({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ∧ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
41	27, 29, 31, 34, 40	syl13anc 1369	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
42	21, 41	jca 515	. . . 4 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
43	42	ralrimivva 3156	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
44	4, 5, 43	3jca 1125	. 2 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
45		rossros.n	. . 3 ⊢ 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∩ 𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))}
46	45	issros 31544	. 2 ⊢ (𝑆 ∈ 𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
47	44, 46	sylibr 237	1 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝑁)

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107  {crab 3110   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880   ⊆ wss 3881  ∅c0 4243  𝒫 cpw 4497  {csn 4525  ∪ cuni 4800  Disj wdisj 4995  Fincfn 8492

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  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-disj 4996  df-br 5031  df-opab 5093  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-om 7561  df-1o 8085  df-en 8493  df-fin 8496

This theorem is referenced by: (None)