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

Theorem issros 30568
 Description: The property of being a semi-rings of sets, i.e. collections of sets containing the empty set, closed under finite intersection, and where complements can be written as finite disjoint unions. (Contributed by Thierry Arnoux, 18-Jul-2020.)
Hypothesis
Ref Expression
issros.1 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))}
Assertion
Ref Expression
issros (𝑆𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦   𝑂,𝑠   𝑆,𝑠,𝑥,𝑦,𝑧
Allowed substitution hints:   𝑆(𝑡)   𝑁(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑂(𝑥,𝑦,𝑧,𝑡)

Proof of Theorem issros
StepHypRef Expression
1 eleq2 2828 . . . 4 (𝑠 = 𝑆 → (∅ ∈ 𝑠 ↔ ∅ ∈ 𝑆))
2 eleq2 2828 . . . . . . 7 (𝑠 = 𝑆 → ((𝑥𝑦) ∈ 𝑠 ↔ (𝑥𝑦) ∈ 𝑆))
3 pweq 4305 . . . . . . . 8 (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
43rexeqdv 3284 . . . . . . 7 (𝑠 = 𝑆 → (∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧) ↔ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))
52, 4anbi12d 749 . . . . . 6 (𝑠 = 𝑆 → (((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)) ↔ ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
65raleqbi1dv 3285 . . . . 5 (𝑠 = 𝑆 → (∀𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)) ↔ ∀𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
76raleqbi1dv 3285 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)) ↔ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
81, 7anbi12d 749 . . 3 (𝑠 = 𝑆 → ((∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))) ↔ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))))
9 issros.1 . . 3 𝑁 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠𝑦𝑠 ((𝑥𝑦) ∈ 𝑠 ∧ ∃𝑧 ∈ 𝒫 𝑠(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))}
108, 9elrab2 3507 . 2 (𝑆𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))))
11 3anass 1081 . 2 ((𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))) ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧)))))
1210, 11bitr4i 267 1 (𝑆𝑁 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ ∅ ∈ 𝑆 ∧ ∀𝑥𝑆𝑦𝑆 ((𝑥𝑦) ∈ 𝑆 ∧ ∃𝑧 ∈ 𝒫 𝑆(𝑧 ∈ Fin ∧ Disj 𝑡𝑧 𝑡 ∧ (𝑥𝑦) = 𝑧))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   ∧ w3a 1072   = wceq 1632   ∈ wcel 2139  ∀wral 3050  ∃wrex 3051  {crab 3054   ∖ cdif 3712   ∩ cin 3714  ∅c0 4058  𝒫 cpw 4302  ∪ cuni 4588  Disj wdisj 4772  Fincfn 8123 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-in 3722  df-ss 3729  df-pw 4304 This theorem is referenced by:  srossspw  30569  0elsros  30570  inelsros  30571  diffiunisros  30572  rossros  30573
 Copyright terms: Public domain W3C validator