Theorem rossros 34692

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 34681	. . . 4 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ⊆ 𝒫 𝑂)
3		elpwg 4560	. . . 4 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ↔ 𝑆 ⊆ 𝒫 𝑂))
4	2, 3	mpbird 260	. . 3 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝒫 𝒫 𝑂)
5	1	0elros 34682	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∅ ∈ 𝑆)
6		uneq1 4108	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∪ 𝑣) = (𝑥 ∪ 𝑣))
7	6	eleq1d 2845	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑣) ∈ 𝑠))
8		difeq1 4067	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ∖ 𝑣) = (𝑥 ∖ 𝑣))
9	8	eleq1d 2845	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑣) ∈ 𝑠))
10	7, 9	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑥 → (((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠)))
11		uneq2 4109	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∪ 𝑣) = (𝑥 ∪ 𝑦))
12	11	eleq1d 2845	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∪ 𝑣) ∈ 𝑠 ↔ (𝑥 ∪ 𝑦) ∈ 𝑠))
13		difeq2 4068	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑦 → (𝑥 ∖ 𝑣) = (𝑥 ∖ 𝑦))
14	13	eleq1d 2845	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑦 → ((𝑥 ∖ 𝑣) ∈ 𝑠 ↔ (𝑥 ∖ 𝑦) ∈ 𝑠))
15	12, 14	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑦 → (((𝑥 ∪ 𝑣) ∈ 𝑠 ∧ (𝑥 ∖ 𝑣) ∈ 𝑠) ↔ ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
16	10, 15	cbvral2vw 3244	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))
17	16	anbi2i 635	. . . . . . . . 9 ⊢ ((∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠)) ↔ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠)))
18	17	rabbii 3417	. . . . . . . 8 ⊢ {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))} = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∪ 𝑦) ∈ 𝑠 ∧ (𝑥 ∖ 𝑦) ∈ 𝑠))}
19	1, 18	eqtr4i 2786	. . . . . . 7 ⊢ 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢 ∈ 𝑠 ∀𝑣 ∈ 𝑠 ((𝑢 ∪ 𝑣) ∈ 𝑠 ∧ (𝑢 ∖ 𝑣) ∈ 𝑠))}
20	19	inelros 34685	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∩ 𝑦) ∈ 𝑆)
21	20	3expb 1138	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∩ 𝑦) ∈ 𝑆)
22	19	difelros 34684	. . . . . . . . 9 ⊢ ((𝑆 ∈ 𝑄 ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 ∖ 𝑦) ∈ 𝑆)
23	22	3expb 1138	. . . . . . . 8 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) ∈ 𝑆)
24	23	snssd 4747	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
25		snex 5404	. . . . . . . 8 ⊢ {(𝑥 ∖ 𝑦)} ∈ V
26	25	elpw 4561	. . . . . . 7 ⊢ ({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ↔ {(𝑥 ∖ 𝑦)} ⊆ 𝑆)
27	24, 26	sylibr 237	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆)
28		snfi 9051	. . . . . . 7 ⊢ {(𝑥 ∖ 𝑦)} ∈ Fin
29	28	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → {(𝑥 ∖ 𝑦)} ∈ Fin)
30		disjxsn 5097	. . . . . . 7 ⊢ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡
31	30	a1i 11	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡)
32		unisng 4885	. . . . . . . 8 ⊢ ((𝑥 ∖ 𝑦) ∈ 𝑆 → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
33	23, 32	syl 18	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∪ {(𝑥 ∖ 𝑦)} = (𝑥 ∖ 𝑦))
34	33	eqcomd 2766	. . . . . 6 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})
35		eleq1 2848	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (𝑧 ∈ Fin ↔ {(𝑥 ∖ 𝑦)} ∈ Fin))
36		disjeq1 5077	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → (Disj 𝑡 ∈ 𝑧 𝑡 ↔ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡))
37		unieq 4878	. . . . . . . . 9 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ∪ 𝑧 = ∪ {(𝑥 ∖ 𝑦)})
38	37	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑥 ∖ 𝑦) = ∪ 𝑧 ↔ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)}))
39	35, 36, 38	3anbi123d 1464	. . . . . . 7 ⊢ (𝑧 = {(𝑥 ∖ 𝑦)} → ((𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧) ↔ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})))
40	39	rspcev 3576	. . . . . 6 ⊢ (({(𝑥 ∖ 𝑦)} ∈ 𝒫 𝑆 ∧ ({(𝑥 ∖ 𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥 ∖ 𝑦)}𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ {(𝑥 ∖ 𝑦)})) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
41	27, 29, 31, 34, 40	syl13anc 1399	. . . . 5 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))
42	21, 41	jca 521	. . . 4 ⊢ ((𝑆 ∈ 𝑄 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
43	42	ralrimivva 3205	. . 3 ⊢ (𝑆 ∈ 𝑄 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))
44	4, 5, 43	3jca 1146	. 2 ⊢ (𝑆 ∈ 𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
45		rossros.n	. . 3 ⊢ 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 ((𝑥 ∩ 𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧)))}
46	45	issros 34687	. 2 ⊢ (𝑆 ∈ 𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥 ∩ 𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡 ∈ 𝑧 𝑡 ∧ (𝑥 ∖ 𝑦) = ∪ 𝑧))))
47	44, 46	sylibr 237	1 ⊢ (𝑆 ∈ 𝑄 → 𝑆 ∈ 𝑁)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  {crab 3412   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867  Disj wdisj 5070  Fincfn 8953

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 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-disj 5071  df-br 5104  df-opab 5168  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-om 7864  df-1o 8456  df-en 8954  df-fin 8957

This theorem is used by: (None)