Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  issalgend Structured version   Visualization version   GIF version

Theorem issalgend 46294
Description: One side of dfsalgen2 46297. If a sigma-algebra on 𝑋 includes 𝑋 and it is included in all the sigma-algebras with such two properties, then it is the sigma-algebra generated by 𝑋. (Contributed by Glauco Siliprandi, 3-Jan-2021.)
Hypotheses
Ref Expression
issalgend.x (𝜑𝑋𝑉)
issalgend.s (𝜑𝑆 ∈ SAlg)
issalgend.u (𝜑 𝑆 = 𝑋)
issalgend.i (𝜑𝑋𝑆)
issalgend.a ((𝜑 ∧ (𝑦 ∈ SAlg ∧ 𝑦 = 𝑋𝑋𝑦)) → 𝑆𝑦)
Assertion
Ref Expression
issalgend (𝜑 → (SalGen‘𝑋) = 𝑆)
Distinct variable groups:   𝑦,𝑆   𝑦,𝑋   𝜑,𝑦
Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem issalgend
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 issalgend.x . . 3 (𝜑𝑋𝑉)
2 eqid 2735 . . 3 (SalGen‘𝑋) = (SalGen‘𝑋)
3 issalgend.s . . 3 (𝜑𝑆 ∈ SAlg)
4 issalgend.i . . 3 (𝜑𝑋𝑆)
5 issalgend.u . . 3 (𝜑 𝑆 = 𝑋)
61, 2, 3, 4, 5salgenss 46292 . 2 (𝜑 → (SalGen‘𝑋) ⊆ 𝑆)
7 simpl 482 . . . . . 6 ((𝜑𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}) → 𝜑)
8 elrabi 3690 . . . . . . 7 (𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} → 𝑦 ∈ SAlg)
98adantl 481 . . . . . 6 ((𝜑𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}) → 𝑦 ∈ SAlg)
10 unieq 4923 . . . . . . . . . . . 12 (𝑠 = 𝑦 𝑠 = 𝑦)
1110eqeq1d 2737 . . . . . . . . . . 11 (𝑠 = 𝑦 → ( 𝑠 = 𝑋 𝑦 = 𝑋))
12 sseq2 4022 . . . . . . . . . . 11 (𝑠 = 𝑦 → (𝑋𝑠𝑋𝑦))
1311, 12anbi12d 632 . . . . . . . . . 10 (𝑠 = 𝑦 → (( 𝑠 = 𝑋𝑋𝑠) ↔ ( 𝑦 = 𝑋𝑋𝑦)))
1413elrab 3695 . . . . . . . . 9 (𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} ↔ (𝑦 ∈ SAlg ∧ ( 𝑦 = 𝑋𝑋𝑦)))
1514biimpi 216 . . . . . . . 8 (𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} → (𝑦 ∈ SAlg ∧ ( 𝑦 = 𝑋𝑋𝑦)))
1615simprld 772 . . . . . . 7 (𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} → 𝑦 = 𝑋)
1716adantl 481 . . . . . 6 ((𝜑𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}) → 𝑦 = 𝑋)
1815simprrd 774 . . . . . . 7 (𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} → 𝑋𝑦)
1918adantl 481 . . . . . 6 ((𝜑𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}) → 𝑋𝑦)
20 issalgend.a . . . . . 6 ((𝜑 ∧ (𝑦 ∈ SAlg ∧ 𝑦 = 𝑋𝑋𝑦)) → 𝑆𝑦)
217, 9, 17, 19, 20syl13anc 1371 . . . . 5 ((𝜑𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}) → 𝑆𝑦)
2221ralrimiva 3144 . . . 4 (𝜑 → ∀𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}𝑆𝑦)
23 ssint 4969 . . . 4 (𝑆 {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)} ↔ ∀𝑦 ∈ {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)}𝑆𝑦)
2422, 23sylibr 234 . . 3 (𝜑𝑆 {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)})
25 salgenval 46277 . . . 4 (𝑋𝑉 → (SalGen‘𝑋) = {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)})
261, 25syl 17 . . 3 (𝜑 → (SalGen‘𝑋) = {𝑠 ∈ SAlg ∣ ( 𝑠 = 𝑋𝑋𝑠)})
2724, 26sseqtrrd 4037 . 2 (𝜑𝑆 ⊆ (SalGen‘𝑋))
286, 27eqssd 4013 1 (𝜑 → (SalGen‘𝑋) = 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  {crab 3433  wss 3963   cuni 4912   cint 4951  cfv 6563  SAlgcsalg 46264  SalGencsalgen 46268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fun 6565  df-fv 6571  df-salg 46265  df-salgen 46269
This theorem is referenced by:  dfsalgen2  46297
  Copyright terms: Public domain W3C validator