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

Theorem isldsys 34555
Description: The property of being a lambda-system or Dynkin system. Lambda-systems contain the empty set, are closed under complement, and closed under countable disjoint union. (Contributed by Thierry Arnoux, 13-Jun-2020.)
Hypothesis
Ref Expression
isldsys.l 𝐿 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠 (𝑂𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑠))}
Assertion
Ref Expression
isldsys (𝑆𝐿 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆 (𝑂𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑆))))
Distinct variable groups:   𝑦,𝑠   𝑂,𝑠,𝑥   𝑆,𝑠,𝑥
Allowed substitution hints:   𝑆(𝑦)   𝐿(𝑥, 𝑦, 𝑠)   𝑂(𝑦)

Proof of Theorem isldsys
StepHypRef Expression
1 eleq2 2851 . . 3 (𝑠 = 𝑆 → (∅ ∈ 𝑠 ↔ ∅ ∈ 𝑆))
2 eleq2 2851 . . . 4 (𝑠 = 𝑆 → ((𝑂𝑥) ∈ 𝑠 ↔ (𝑂𝑥) ∈ 𝑆))
32raleqbi1dv 3332 . . 3 (𝑠 = 𝑆 → (∀𝑥𝑠 (𝑂𝑥) ∈ 𝑠 ↔ ∀𝑥𝑆 (𝑂𝑥) ∈ 𝑆))
4 pweq 4575 . . . 4 (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
5 eleq2 2851 . . . . 5 (𝑠 = 𝑆 → ( 𝑥𝑠 𝑥𝑆))
65imbi2d 343 . . . 4 (𝑠 = 𝑆 → (((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑠) ↔ ((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑆)))
74, 6raleqbidv 3337 . . 3 (𝑠 = 𝑆 → (∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑠) ↔ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑆)))
81, 3, 73anbi123d 1463 . 2 (𝑠 = 𝑆 → ((∅ ∈ 𝑠 ∧ ∀𝑥𝑠 (𝑂𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑠)) ↔ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆 (𝑂𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑆))))
9 isldsys.l . 2 𝐿 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥𝑠 (𝑂𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑠))}
108, 9elrab2 3653 1 (𝑆𝐿 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥𝑆 (𝑂𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦𝑥 𝑦) → 𝑥𝑆))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wcel 2142  wral 3078  {crab 3415  cdif 3901  c0 4285  𝒫 cpw 4561   cuni 4871  Disj wdisj 5075   class class class wbr 5108  ωcom 7860  cdom 8939
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-3an 1104  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-ss 3921  df-pw 4563
This theorem is used by:  pwldsys  34556  unelldsys  34557  sigaldsys  34558  ldsysgenld  34559  sigapildsyslem  34560  sigapildsys  34561  ldgenpisyslem1  34562
  Copyright terms: Public domain W3C validator