Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rossros Structured version   Visualization version   GIF version

Theorem rossros 34324
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.
StepHypRef Expression
1 rossros.q . . . . 5 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ (𝑥𝑦) ∈ 𝑠))}
21rossspw 34313 . . . 4 (𝑆𝑄𝑆 ⊆ 𝒫 𝑂)
3 elpwg 4544 . . . 4 (𝑆𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂𝑆 ⊆ 𝒫 𝑂))
42, 3mpbird 257 . . 3 (𝑆𝑄𝑆 ∈ 𝒫 𝒫 𝑂)
510elros 34314 . . 3 (𝑆𝑄 → ∅ ∈ 𝑆)
6 uneq1 4101 . . . . . . . . . . . . 13 (𝑢 = 𝑥 → (𝑢𝑣) = (𝑥𝑣))
76eleq1d 2821 . . . . . . . . . . . 12 (𝑢 = 𝑥 → ((𝑢𝑣) ∈ 𝑠 ↔ (𝑥𝑣) ∈ 𝑠))
8 difeq1 4059 . . . . . . . . . . . . 13 (𝑢 = 𝑥 → (𝑢𝑣) = (𝑥𝑣))
98eleq1d 2821 . . . . . . . . . . . 12 (𝑢 = 𝑥 → ((𝑢𝑣) ∈ 𝑠 ↔ (𝑥𝑣) ∈ 𝑠))
107, 9anbi12d 633 . . . . . . . . . . 11 (𝑢 = 𝑥 → (((𝑢𝑣) ∈ 𝑠 ∧ (𝑢𝑣) ∈ 𝑠) ↔ ((𝑥𝑣) ∈ 𝑠 ∧ (𝑥𝑣) ∈ 𝑠)))
11 uneq2 4102 . . . . . . . . . . . . 13 (𝑣 = 𝑦 → (𝑥𝑣) = (𝑥𝑦))
1211eleq1d 2821 . . . . . . . . . . . 12 (𝑣 = 𝑦 → ((𝑥𝑣) ∈ 𝑠 ↔ (𝑥𝑦) ∈ 𝑠))
13 difeq2 4060 . . . . . . . . . . . . 13 (𝑣 = 𝑦 → (𝑥𝑣) = (𝑥𝑦))
1413eleq1d 2821 . . . . . . . . . . . 12 (𝑣 = 𝑦 → ((𝑥𝑣) ∈ 𝑠 ↔ (𝑥𝑦) ∈ 𝑠))
1512, 14anbi12d 633 . . . . . . . . . . 11 (𝑣 = 𝑦 → (((𝑥𝑣) ∈ 𝑠 ∧ (𝑥𝑣) ∈ 𝑠) ↔ ((𝑥𝑦) ∈ 𝑠 ∧ (𝑥𝑦) ∈ 𝑠)))
1610, 15cbvral2vw 3219 . . . . . . . . . 10 (∀𝑢𝑠𝑣𝑠 ((𝑢𝑣) ∈ 𝑠 ∧ (𝑢𝑣) ∈ 𝑠) ↔ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ (𝑥𝑦) ∈ 𝑠))
1716anbi2i 624 . . . . . . . . 9 ((∅ ∈ 𝑠 ∧ ∀𝑢𝑠𝑣𝑠 ((𝑢𝑣) ∈ 𝑠 ∧ (𝑢𝑣) ∈ 𝑠)) ↔ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ (𝑥𝑦) ∈ 𝑠)))
1817rabbii 3394 . . . . . . . 8 {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢𝑠𝑣𝑠 ((𝑢𝑣) ∈ 𝑠 ∧ (𝑢𝑣) ∈ 𝑠))} = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ (𝑥𝑦) ∈ 𝑠))}
191, 18eqtr4i 2762 . . . . . . 7 𝑄 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑢𝑠𝑣𝑠 ((𝑢𝑣) ∈ 𝑠 ∧ (𝑢𝑣) ∈ 𝑠))}
2019inelros 34317 . . . . . 6 ((𝑆𝑄𝑥𝑆𝑦𝑆) → (𝑥𝑦) ∈ 𝑆)
21203expb 1121 . . . . 5 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑦) ∈ 𝑆)
2219difelros 34316 . . . . . . . . 9 ((𝑆𝑄𝑥𝑆𝑦𝑆) → (𝑥𝑦) ∈ 𝑆)
23223expb 1121 . . . . . . . 8 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑦) ∈ 𝑆)
2423snssd 4730 . . . . . . 7 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → {(𝑥𝑦)} ⊆ 𝑆)
25 snex 5381 . . . . . . . 8 {(𝑥𝑦)} ∈ V
2625elpw 4545 . . . . . . 7 ({(𝑥𝑦)} ∈ 𝒫 𝑆 ↔ {(𝑥𝑦)} ⊆ 𝑆)
2724, 26sylibr 234 . . . . . 6 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → {(𝑥𝑦)} ∈ 𝒫 𝑆)
28 snfi 8990 . . . . . . 7 {(𝑥𝑦)} ∈ Fin
2928a1i 11 . . . . . 6 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → {(𝑥𝑦)} ∈ Fin)
30 disjxsn 5079 . . . . . . 7 Disj 𝑡 ∈ {(𝑥𝑦)}𝑡
3130a1i 11 . . . . . 6 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → Disj 𝑡 ∈ {(𝑥𝑦)}𝑡)
32 unisng 4868 . . . . . . . 8 ((𝑥𝑦) ∈ 𝑆 {(𝑥𝑦)} = (𝑥𝑦))
3323, 32syl 17 . . . . . . 7 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → {(𝑥𝑦)} = (𝑥𝑦))
3433eqcomd 2742 . . . . . 6 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑦) = {(𝑥𝑦)})
35 eleq1 2824 . . . . . . . 8 (𝑧 = {(𝑥𝑦)} → (𝑧 ∈ Fin ↔ {(𝑥𝑦)} ∈ Fin))
36 disjeq1 5059 . . . . . . . 8 (𝑧 = {(𝑥𝑦)} → (Disj 𝑡𝑧 𝑡Disj 𝑡 ∈ {(𝑥𝑦)}𝑡))
37 unieq 4861 . . . . . . . . 9 (𝑧 = {(𝑥𝑦)} → 𝑧 = {(𝑥𝑦)})
3837eqeq2d 2747 . . . . . . . 8 (𝑧 = {(𝑥𝑦)} → ((𝑥𝑦) = 𝑧 ↔ (𝑥𝑦) = {(𝑥𝑦)}))
3935, 36, 383anbi123d 1439 . . . . . . 7 (𝑧 = {(𝑥𝑦)} → ((𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧) ↔ ({(𝑥𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥𝑦)}𝑡 ∧ (𝑥𝑦) = {(𝑥𝑦)})))
4039rspcev 3564 . . . . . 6 (({(𝑥𝑦)} ∈ 𝒫 𝑆 ∧ ({(𝑥𝑦)} ∈ Fin ∧ Disj 𝑡 ∈ {(𝑥𝑦)}𝑡 ∧ (𝑥𝑦) = {(𝑥𝑦)})) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))
4127, 29, 31, 34, 40syl13anc 1375 . . . . 5 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))
4221, 41jca 511 . . . 4 ((𝑆𝑄 ∧ (𝑥𝑆𝑦𝑆)) → ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))
4342ralrimivva 3180 . . 3 (𝑆𝑄 → ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))
444, 5, 433jca 1129 . 2 (𝑆𝑄 → (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
45 rossros.n . . 3 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))}
4645issros 34319 . 2 (𝑆𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
4744, 46sylibr 234 1 (𝑆𝑄𝑆𝑁)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  wrex 3061  {crab 3389  cdif 3886  cun 3887  cin 3888  wss 3889  c0 4273  𝒫 cpw 4541  {csn 4567   cuni 4850  Disj wdisj 5052  Fincfn 8893
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2539  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-disj 5053  df-br 5086  df-opab 5148  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-om 7818  df-1o 8405  df-en 8894  df-fin 8897
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator