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

Theorem sigapisys 31319
Description: All sigma-algebras are pi-systems. (Contributed by Thierry Arnoux, 13-Jun-2020.)
Hypothesis
Ref Expression
ispisys.p 𝑃 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (fi‘𝑠) ⊆ 𝑠}
Assertion
Ref Expression
sigapisys (sigAlgebra‘𝑂) ⊆ 𝑃
Distinct variable group:   𝑂,𝑠
Allowed substitution hint:   𝑃(𝑠)

Proof of Theorem sigapisys
Dummy variables 𝑡 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sigasspw 31280 . . . . 5 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ⊆ 𝒫 𝑂)
2 velpw 4550 . . . . 5 (𝑡 ∈ 𝒫 𝒫 𝑂𝑡 ⊆ 𝒫 𝑂)
31, 2sylibr 235 . . . 4 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ∈ 𝒫 𝒫 𝑂)
4 elrnsiga 31290 . . . . . . 7 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ran sigAlgebra)
54adantr 481 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑡 ran sigAlgebra)
6 eldifsn 4718 . . . . . . . . . 10 (𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) ↔ (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
76biimpi 217 . . . . . . . . 9 (𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) → (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
87adantl 482 . . . . . . . 8 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
98simpld 495 . . . . . . 7 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ (𝒫 𝑡 ∩ Fin))
109elin1d 4179 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ 𝒫 𝑡)
119elin2d 4180 . . . . . . 7 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ Fin)
12 fict 9110 . . . . . . 7 (𝑥 ∈ Fin → 𝑥 ≼ ω)
1311, 12syl 17 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ≼ ω)
148simprd 496 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ≠ ∅)
15 sigaclci 31296 . . . . . 6 (((𝑡 ran sigAlgebra ∧ 𝑥 ∈ 𝒫 𝑡) ∧ (𝑥 ≼ ω ∧ 𝑥 ≠ ∅)) → 𝑥𝑡)
165, 10, 13, 14, 15syl22anc 836 . . . . 5 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥𝑡)
1716ralrimiva 3187 . . . 4 (𝑡 ∈ (sigAlgebra‘𝑂) → ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡)
183, 17jca 512 . . 3 (𝑡 ∈ (sigAlgebra‘𝑂) → (𝑡 ∈ 𝒫 𝒫 𝑂 ∧ ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡))
19 ispisys.p . . . 4 𝑃 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (fi‘𝑠) ⊆ 𝑠}
2019ispisys2 31317 . . 3 (𝑡𝑃 ↔ (𝑡 ∈ 𝒫 𝒫 𝑂 ∧ ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡))
2118, 20sylibr 235 . 2 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡𝑃)
2221ssriv 3975 1 (sigAlgebra‘𝑂) ⊆ 𝑃
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1530  wcel 2107  wne 3021  wral 3143  {crab 3147  cdif 3937  cin 3939  wss 3940  c0 4295  𝒫 cpw 4542  {csn 4564   cuni 4837   cint 4874   class class class wbr 5063  ran crn 5555  cfv 6354  ωcom 7573  cdom 8501  Fincfn 8503  ficfi 8868  sigAlgebracsiga 31272
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455  ax-inf2 9098  ax-ac2 9879
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-fal 1543  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-ral 3148  df-rex 3149  df-reu 3150  df-rmo 3151  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-pss 3958  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-tp 4569  df-op 4571  df-uni 4838  df-int 4875  df-iun 4919  df-iin 4920  df-br 5064  df-opab 5126  df-mpt 5144  df-tr 5170  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-se 5514  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-isom 6363  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7574  df-1st 7685  df-2nd 7686  df-wrecs 7943  df-recs 8004  df-rdg 8042  df-er 8284  df-map 8403  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-fi 8869  df-card 9362  df-acn 9365  df-ac 9536  df-siga 31273
This theorem is referenced by:  sigapildsys  31326
  Copyright terms: Public domain W3C validator