Theorem isldsys 33149

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

Step	Hyp	Ref	Expression
1		eleq2 2822	. . 3 ⊢ (𝑠 = 𝑆 → (∅ ∈ 𝑠 ↔ ∅ ∈ 𝑆))
2		eleq2 2822	. . . 4 ⊢ (𝑠 = 𝑆 → ((𝑂 ∖ 𝑥) ∈ 𝑠 ↔ (𝑂 ∖ 𝑥) ∈ 𝑆))
3	2	raleqbi1dv 3333	. . 3 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 (𝑂 ∖ 𝑥) ∈ 𝑠 ↔ ∀𝑥 ∈ 𝑆 (𝑂 ∖ 𝑥) ∈ 𝑆))
4		pweq 4616	. . . 4 ⊢ (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
5		eleq2 2822	. . . . 5 ⊢ (𝑠 = 𝑆 → (∪ 𝑥 ∈ 𝑠 ↔ ∪ 𝑥 ∈ 𝑆))
6	5	imbi2d 340	. . . 4 ⊢ (𝑠 = 𝑆 → (((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠) ↔ ((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑆)))
7	4, 6	raleqbidv 3342	. . 3 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠) ↔ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑆)))
8	1, 3, 7	3anbi123d 1436	. 2 ⊢ (𝑠 = 𝑆 → ((∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑂 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠)) ↔ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑂 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑆))))
9		isldsys.l	. 2 ⊢ 𝐿 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑂 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠))}
10	8, 9	elrab2 3686	1 ⊢ (𝑆 ∈ 𝐿 ↔ (𝑆 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑂 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑆))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3061  {crab 3432   ∖ cdif 3945  ∅c0 4322  𝒫 cpw 4602  ∪ cuni 4908  Disj wdisj 5113   class class class wbr 5148  ωcom 7854   ≼ cdom 8936

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703

This theorem depends on definitions:  df-bi 206  df-an 397  df-3an 1089  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-in 3955  df-ss 3965  df-pw 4604

This theorem is referenced by:  pwldsys  33150  unelldsys  33151  sigaldsys  33152  ldsysgenld  33153  sigapildsyslem  33154  sigapildsys  33155  ldgenpisyslem1  33156