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

Theorem intsaluni 42619
Description: The union of an arbitrary intersection of sigma-algebras on the same set 𝑋, is 𝑋. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
intsaluni.ga (𝜑𝐺 ⊆ SAlg)
intsaluni.gn0 (𝜑𝐺 ≠ ∅)
intsaluni.x ((𝜑𝑠𝐺) → 𝑠 = 𝑋)
Assertion
Ref Expression
intsaluni (𝜑 𝐺 = 𝑋)
Distinct variable groups:   𝐺,𝑠   𝑋,𝑠   𝜑,𝑠

Proof of Theorem intsaluni
Dummy variables 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1915 . 2 𝑠𝜑
2 nfv 1915 . 2 𝑠 𝐺 = 𝑋
3 intsaluni.gn0 . . 3 (𝜑𝐺 ≠ ∅)
4 n0 4312 . . . 4 (𝐺 ≠ ∅ ↔ ∃𝑠 𝑠𝐺)
54biimpi 218 . . 3 (𝐺 ≠ ∅ → ∃𝑠 𝑠𝐺)
63, 5syl 17 . 2 (𝜑 → ∃𝑠 𝑠𝐺)
7 intss1 4893 . . . . . . 7 (𝑠𝐺 𝐺𝑠)
87unissd 4850 . . . . . 6 (𝑠𝐺 𝐺 𝑠)
98adantl 484 . . . . 5 ((𝜑𝑠𝐺) → 𝐺 𝑠)
10 intsaluni.x . . . . 5 ((𝜑𝑠𝐺) → 𝑠 = 𝑋)
119, 10sseqtrd 4009 . . . 4 ((𝜑𝑠𝐺) → 𝐺𝑋)
1210adantr 483 . . . . . . . . . . 11 (((𝜑𝑠𝐺) ∧ 𝑡𝐺) → 𝑠 = 𝑋)
13 eleq1w 2897 . . . . . . . . . . . . . . . 16 (𝑠 = 𝑡 → (𝑠𝐺𝑡𝐺))
1413anbi2d 630 . . . . . . . . . . . . . . 15 (𝑠 = 𝑡 → ((𝜑𝑠𝐺) ↔ (𝜑𝑡𝐺)))
15 unieq 4851 . . . . . . . . . . . . . . . 16 (𝑠 = 𝑡 𝑠 = 𝑡)
1615eqeq1d 2825 . . . . . . . . . . . . . . 15 (𝑠 = 𝑡 → ( 𝑠 = 𝑋 𝑡 = 𝑋))
1714, 16imbi12d 347 . . . . . . . . . . . . . 14 (𝑠 = 𝑡 → (((𝜑𝑠𝐺) → 𝑠 = 𝑋) ↔ ((𝜑𝑡𝐺) → 𝑡 = 𝑋)))
1817, 10chvarvv 2005 . . . . . . . . . . . . 13 ((𝜑𝑡𝐺) → 𝑡 = 𝑋)
1918eqcomd 2829 . . . . . . . . . . . 12 ((𝜑𝑡𝐺) → 𝑋 = 𝑡)
2019adantlr 713 . . . . . . . . . . 11 (((𝜑𝑠𝐺) ∧ 𝑡𝐺) → 𝑋 = 𝑡)
2112, 20eqtrd 2858 . . . . . . . . . 10 (((𝜑𝑠𝐺) ∧ 𝑡𝐺) → 𝑠 = 𝑡)
22 intsaluni.ga . . . . . . . . . . . . 13 (𝜑𝐺 ⊆ SAlg)
2322sselda 3969 . . . . . . . . . . . 12 ((𝜑𝑡𝐺) → 𝑡 ∈ SAlg)
24 saluni 42616 . . . . . . . . . . . 12 (𝑡 ∈ SAlg → 𝑡𝑡)
2523, 24syl 17 . . . . . . . . . . 11 ((𝜑𝑡𝐺) → 𝑡𝑡)
2625adantlr 713 . . . . . . . . . 10 (((𝜑𝑠𝐺) ∧ 𝑡𝐺) → 𝑡𝑡)
2721, 26eqeltrd 2915 . . . . . . . . 9 (((𝜑𝑠𝐺) ∧ 𝑡𝐺) → 𝑠𝑡)
2827ralrimiva 3184 . . . . . . . 8 ((𝜑𝑠𝐺) → ∀𝑡𝐺 𝑠𝑡)
29 uniexg 7468 . . . . . . . . . 10 (𝑠𝐺 𝑠 ∈ V)
3029adantl 484 . . . . . . . . 9 ((𝜑𝑠𝐺) → 𝑠 ∈ V)
31 elintg 4886 . . . . . . . . 9 ( 𝑠 ∈ V → ( 𝑠 𝐺 ↔ ∀𝑡𝐺 𝑠𝑡))
3230, 31syl 17 . . . . . . . 8 ((𝜑𝑠𝐺) → ( 𝑠 𝐺 ↔ ∀𝑡𝐺 𝑠𝑡))
3328, 32mpbird 259 . . . . . . 7 ((𝜑𝑠𝐺) → 𝑠 𝐺)
3433adantr 483 . . . . . 6 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → 𝑠 𝐺)
35 simpr 487 . . . . . . 7 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → 𝑥𝑋)
3610eqcomd 2829 . . . . . . . 8 ((𝜑𝑠𝐺) → 𝑋 = 𝑠)
3736adantr 483 . . . . . . 7 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → 𝑋 = 𝑠)
3835, 37eleqtrd 2917 . . . . . 6 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → 𝑥 𝑠)
39 eleq2 2903 . . . . . . 7 (𝑦 = 𝑠 → (𝑥𝑦𝑥 𝑠))
4039rspcev 3625 . . . . . 6 (( 𝑠 𝐺𝑥 𝑠) → ∃𝑦 𝐺𝑥𝑦)
4134, 38, 40syl2anc 586 . . . . 5 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → ∃𝑦 𝐺𝑥𝑦)
42 eluni2 4844 . . . . 5 (𝑥 𝐺 ↔ ∃𝑦 𝐺𝑥𝑦)
4341, 42sylibr 236 . . . 4 (((𝜑𝑠𝐺) ∧ 𝑥𝑋) → 𝑥 𝐺)
4411, 43eqelssd 3990 . . 3 ((𝜑𝑠𝐺) → 𝐺 = 𝑋)
4544ex 415 . 2 (𝜑 → (𝑠𝐺 𝐺 = 𝑋))
461, 2, 6, 45exlimimdd 2219 1 (𝜑 𝐺 = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wex 1780  wcel 2114  wne 3018  wral 3140  wrex 3141  Vcvv 3496  wss 3938  c0 4293   cuni 4840   cint 4878  SAlgcsalg 42600
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-in 3945  df-ss 3954  df-nul 4294  df-pw 4543  df-uni 4841  df-int 4879  df-salg 42601
This theorem is referenced by:  intsal  42620  salgenuni  42627
  Copyright terms: Public domain W3C validator