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 31407
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 31368 . . . . 5 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ⊆ 𝒫 𝑂)
2 velpw 4545 . . . . 5 (𝑡 ∈ 𝒫 𝒫 𝑂𝑡 ⊆ 𝒫 𝑂)
31, 2sylibr 236 . . . 4 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ∈ 𝒫 𝒫 𝑂)
4 elrnsiga 31378 . . . . . . 7 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡 ran sigAlgebra)
54adantr 483 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑡 ran sigAlgebra)
6 eldifsn 4711 . . . . . . . . . 10 (𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) ↔ (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
76biimpi 218 . . . . . . . . 9 (𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) → (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
87adantl 484 . . . . . . . 8 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → (𝑥 ∈ (𝒫 𝑡 ∩ Fin) ∧ 𝑥 ≠ ∅))
98simpld 497 . . . . . . 7 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ (𝒫 𝑡 ∩ Fin))
109elin1d 4173 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ 𝒫 𝑡)
119elin2d 4174 . . . . . . 7 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ∈ Fin)
12 fict 9108 . . . . . . 7 (𝑥 ∈ Fin → 𝑥 ≼ ω)
1311, 12syl 17 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ≼ ω)
148simprd 498 . . . . . 6 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥 ≠ ∅)
15 sigaclci 31384 . . . . . 6 (((𝑡 ran sigAlgebra ∧ 𝑥 ∈ 𝒫 𝑡) ∧ (𝑥 ≼ ω ∧ 𝑥 ≠ ∅)) → 𝑥𝑡)
165, 10, 13, 14, 15syl22anc 836 . . . . 5 ((𝑡 ∈ (sigAlgebra‘𝑂) ∧ 𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅})) → 𝑥𝑡)
1716ralrimiva 3180 . . . 4 (𝑡 ∈ (sigAlgebra‘𝑂) → ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡)
183, 17jca 514 . . 3 (𝑡 ∈ (sigAlgebra‘𝑂) → (𝑡 ∈ 𝒫 𝒫 𝑂 ∧ ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡))
19 ispisys.p . . . 4 𝑃 = {𝑠 ∈ 𝒫 𝒫 𝑂 ∣ (fi‘𝑠) ⊆ 𝑠}
2019ispisys2 31405 . . 3 (𝑡𝑃 ↔ (𝑡 ∈ 𝒫 𝒫 𝑂 ∧ ∀𝑥 ∈ ((𝒫 𝑡 ∩ Fin) ∖ {∅}) 𝑥𝑡))
2118, 20sylibr 236 . 2 (𝑡 ∈ (sigAlgebra‘𝑂) → 𝑡𝑃)
2221ssriv 3969 1 (sigAlgebra‘𝑂) ⊆ 𝑃
Colors of variables: wff setvar class
Syntax hints:  wa 398   = wceq 1531  wcel 2108  wne 3014  wral 3136  {crab 3140  cdif 3931  cin 3933  wss 3934  c0 4289  𝒫 cpw 4537  {csn 4559   cuni 4830   cint 4867   class class class wbr 5057  ran crn 5549  cfv 6348  ωcom 7572  cdom 8499  Fincfn 8501  ficfi 8866  sigAlgebracsiga 31360
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-inf2 9096  ax-ac2 9877
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-fal 1544  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-iin 4913  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-se 5508  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-isom 6357  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-1st 7681  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-er 8281  df-map 8400  df-en 8502  df-dom 8503  df-sdom 8504  df-fin 8505  df-fi 8867  df-card 9360  df-acn 9363  df-ac 9534  df-siga 31361
This theorem is referenced by:  sigapildsys  31414
  Copyright terms: Public domain W3C validator