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

Theorem subsaliuncllem 44240
Description: A subspace sigma-algebra is closed under countable union. This is Lemma 121A (iii) of [Fremlin1] p. 35. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
subsaliuncllem.f 𝑦𝜑
subsaliuncllem.s (𝜑𝑆𝑉)
subsaliuncllem.g 𝐺 = (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
subsaliuncllem.e 𝐸 = (𝐻𝐺)
subsaliuncllem.h (𝜑𝐻 Fn ran 𝐺)
subsaliuncllem.y (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑦)
Assertion
Ref Expression
subsaliuncllem (𝜑 → ∃𝑒 ∈ (𝑆m ℕ)∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝑒𝑛) ∩ 𝐷))
Distinct variable groups:   𝐷,𝑒   𝑥,𝐷   𝑒,𝐸,𝑛   𝑥,𝐸,𝑛   𝑒,𝐹   𝑥,𝐹   𝑦,𝐺   𝑦,𝐻   𝑆,𝑒,𝑛   𝑥,𝑆   𝑦,𝑆,𝑛   𝜑,𝑛
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑒)   𝐷(𝑦,𝑛)   𝐸(𝑦)   𝐹(𝑦,𝑛)   𝐺(𝑥,𝑒,𝑛)   𝐻(𝑥,𝑒,𝑛)   𝑉(𝑥,𝑦,𝑒,𝑛)

Proof of Theorem subsaliuncllem
StepHypRef Expression
1 subsaliuncllem.e . . 3 𝐸 = (𝐻𝐺)
2 subsaliuncllem.h . . . . . . 7 (𝜑𝐻 Fn ran 𝐺)
3 subsaliuncllem.f . . . . . . . 8 𝑦𝜑
4 vex 3445 . . . . . . . . . . . . . 14 𝑦 ∈ V
5 subsaliuncllem.g . . . . . . . . . . . . . . 15 𝐺 = (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
65elrnmpt 5897 . . . . . . . . . . . . . 14 (𝑦 ∈ V → (𝑦 ∈ ran 𝐺 ↔ ∃𝑛 ∈ ℕ 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}))
74, 6ax-mp 5 . . . . . . . . . . . . 13 (𝑦 ∈ ran 𝐺 ↔ ∃𝑛 ∈ ℕ 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
87biimpi 215 . . . . . . . . . . . 12 (𝑦 ∈ ran 𝐺 → ∃𝑛 ∈ ℕ 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
9 id 22 . . . . . . . . . . . . . . . 16 (𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
10 ssrab2 4025 . . . . . . . . . . . . . . . . 17 {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ⊆ 𝑆
1110a1i 11 . . . . . . . . . . . . . . . 16 (𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ⊆ 𝑆)
129, 11eqsstrd 3970 . . . . . . . . . . . . . . 15 (𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → 𝑦𝑆)
1312a1i 11 . . . . . . . . . . . . . 14 (𝑛 ∈ ℕ → (𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → 𝑦𝑆))
1413rexlimiv 3141 . . . . . . . . . . . . 13 (∃𝑛 ∈ ℕ 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → 𝑦𝑆)
1514a1i 11 . . . . . . . . . . . 12 (𝑦 ∈ ran 𝐺 → (∃𝑛 ∈ ℕ 𝑦 = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} → 𝑦𝑆))
168, 15mpd 15 . . . . . . . . . . 11 (𝑦 ∈ ran 𝐺𝑦𝑆)
1716adantl 482 . . . . . . . . . 10 ((𝜑𝑦 ∈ ran 𝐺) → 𝑦𝑆)
18 subsaliuncllem.y . . . . . . . . . . 11 (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑦)
1918r19.21bi 3230 . . . . . . . . . 10 ((𝜑𝑦 ∈ ran 𝐺) → (𝐻𝑦) ∈ 𝑦)
2017, 19sseldd 3933 . . . . . . . . 9 ((𝜑𝑦 ∈ ran 𝐺) → (𝐻𝑦) ∈ 𝑆)
2120ex 413 . . . . . . . 8 (𝜑 → (𝑦 ∈ ran 𝐺 → (𝐻𝑦) ∈ 𝑆))
223, 21ralrimi 3236 . . . . . . 7 (𝜑 → ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑆)
232, 22jca 512 . . . . . 6 (𝜑 → (𝐻 Fn ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑆))
24 ffnfv 7048 . . . . . 6 (𝐻:ran 𝐺𝑆 ↔ (𝐻 Fn ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑆))
2523, 24sylibr 233 . . . . 5 (𝜑𝐻:ran 𝐺𝑆)
26 eqid 2736 . . . . . . . . 9 {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}
27 subsaliuncllem.s . . . . . . . . 9 (𝜑𝑆𝑉)
2826, 27rabexd 5277 . . . . . . . 8 (𝜑 → {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ∈ V)
2928ralrimivw 3143 . . . . . . 7 (𝜑 → ∀𝑛 ∈ ℕ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ∈ V)
305fnmpt 6624 . . . . . . 7 (∀𝑛 ∈ ℕ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ∈ V → 𝐺 Fn ℕ)
3129, 30syl 17 . . . . . 6 (𝜑𝐺 Fn ℕ)
32 dffn3 6664 . . . . . 6 (𝐺 Fn ℕ ↔ 𝐺:ℕ⟶ran 𝐺)
3331, 32sylib 217 . . . . 5 (𝜑𝐺:ℕ⟶ran 𝐺)
34 fco 6675 . . . . 5 ((𝐻:ran 𝐺𝑆𝐺:ℕ⟶ran 𝐺) → (𝐻𝐺):ℕ⟶𝑆)
3525, 33, 34syl2anc 584 . . . 4 (𝜑 → (𝐻𝐺):ℕ⟶𝑆)
36 nnex 12080 . . . . . 6 ℕ ∈ V
3736a1i 11 . . . . 5 (𝜑 → ℕ ∈ V)
3827, 37elmapd 8700 . . . 4 (𝜑 → ((𝐻𝐺) ∈ (𝑆m ℕ) ↔ (𝐻𝐺):ℕ⟶𝑆))
3935, 38mpbird 256 . . 3 (𝜑 → (𝐻𝐺) ∈ (𝑆m ℕ))
401, 39eqeltrid 2841 . 2 (𝜑𝐸 ∈ (𝑆m ℕ))
4133ffvelcdmda 7017 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (𝐺𝑛) ∈ ran 𝐺)
4218adantr 481 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑦)
43 fveq2 6825 . . . . . . . . 9 (𝑦 = (𝐺𝑛) → (𝐻𝑦) = (𝐻‘(𝐺𝑛)))
44 id 22 . . . . . . . . 9 (𝑦 = (𝐺𝑛) → 𝑦 = (𝐺𝑛))
4543, 44eleq12d 2831 . . . . . . . 8 (𝑦 = (𝐺𝑛) → ((𝐻𝑦) ∈ 𝑦 ↔ (𝐻‘(𝐺𝑛)) ∈ (𝐺𝑛)))
4645rspcva 3568 . . . . . . 7 (((𝐺𝑛) ∈ ran 𝐺 ∧ ∀𝑦 ∈ ran 𝐺(𝐻𝑦) ∈ 𝑦) → (𝐻‘(𝐺𝑛)) ∈ (𝐺𝑛))
4741, 42, 46syl2anc 584 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (𝐻‘(𝐺𝑛)) ∈ (𝐺𝑛))
4833ffund 6655 . . . . . . . . 9 (𝜑 → Fun 𝐺)
4948adantr 481 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → Fun 𝐺)
50 simpr 485 . . . . . . . . 9 ((𝜑𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
515dmeqi 5846 . . . . . . . . . . . . 13 dom 𝐺 = dom (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
5251a1i 11 . . . . . . . . . . . 12 (𝜑 → dom 𝐺 = dom (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}))
53 dmmptg 6180 . . . . . . . . . . . . 13 (∀𝑛 ∈ ℕ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ∈ V → dom (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}) = ℕ)
5429, 53syl 17 . . . . . . . . . . . 12 (𝜑 → dom (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}) = ℕ)
5552, 54eqtrd 2776 . . . . . . . . . . 11 (𝜑 → dom 𝐺 = ℕ)
5655eqcomd 2742 . . . . . . . . . 10 (𝜑 → ℕ = dom 𝐺)
5756adantr 481 . . . . . . . . 9 ((𝜑𝑛 ∈ ℕ) → ℕ = dom 𝐺)
5850, 57eleqtrd 2839 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → 𝑛 ∈ dom 𝐺)
5949, 58, 1fvcod 43102 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (𝐸𝑛) = (𝐻‘(𝐺𝑛)))
605a1i 11 . . . . . . . . 9 (𝜑𝐺 = (𝑛 ∈ ℕ ↦ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)}))
6128adantr 481 . . . . . . . . 9 ((𝜑𝑛 ∈ ℕ) → {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ∈ V)
6260, 61fvmpt2d 6944 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → (𝐺𝑛) = {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
6362eqcomd 2742 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} = (𝐺𝑛))
6459, 63eleq12d 2831 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → ((𝐸𝑛) ∈ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ↔ (𝐻‘(𝐺𝑛)) ∈ (𝐺𝑛)))
6547, 64mpbird 256 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (𝐸𝑛) ∈ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)})
66 ineq1 4152 . . . . . . 7 (𝑥 = (𝐸𝑛) → (𝑥𝐷) = ((𝐸𝑛) ∩ 𝐷))
6766eqeq2d 2747 . . . . . 6 (𝑥 = (𝐸𝑛) → ((𝐹𝑛) = (𝑥𝐷) ↔ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)))
6867elrab 3634 . . . . 5 ((𝐸𝑛) ∈ {𝑥𝑆 ∣ (𝐹𝑛) = (𝑥𝐷)} ↔ ((𝐸𝑛) ∈ 𝑆 ∧ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)))
6965, 68sylib 217 . . . 4 ((𝜑𝑛 ∈ ℕ) → ((𝐸𝑛) ∈ 𝑆 ∧ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)))
7069simprd 496 . . 3 ((𝜑𝑛 ∈ ℕ) → (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷))
7170ralrimiva 3139 . 2 (𝜑 → ∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷))
72 fveq1 6824 . . . . . 6 (𝑒 = 𝐸 → (𝑒𝑛) = (𝐸𝑛))
7372ineq1d 4158 . . . . 5 (𝑒 = 𝐸 → ((𝑒𝑛) ∩ 𝐷) = ((𝐸𝑛) ∩ 𝐷))
7473eqeq2d 2747 . . . 4 (𝑒 = 𝐸 → ((𝐹𝑛) = ((𝑒𝑛) ∩ 𝐷) ↔ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)))
7574ralbidv 3170 . . 3 (𝑒 = 𝐸 → (∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝑒𝑛) ∩ 𝐷) ↔ ∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)))
7675rspcev 3570 . 2 ((𝐸 ∈ (𝑆m ℕ) ∧ ∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝐸𝑛) ∩ 𝐷)) → ∃𝑒 ∈ (𝑆m ℕ)∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝑒𝑛) ∩ 𝐷))
7740, 71, 76syl2anc 584 1 (𝜑 → ∃𝑒 ∈ (𝑆m ℕ)∀𝑛 ∈ ℕ (𝐹𝑛) = ((𝑒𝑛) ∩ 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1540  wnf 1784  wcel 2105  wral 3061  wrex 3070  {crab 3403  Vcvv 3441  cin 3897  wss 3898  cmpt 5175  dom cdm 5620  ran crn 5621  ccom 5624  Fun wfun 6473   Fn wfn 6474  wf 6475  cfv 6479  (class class class)co 7337  m cmap 8686  cn 12074
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372  ax-un 7650  ax-cnex 11028  ax-1cn 11030  ax-addcl 11032
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3917  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5176  df-tr 5210  df-id 5518  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5575  df-we 5577  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6238  df-ord 6305  df-on 6306  df-lim 6307  df-suc 6308  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fo 6485  df-f1o 6486  df-fv 6487  df-ov 7340  df-oprab 7341  df-mpo 7342  df-om 7781  df-2nd 7900  df-frecs 8167  df-wrecs 8198  df-recs 8272  df-rdg 8311  df-map 8688  df-nn 12075
This theorem is referenced by:  subsaliuncl  44241
  Copyright terms: Public domain W3C validator