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

Theorem pwldsys 34772
Description: The power set of the universe set 𝑂 is always a lambda-system. (Contributed by Thierry Arnoux, 21-Jun-2020.)
Hypothesis
Ref Expression
isldsys.l 𝐿 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑂 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠))}
Assertion
Ref Expression
pwldsys (𝑂 ∈ 𝑉 → 𝒫 𝑂 ∈ 𝐿)
Distinct variable groups:   𝑦,𝑠   𝑂,𝑠,𝑥   𝑥,𝑉
Allowed substitution hints:   𝐿(𝑥, 𝑦, 𝑠)   𝑂(𝑦)   𝑉(𝑦, 𝑠)

Proof of Theorem pwldsys
StepHypRef Expression
1 pwexg 5340 . . 3 (𝑂 ∈ 𝑉 → 𝒫 𝑂 ∈ V)
2 pwidg 4577 . . 3 (𝒫 𝑂 ∈ V → 𝒫 𝑂 ∈ 𝒫 𝒫 𝑂)
31, 2syl 18 . 2 (𝑂 ∈ 𝑉 → 𝒫 𝑂 ∈ 𝒫 𝒫 𝑂)
4 0elpw 5317 . . . 4 ∅ ∈ 𝒫 𝑂
54a1i 11 . . 3 (𝑂 ∈ 𝑉 → ∅ ∈ 𝒫 𝑂)
6 pwidg 4577 . . . . . 6 (𝑂 ∈ 𝑉 → 𝑂 ∈ 𝒫 𝑂)
76adantr 486 . . . . 5 ((𝑂 ∈ 𝑉 ∧ 𝑥 ∈ 𝒫 𝑂) → 𝑂 ∈ 𝒫 𝑂)
87elpwdifcl 33104 . . . 4 ((𝑂 ∈ 𝑉 ∧ 𝑥 ∈ 𝒫 𝑂) → (𝑂 ∖ 𝑥) ∈ 𝒫 𝑂)
98ralrimiva 3155 . . 3 (𝑂 ∈ 𝑉 → ∀𝑥 ∈ 𝒫 𝑂(𝑂 ∖ 𝑥) ∈ 𝒫 𝑂)
10 elpwi 4564 . . . . . . . 8 (𝑥 ∈ 𝒫 𝒫 𝑂 → 𝑥 ⊆ 𝒫 𝑂)
11 sspwuni 5060 . . . . . . . 8 (𝑥 ⊆ 𝒫 𝑂 ↔ ∪ 𝑥 ⊆ 𝑂)
1210, 11sylib 221 . . . . . . 7 (𝑥 ∈ 𝒫 𝒫 𝑂 → ∪ 𝑥 ⊆ 𝑂)
1312adantl 487 . . . . . 6 ((𝑂 ∈ 𝑉 ∧ 𝑥 ∈ 𝒫 𝒫 𝑂) → ∪ 𝑥 ⊆ 𝑂)
14 vuniex 7745 . . . . . . 7 ∪ 𝑥 ∈ V
1514elpw 4561 . . . . . 6 (∪ 𝑥 ∈ 𝒫 𝑂 ↔ ∪ 𝑥 ⊆ 𝑂)
1613, 15sylibr 237 . . . . 5 ((𝑂 ∈ 𝑉 ∧ 𝑥 ∈ 𝒫 𝒫 𝑂) → ∪ 𝑥 ∈ 𝒫 𝑂)
1716a1d 26 . . . 4 ((𝑂 ∈ 𝑉 ∧ 𝑥 ∈ 𝒫 𝒫 𝑂) → ((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝒫 𝑂))
1817ralrimiva 3155 . . 3 (𝑂 ∈ 𝑉 → ∀𝑥 ∈ 𝒫 𝒫 𝑂((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝒫 𝑂))
195, 9, 183jca 1146 . 2 (𝑂 ∈ 𝑉 → (∅ ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝑂(𝑂 ∖ 𝑥) ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝒫 𝑂((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝒫 𝑂)))
20 isldsys.l . . 3 𝐿 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (∅ ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑂 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝑠))}
2120isldsys 34771 . 2 (𝒫 𝑂 ∈ 𝐿 ↔ (𝒫 𝑂 ∈ 𝒫 𝒫 𝑂 ∧ (∅ ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝑂(𝑂 ∖ 𝑥) ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝒫 𝑂((𝑥 ≼ ω ∧ Disj 𝑦 ∈ 𝑥 𝑦) → ∪ 𝑥 ∈ 𝒫 𝑂))))
223, 19, 21sylanbrc 595 1 (𝑂 ∈ 𝑉 → 𝒫 𝑂 ∈ 𝐿)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867  Disj wdisj 5070   class class class wbr 5103  ωcom 7866   ≼ cdom 8955
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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906  df-ss 3916  df-nul 4280  df-pw 4559  df-uni 4868
This theorem is used by:  ldgenpisyslem1  34778
  Copyright terms: Public domain W3C validator