| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > salpreimagtge | Structured version Visualization version GIF version | ||
| Description: If all the preimages of left-open, unbounded above intervals, belong to a sigma-algebra, then all the preimages of left-closed, unbounded above intervals, belong to the sigma-algebra. (iii) implies (iv) in Proposition 121B of [Fremlin1] p. 35. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
| Ref | Expression |
|---|---|
| salpreimagtge.x | ⊢ Ⅎ𝑥𝜑 |
| salpreimagtge.a | ⊢ Ⅎ𝑎𝜑 |
| salpreimagtge.s | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| salpreimagtge.b | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) |
| salpreimagtge.p | ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ 𝑎 < 𝐵} ∈ 𝑆) |
| salpreimagtge.c | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| Ref | Expression |
|---|---|
| salpreimagtge | ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵} ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | salpreimagtge.x | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | salpreimagtge.b | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*) | |
| 3 | salpreimagtge.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 4 | 1, 2, 3 | preimageiingt 46749 | . 2 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵} = ∩ 𝑛 ∈ ℕ {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵}) |
| 5 | salpreimagtge.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
| 6 | nnct 13999 | . . . 4 ⊢ ℕ ≼ ω | |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝜑 → ℕ ≼ ω) |
| 8 | nnn0 45405 | . . . 4 ⊢ ℕ ≠ ∅ | |
| 9 | 8 | a1i 11 | . . 3 ⊢ (𝜑 → ℕ ≠ ∅) |
| 10 | 3 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐶 ∈ ℝ) |
| 11 | nnrecre 12282 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ) | |
| 12 | 11 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℝ) |
| 13 | 10, 12 | resubcld 11665 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐶 − (1 / 𝑛)) ∈ ℝ) |
| 14 | salpreimagtge.a | . . . . . . 7 ⊢ Ⅎ𝑎𝜑 | |
| 15 | nfv 1914 | . . . . . . 7 ⊢ Ⅎ𝑎(𝐶 − (1 / 𝑛)) ∈ ℝ | |
| 16 | 14, 15 | nfan 1899 | . . . . . 6 ⊢ Ⅎ𝑎(𝜑 ∧ (𝐶 − (1 / 𝑛)) ∈ ℝ) |
| 17 | nfv 1914 | . . . . . 6 ⊢ Ⅎ𝑎{𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆 | |
| 18 | 16, 17 | nfim 1896 | . . . . 5 ⊢ Ⅎ𝑎((𝜑 ∧ (𝐶 − (1 / 𝑛)) ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆) |
| 19 | ovex 7438 | . . . . 5 ⊢ (𝐶 − (1 / 𝑛)) ∈ V | |
| 20 | eleq1 2822 | . . . . . . 7 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → (𝑎 ∈ ℝ ↔ (𝐶 − (1 / 𝑛)) ∈ ℝ)) | |
| 21 | 20 | anbi2d 630 | . . . . . 6 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → ((𝜑 ∧ 𝑎 ∈ ℝ) ↔ (𝜑 ∧ (𝐶 − (1 / 𝑛)) ∈ ℝ))) |
| 22 | breq1 5122 | . . . . . . . 8 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → (𝑎 < 𝐵 ↔ (𝐶 − (1 / 𝑛)) < 𝐵)) | |
| 23 | 22 | rabbidv 3423 | . . . . . . 7 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → {𝑥 ∈ 𝐴 ∣ 𝑎 < 𝐵} = {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵}) |
| 24 | 23 | eleq1d 2819 | . . . . . 6 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → ({𝑥 ∈ 𝐴 ∣ 𝑎 < 𝐵} ∈ 𝑆 ↔ {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆)) |
| 25 | 21, 24 | imbi12d 344 | . . . . 5 ⊢ (𝑎 = (𝐶 − (1 / 𝑛)) → (((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ 𝑎 < 𝐵} ∈ 𝑆) ↔ ((𝜑 ∧ (𝐶 − (1 / 𝑛)) ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆))) |
| 26 | salpreimagtge.p | . . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ 𝑎 < 𝐵} ∈ 𝑆) | |
| 27 | 18, 19, 25, 26 | vtoclf 3543 | . . . 4 ⊢ ((𝜑 ∧ (𝐶 − (1 / 𝑛)) ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆) |
| 28 | 13, 27 | syldan 591 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆) |
| 29 | 5, 7, 9, 28 | saliincl 46356 | . 2 ⊢ (𝜑 → ∩ 𝑛 ∈ ℕ {𝑥 ∈ 𝐴 ∣ (𝐶 − (1 / 𝑛)) < 𝐵} ∈ 𝑆) |
| 30 | 4, 29 | eqeltrd 2834 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵} ∈ 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2108 ≠ wne 2932 {crab 3415 ∅c0 4308 ∩ ciin 4968 class class class wbr 5119 (class class class)co 7405 ωcom 7861 ≼ cdom 8957 ℝcr 11128 1c1 11130 ℝ*cxr 11268 < clt 11269 ≤ cle 11270 − cmin 11466 / cdiv 11894 ℕcn 12240 SAlgcsalg 46337 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-iin 4970 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8719 df-map 8842 df-en 8960 df-dom 8961 df-sdom 8962 df-sup 9454 df-inf 9455 df-card 9953 df-acn 9956 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-n0 12502 df-z 12589 df-uz 12853 df-q 12965 df-rp 13009 df-fl 13809 df-salg 46338 |
| This theorem is referenced by: salpreimalelt 46758 salpreimagtlt 46759 issmfge 46799 |
| Copyright terms: Public domain | W3C validator |